资源论文On Combinations of Binary Qualitative Constraint Calculi

On Combinations of Binary Qualitative Constraint Calculi

2019-11-15 | |  59 |   35 |   0

Abstract Qualitative constraint calculi are representation formalisms that allow for effificient reasoning about spatial and temporal information. Many of the calculi discussed in the fifield of Qualitative Spatial and Temporal Reasoning can be defifined as combinations of other, simpler and more compact formalisms. On the other hand, existing calculi can be combined to a new formalism in which one can represent, and reason about, different aspects of a domain at the same time. For example, Gerevini and Renz presented a loose combination of the region connection calculus RCC-8 and the point algebra: the resulting formalism integrates topological and qualitative size relations between spatially extended objects. In this paper we compare the approach by Gerevini and Renz to a method that generates a new qualitative calculus by exploiting the semantic interdependencies between the component calculi. We will compare these two methods and analyze some formal relationships between a combined calculus and its components. The paper is completed by an empirical case study in which the reasoning performance of the suggested methods is compared on random test instances.

上一篇:Knowing More — From Global to Local Correspondence

下一篇:Relational Random Forests Based on Random Relational Rules

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...