The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
An optimal k-consistency algorithm
Artificial Intelligence
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Graph minors. IV. Tree-width and well-quasi-ordering
Journal of Combinatorial Theory Series B
Subtree-elimination algorithms in deductive databases
Subtree-elimination algorithms in deductive databases
From local to global consistency
Artificial Intelligence
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
On the inherent level of local consistency in constraint networks
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Proceedings of the 30th IEEE symposium on Foundations of computer science
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Finite model theory and finite variable logics
Finite model theory and finite variable logics
Constraint tightness and looseness versus local and global consistency
Journal of the ACM (JACM)
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Bucket elimination: a unifying framework for reasoning
Artificial Intelligence
Synthesizing constraint expressions
Communications of the ACM
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
A Game-Theoretic Approach to Constraint Satisfaction
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
On the expressive power of variable-confined logics
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraint Processing
Algorithms and heuristics for constraint satisfaction problems
Algorithms and heuristics for constraint satisfaction problems
The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
On Digraph Coloring Problems and Treewidth Duality
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Generalized Majority-Minority Operations are Tractable
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Existential Positive Types and Preservation under Homomorphisisms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
A Characterisation of First-Order Constraint Satisfaction Problems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Principles of Constraint Programming
Principles of Constraint Programming
Algorithms for acyclic database schemes
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Constraints, Graphs, Algebra, Logic, and Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Constraints, graphs, algebra, logic, and complexity
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Semantic acyclicity on graph databases
Proceedings of the 32nd symposium on Principles of database systems
| Hi-index | 0.00 |
Since the early 1970s, researchers in artificial intelligence (AI) have investigated a class of combinatorial problems that became known as constraint-satisfaction problems (CSP). The input to such a problem consists of a set of variables, a set of possible values for the variables, and a set of constraints between the variables; the question is to determine whether there is an assignment of values to the variables that satisfies the given constraints. The study of constraint satisfaction occupies a prominent place in artificial intelligence, because many problems that arise in different areas can be modelled as constraint-satisfaction problems in a natural way; these areas include Boolean satisfiability, temporal reasoning, belief maintenance, machine vision, and scheduling (cf. [Dec92a,Kum92,Mes89, Tsa93]). In its full generality, constraint satisfaction is an NP-complete problem. For this reason, researchers in artificial intelligence have pursued both heuristics for constraint-satisfaction problems and tractable cases obtained by imposing various restrictions on the input (cf. [MF93,Dec92a,DM94,Fro97,PJ97]).