Readings in nonmonotonic reasoning
Readings in nonmonotonic reasoning
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
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
Handbook of theoretical computer science (vol. A)
From local to global consistency
Artificial Intelligence
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
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
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)
The complexity of constraint satisfaction revisited
Artificial intelligence in perspective
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Closure properties of constraints
Journal of the ACM (JACM)
Constraint tightness and looseness versus local and global consistency
Journal of the ACM (JACM)
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Catching the boat with Strudel: experiences with a Web-site management system
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Rewriting of regular expressions and regular path queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
View-based query processing for regular path queries with inverse
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Synthesizing constraint expressions
Communications of the ACM
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Obtaining Complete Answers from Incomplete Databases
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A Unifying Framework for Tractable Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
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
Answering Regular Path Queries Using Views
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Algorithms and heuristics for constraint satisfaction problems
Algorithms and heuristics for constraint satisfaction problems
Theory of Relational Databases
Theory of Relational Databases
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM SIGMOD Record
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Pure Nash equilibria: hard and easy games
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Journal of Computer and System Sciences - Special issu on PODS 2001
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query answering exploiting structural properties
ACM SIGMOD Record
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Efficient Handling of Relational Database Combinatorial Queries Using CSPs
IEA/AIE '08 Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
On the complexity of constrained Nash equilibria in graphical games
Theoretical Computer Science
Pure Nash equilibria: hard and easy games
Journal of Artificial Intelligence Research
Congruence Distributivity Implies Bounded Width
SIAM Journal on Computing
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
| Hi-index | 0.00 |
A large class of problems in AI and other areas of computer science can be viewed as constraint-satisfaction problems. This includes problems in machine vision, belief maintenance, scheduling, temporal reasoning, type reconstruction, graph theory, and satisfiability. In general, the constraint satisfaction-problem is NP-complete, so searching for tractable cases is an active research area. It turns out that constraint satisfaction has an intimate connection with database theory: constraint-satisfaction problems can be recast as database problems and database problems can be recast as constraint-satisfaction problems. In this tutorial, I will cover the fundamentals of constraints satisfaction and describe its intimate relationship with database theory from various perspectives.