Relation Variables in Qualitative Spatial Reasoning

  title={Relation Variables in Qualitative Spatial Reasoning},
  author={Sebastian Brand},
  • S. Brand
  • Published in KI 20 September 2004
  • Computer Science
We study an alternative to the prevailing approach to modelling qualitative spatial reasoning (QSR) problems as constraint satisfaction problems. In the standard approach, a relation between objects is a constraint whereas in the alternative approach it is a variable. 
Constraint-based qualitative simulation
  • K. Apt, S. Brand
  • Computer Science
    12th International Symposium on Temporal Representation and Reasoning (TIME'05)
  • 2005
We consider qualitative simulation involving a finite set of qualitative relations in presence of complete knowledge about their interrelationship. We show how it can be naturally captured by means
Spatial Representation and Reasoning: Integrating Synthetic Character's Visual Perception and Symbolic Representation
A framework for handling information about how objects establish relationships with each other in the space is proposed, a model to address systems composed of multiple characters endowed with qualitative spatial reasoning.
Just-In-Time Constraint-Based Inference for Qualitative Spatial and Temporal Reasoning
A research roadmap for going beyond the state of the art in qualitative spatial and temporal reasoning (QSTR) via defining tools for tackling dynamic variants of the fundamental reasoning problems in this discipline, i.e., problems stated in terms of changing input data.
Studying the use and effect of graph decomposition in qualitative spatial and temporal reasoning
It is proved that a recently proposed decomposition-based approach for checking the satisfiability of qualitative spatial constraint networks lacks soundness, and a particular tree decomposition is presented that allows for cost-free utilization of parallelism for a qualitative constraint language that has patchwork for satisfiable atomic networks.
Algorithmic Contributions to Qualitative Constraint-based Spatial and Temporal Reasoning. (Contributions Algorithmiques au Raisonnement Spatial et Temporel basé sur des Contraintes Qualitatives)
Le raisonnement spatial et temporel qualitatif est un domaine principal d’etudes de l’intelligence artificielle et, en particulier, du domaine de la representation des connaissances, qui traite des
Rule-based constraint propagation : theory and applications
This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate.
A Continuation Method for Nash Equilibria in Structured Games
This approach provides the first efficient algorithm for computing exact equilibria in graphical games with arbitrary topology, and the first algorithm to exploit fine-grained structural properties of MAIDs.
Qualitative CSP, Finite CSP, and SAT: Comparing Methods for Qualitative Constraint-based Reasoning
This paper reports on the results of a broad empirical study in which the performance of several reasoners on instances from different qualitative formalisms are compared, and confirms a conjecture by Bessiere stating that support-based constraint propagation algorithms provide better performance for large-sized qualitative calculi.


Qualitative Spatial Representation and Reasoning: An Overview
The paper is a overview of the major qualitative spatial representation and reasoning techniques including ontological aspects, topology, distance, orientation and shape, and qualitative spatial reasoning including reasoning about spatial change.
A Spatial Logic based on Regions and Connection
An interval logic for reasoning about space is described, which supports a simpler ontology, has fewer functions and relations, yet does not su er in terms of its useful expressiveness.
Combining cardinal direction relations and relative orientation relations in Qualitative Spatial Reasoning
An original constraint propagation procedure, PcS4c+(), for cCOA-CSPs (cCOA Constraint Satisfaction Problems) is presented, which aims at achieving path consistency for the CDA projection and achieving strong 4-consistency for the ROA projection.
On the utilization of spatial structures for cognitively plausible and efficient reasoning
  • C. Freksa, K. Zimmermann
  • Computer Science
    [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics
  • 1992
The authors present an approach to representing and processing qualitative orientation information which is motivated by cognitive considerations about the knowledge acquisition process and a basic iconic notation for spatial orientation relations which exploits the spatial structure of the domain.
The Complexity of Reasoning about Spatial Congruence
  • M. Cristani
  • Mathematics, Computer Science
    J. Artif. Intell. Res.
  • 1999
A novel algebra for reasoning about Spatial Congruence is introduced, it is shown that the satisfiability problem in the spatial algebra MC-4 is NP-complete, and a complete classification of tractability in the algebra is presented, based on the individuation of three maximal tractable subclasses, one containing the basic relations.
The Consistent Labeling Problem in Temporal Reasoning
The task of detecting inconsistency of the network and mapping the intervals onto a date line is a Consistent Labeling Problem (CLP), and the significance of identifying and analyzing the CLP in temporal reasoning is that CLPs have certain features which allow to apply certain techniques to the problem.
Synthesizing constraint expressions
An algorithm is developed that can achieve any level of consistency desired, in order to preprocess the problem for subsequent back track search, or to function as an alternative to backtrack search by explicitly determining all solutions.