Tractable Set Constraints

Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set constraint satisfaction problems (set CSPs). Such problems are frequently intractable, but there are several important set CSPs that are known to be polynomial-time tractable. We introduce a large class of set CSPs that can be solved in quadratic time. Our class, which we call EI, contains all previously known tractable set CSPs, but also some new ones that are of crucial importance for example in description logics. The class of EI set constraints has an elegant universal-algebraic characterization, which we use to show that every set constraint language that properly contains all EI set constraints already has a finite sublanguage with an NP-hard constraint satisfaction problem.

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

[2]  Manolis Koubarakis,et al.  Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning , 2001, Theor. Comput. Sci..

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

[4]  Manuel Bodirsky,et al.  The Complexity of Equality Constraint Languages , 2006, CSR.

[5]  Viktor Kuncak,et al.  Deciding Boolean Algebra with Presburger Arithmetic , 2006, Journal of Automated Reasoning.

[6]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[7]  Franz Baader.  Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles , 2003, IJCAI.

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

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

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

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

[12]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[13]  Jean-Louis Lassez,et al.  Independence of Negative Constraints , 1989, TAPSOFT, Vol.1.

[14]  Manuel Bodirsky,et al.  The complexity of temporal constraint satisfaction problems , 2008, STOC.

[15]  Sebastian Rudolph,et al.  On the Complexity of Horn Description Logics , 2006, OWLED.

[16]  Manuel Bodirsky,et al.  Determining the consistency of partial tree descriptions , 2007, Artif. Intell..

[17]  Libor Barto,et al.  Constraint Satisfaction Problems of Bounded Width , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Ágnes Szendrei,et al.  Clones in universal algebra , 1986 .

[19]  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.

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

[21]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[22]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[23]  Michael Pinsker,et al.  The reducts of equality up to primitive positive interdefinability , 2010, J. Symb. Log..

[24]  George Boole,et al.  An Investigation of the Laws of Thought: Frontmatter , 2009 .

[25]  Peter Jonsson,et al.  Disjunctions, independence, refinements , 2002, Artif. Intell..

[26]  Christer Bäckström,et al.  A Unifying Approach to Temporal Constraint Reasoning , 1998, Artif. Intell..

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

[28]  Andrei A. Bulatov,et al.  A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..

[29]  Andrei A. Bulatov,et al.  Tractable conservative constraint satisfaction problems , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[30]  Ralf Küsters,et al.  Approximating most specific concepts in description logics with existential restrictions , 2002, AI Commun..

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

[32]  Viktor Kuncak,et al.  Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic , 2007, CADE.

[33]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[34]  Alexander Aiken,et al.  Set Constraints: Results, Applications, and Future Directions , 1994, PPCP.

[35]  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).

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

[37]  Barnaby Martin,et al.  On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction , 2010, LICS.