A Model-Theoretic View on Qualitative Constraint Reasoning

Qualitative reasoning formalisms are an active research topic in artificial intelligence. In this survey we present a model-theoretic perspective on qualitative constraint reasoning and explain some of the basic concepts and results in an accessible way. In particular, we discuss the significance of omega-categoricity for qualitative reasoning, of primitive positive interpretations for complexity analysis, and of Datalog as a unifying language for describing local consistency algorithms.

[1]  Luis Fariñas del Cerro,et al.  A Tractable Subclass of the Block Algebra: Constraint Propagation and Preconvex Relations , 1999, EPIA.

[2]  Robin Hirsch,et al.  Relation Algebras of Intervals , 1996, Artif. Intell..

[3]  Gérard Ligozat,et al.  Weak Composition for Qualitative Spatial and Temporal Reasoning , 2005, CP.

[4]  Peter Jonsson,et al.  The Complexity of Phylogeny Constraint Satisfaction , 2016, STACS.

[5]  Manuel Bodirsky,et al.  Qualitative Temporal and Spatial Reasoning Revisited , 2007, J. Log. Comput..

[6]  Michael Pinsker,et al.  Schaefer's Theorem for Graphs , 2015, J. ACM.

[7]  Martin Odersky,et al.  Negative Boolean Constraints , 1996, Theor. Comput. Sci..

[8]  Phokion G. Kolaitis,et al.  Conjunctive-query containment and constraint satisfaction , 1998, PODS.

[9]  Richard Kaye,et al.  Automorphisms of first-order structures , 1994 .

[10]  Manuel Bodirsky,et al.  Complexity Classification in Infinite-Domain Constraint Satisfaction , 2012, ArXiv.

[11]  P. Cameron,et al.  Oligomorphic permutation groups , 1990 .

[12]  Gérard Ligozat,et al.  What Is a Qualitative Calculus? A General Framework , 2004, PRICAI.

[13]  Peter Jeavons,et al.  Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..

[14]  Jeffrey D. Ullman,et al.  A survey of deductive database systems , 1995, J. Log. Program..

[15]  Eddie Schwalb,et al.  Temporal Constraints: A Survey , 1998, Constraints.

[16]  Sanjiang Li,et al.  On redundant topological constraints , 2014, Artif. Intell..

[17]  Max J. Egenhofer,et al.  Similarity of Cardinal Directions , 2001, SSTD.

[18]  Robin Hirsch,et al.  Expressive Power and Complexity in Algebraic Logic , 1997, J. Log. Comput..

[19]  Peter Jeavons,et al.  On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..

[20]  B. Larose,et al.  Bounded width problems and algebras , 2007 .

[21]  Johan de Kleer,et al.  Readings in qualitative reasoning about physical systems , 1990 .

[22]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[23]  Jaroslav Nesetril,et al.  Graphs and homomorphisms , 2004, Oxford lecture series in mathematics and its applications.

[24]  Martin C. Cooper,et al.  Binarisation via Dualisation for Valued Constraints , 2015, AAAI.

[25]  Libor Barto,et al.  The wonderland of reflections , 2015, Israel Journal of Mathematics.

[26]  Manuel Bodirsky,et al.  A fast algorithm and datalog inexpressibility for temporal reasoning , 2010, TOCL.

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

[28]  H. Keisler.  Reduced products and Horn classes , 1965 .

[29]  Phokion G. Kolaitis,et al.  On the expressive power of datalog: tools and a case study , 1990, J. Comput. Syst. Sci..

[30]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[31]  Philippe Dague,et al.  Qualitative Reasoning: A Survey of Techniques and Applications , 1995, AI Commun..

[32]  Luis Fariñas del Cerro,et al.  A Model for Reasoning about Bidemsional Temporal Relations , 1998, KR.

[33]  Dugald Macpherson,et al.  A survey of homogeneous structures , 2011, Discret. Math..

[34]  Manolis Koubarakis,et al.  Consistency of Chordal RCC-8 Networks , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[35]  D. Marker.  Model theory : an introduction , 2002 .

[36]  Manuel Bodirsky,et al.  Equivalence Constraint Satisfaction Problems , 2012, CSL.

[37]  R. Willard,et al.  Characterizations of several Maltsev conditions , 2015 .

[38]  Ulf Nilsson,et al.  Logic, programming and Prolog , 1990 .

[39]  Marc Gyssens,et al.  Closure properties of constraints , 1997, JACM.

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

[41]  Marcus Schaefer,et al.  Complexity of Some Geometric and Topological Problems , 2009, GD.

[42]  Peter Jeavons,et al.  Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra , 2003, JACM.

[43]  Eugene C. Freuder.  Complexity of K-Tree Structured Constraint Satisfaction Problems , 1990, AAAI.

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

[45]  Julien Hué,et al.  On the Scope of Qualitative Constraint Calculi , 2014, KI.

[46]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[47]  Peter Jonsson,et al.  Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic , 1998, J. Log. Comput..

[48]  Carsten Lutz,et al.  A Tableau Algorithm for Description Logics with Concrete Domains and General TBoxes , 2007, Journal of Automated Reasoning.

[49]  Bernhard Nebel,et al.  Qualitative Spatial Reasoning Using Constraint Calculi , 2007, Handbook of Spatial Logics.

[50]  Manuel Bodirsky,et al.  Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction , 2016, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[51]  Manuel Bodirsky.  Cores of Countably Categorical Structures , 2007, Log. Methods Comput. Sci..

[52]  Michael Kompatscher,et al.  On the Update Operation in Skew Lattices , 2018, FLAP.

[53]  Anuj Dawar,et al.  Affine Systems of Equations and Counting Infinitary Logic , 2007, ICALP.

[54]  Manuel Bodirsky,et al.  Tractable Set Constraints , 2011, IJCAI.

[55]  Manuel Bodirsky,et al.  Datalog and constraint satisfaction with infinite templates , 2006, J. Comput. Syst. Sci..

[56]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2010, JACM.

[57]  Bernhard Nebel,et al.  Efficient Methods for Qualitative Spatial Reasoning , 2001, J. Artif. Intell. Res..

[58]  Andrei A. Bulatov,et al.  A dichotomy theorem for constraint satisfaction problems on a 3-element set , 2006, JACM.

[59]  Ivo Düntsch,et al.  A relation - algebraic approach to the region connection calculus , 2001, Theor. Comput. Sci..

[60]  Manuel Bodirsky,et al.  Non-dichotomies in Constraint Satisfaction Complexity , 2008, ICALP.

[61]  Pawel M. Idziak,et al.  Tractability and learnability arising from algebras with few subpowers , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[62]  Barnaby Martin,et al.  On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[63]  Manuel Bodirsky.  Constraint Satisfaction Problems with Infinite Templates , 2008, Complexity of Constraints.

[64]  Phokion G. Kolaitis,et al.  Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics , 2002, CP.

[65]  Ivo Düntsch,et al.  Relation Algebras and their Application in Temporal and Spatial Reasoning , 2005, Artificial Intelligence Review.

[66]  Gérard Ligozat,et al.  Reasoning about Cardinal Directions , 1998, J. Vis. Lang. Comput..

[67]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[68]  Letizia Tanca,et al.  What you Always Wanted to Know About Datalog (And Never Dared to Ask) , 1989, IEEE Trans. Knowl. Data Eng..

[69]  Tomás Feder,et al.  The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..

[70]  Peter Jeavons,et al.  Building tractable disjunctive constraints , 2000, J. ACM.

[71]  Krzysztof R. Apt,et al.  Infinite Qualitative Simulations by Means of Constraint Programming , 2006, CP.

[72]  Ivo Düntsch,et al.  Relations Algebras in Qualitative Spatial Reasoning , 1999, Fundam. Informaticae.

[73]  Roman Barták,et al.  Constraint Processing , 2009, Encyclopedia of Artificial Intelligence.

[74]  Jean-François Condotta,et al.  Efficient Approach to Solve the Minimal Labeling Problem of Temporal and Spatial Qualitative Constraints , 2013, IJCAI.

[75]  Jinbo Huang.  Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning , 2012, KR.

[76]  Libor Barto,et al.  Constraint Satisfaction Problems Solvable by Local Consistency Methods , 2014, JACM.

[77]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[78]  Matthias Westphal,et al.  Qualitative constraint-based reasoning: methods and applications , 2015 .

[79]  Jaroslav Nesetril,et al.  Constraint Satisfaction with Countable Homogeneous Templates , 2003, J. Log. Comput..

[80]  Shan Shan Huang,et al.  Datalog and emerging applications: an interactive tutorial , 2011, SIGMOD '11.

[81]  Jochen Renz.  Implicit Constraints for Qualitative Spatial and Temporal Reasoning , 2012, KR.

[82]  Y. Gurevich.  On Finite Model Theory , 1990 .

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

[84]  Georg Cantor.  Über unendliche, lineare Punktmannigfaltigkeiten , 1984 .