The Complexity of Reasoning about Spatial Congruence

In the recent literature of Artificial Intelligence, an intensive research effort has been spent, for various algebras of qualitative relations used in the representation of temporal and spatial knowledge, on the problem of classifying the computational complexity of reasoning problems for subsets of algebras. The main purpose of these researches is to describe a restricted set of maximal tractable subalgebras, ideally in an exhaustive fashion with respect to the hosting algebras. In this paper we introduce a novel algebra for reasoning about Spatial Congruence, show that the satisfiability problem in the spatial algebra MC-4 is NP-complete, and present a complete classification of tractability in the algebra, based on the individuation of three maximal tractable subclasses, one containing the basic relations. The three algebras are formed by 14, 10 and 9 relations out of 16 which form the full algebra.

[1]  Nicola Guarino,et al.  An Ontological Theory of Physical Objects , 2001 .

[2]  M. Egenhofer,et al.  Point-Set Topological Spatial Relations , 2001 .

[3]  Bowman L. Clarke,et al.  A calculus of individuals based on "connection" , 1981, Notre Dame J. Formal Log..

[4]  Anthony G. Cohn,et al.  A Spatial Logic based on Regions and Connection , 1992, KR.

[5]  Max J. Egenhofer,et al.  Topological spatial relations based on components and dimensions of set intersections , 1993, Other Conferences.

[6]  Christer Bäckström,et al.  Computational Complexity of Relating Time Points with Intervals , 1999, Artif. Intell..

[7]  Nicholas Mark Gotts,et al.  How Far Can We 'C'? Defining a 'Doughnut' Using Connection Alone , 1994, KR.

[8]  Frank D. Anger,et al.  Satisfiability in Nonlinear Time: Algorithms and Complexity , 1999, FLAIRS.

[9]  Bernhard Nebel,et al.  Computational Properties of Qualitative Spatial Reasoning: First Results , 1995, KI.

[10]  Peter Jonsson,et al.  Twenty-One Large Tractable Subclasses of Allen's Algebra , 1997, Artif. Intell..

[11]  Brandon Bennett,et al.  Spatial Reasoning with Propositional Logics , 1994, KR.

[12]  Kai Zimmermann,et al.  Measuring without Measures: The Delta-Calculus , 1995, COSIT.

[13]  Thomas Drakengren.  A Complete Classiication of Tractability in the Spatial Theory Rcc-5 , 1997 .

[14]  Peter Jonsson,et al.  A Complete Classification of Tractability in RCC-5 , 1997, J. Artif. Intell. Res..

[15]  Anthony G. Cohn,et al.  Modelling Topological and Metrical Properties in Physical Processes , 1989, KR.

[16]  B. Bennett.  Carving Up Space: Existential Axioms for a Formal Theory of Spatial Regions , 1995 .

[17]  Bernhard Nebel,et al.  On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus , 1999, Artif. Intell..

[18]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[19]  Jochen Renz,et al.  Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis , 1999, IJCAI.

[20]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[21]  Dimitris Papadias,et al.  Topological Inference , 1995, IJCAI.

[22]  A. Cohn,et al.  A connection based approach to common-sense topological description and reasoning , 1996 .

[23]  Eugene C. Freuder,et al.  The Complexity of Some Polynomial Network Consistency Algorithms for Constraint Satisfaction Problems , 1985, Artif. Intell..

[24]  Zhan Cui,et al.  Using Interval Logic for Order Assembly , 1994, ISMB.

[25]  Max J. Egenhofer,et al.  Reasoning about Binary Topological Relations , 1991, SSD.

[26]  Peter B. Ladkin,et al.  On binary constraint problems , 1994, JACM.

[27]  Nicola Guarino,et al.  A Pointless Theory of Space Based on Strong Connection and Congruence , 1996, KR.

[28]  Richard Statman,et al.  Intuitionistic Propositional Logic is Polynomial-Space Complete , 1979, Theor. Comput. Sci..

[29]  Oliver Lemon,et al.  Semantical Foundations of Spatial Logics , 1996, KR.