Theoretical Computer Science
A unifying approach to temporal constraint reasoning
Artificial Intelligence
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
Theoretical Computer Science
Disjunctions, independence, refinements
Artificial Intelligence
Approximating most specific concepts in description logics with existential restrictions
AI Communications - Special issue on KI-2001
Set Constraints: Results, Applications, and Future Directions
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Independence of Negative Constraints
TAPSOFT '89/CAAP '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 1: Advanced Seminar on Foundations of Innovative Software Development I and Colloquium on Trees in Algebra and Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
An Investigation of the Laws of Thought
An Investigation of the Laws of Thought
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
Deciding Boolean Algebra with Presburger Arithmetic
Journal of Automated Reasoning
Determining the consistency of partial tree descriptions
Artificial Intelligence
The Complexity of Equality Constraint Languages
Theory of Computing Systems
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Constraint Satisfaction Problems of Bounded Width
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Tractability and Learnability Arising from Algebras with Few Subpowers
SIAM Journal on Computing
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
| Hi-index | 0.00 |
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.