A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Tree clustering for constraint networks (research note)
Artificial Intelligence
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
A canonical form for generalized linear constraints
Journal of Symbolic Computation
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Constraint logic programming
Fast parallel constraint satisfaction
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Characterising tractable constraints
Artificial Intelligence
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Handling infinite temporal data
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tractable constraints on ordered domains
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
Constraints, consistency and closure
Artificial Intelligence
A unifying approach to temporal constraint reasoning
Artificial Intelligence
An access control model supporting periodicity constraints and temporal reasoning
ACM Transactions on Database Systems (TODS)
Modern computer algebra
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Engineering Dynamic Scheduler for Work Manager
BT Technology Journal
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
A Unifying Framework for Tractable Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
From Local to Global Consistency in Temporal Constraint Networks
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Solving multi-granularity temporal constraint networks
Artificial Intelligence
Disjunctions, independence, refinements
Artificial Intelligence
The Point Algebra for Branching Time Revisited
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
A method for metric temporal reasoning
Eighteenth national conference on Artificial intelligence
New tractable constraint classes from old
Exploring artificial intelligence in the new millennium
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
New Tractable Classes From Old
Constraints
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Domain permutation reduction for constraint satisfaction problems
Artificial Intelligence
The complexity of temporal constraint satisfaction problems
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
On the Computational Complexity of Monotone Constraint Satisfaction Problems
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Semilinear Program Feasibility
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
Theory and Practice of Logic Programming
Amalgams of constraint satisfaction problems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Making bound consistency as effective as arc consistency
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
The complexity of temporal constraint satisfaction problems
Journal of the ACM (JACM)
Proceedings of the forty-third annual ACM symposium on Theory of computing
The order encoding: from tractable CSP to tractable SAT
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Discrete-time temporal reasoning with horn DLRs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Computational complexity of linear constraints over the integers
Artificial Intelligence
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Many combinatorial search problems can be expressed as 'constraint satisfaction problems'. This class of problems is known to be NP-hard in general, but a number of restricted constraint classes have been identified which ensure tractability. This paper presents the first general results on combining tractable constraint classes to obtain larger, more general, tractable classes. We give examples to show that many known examples of tractable constraint classes, from a wide variety of different contexts, can be constructed from simpler tractable classes using a general method. We also construct several new tractable classes that have not previously been identified.