Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Extended Horn sets in propositional logic
Journal of the ACM (JACM)
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Tractable constraints on ordered domains
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Constraints, consistency and closure
Artificial Intelligence
Constraint satisfaction over connected row-convex constraints
Artificial Intelligence
Renaming a Set of Clauses as a Horn Set
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Maximum renamable Horn sub-CNFs
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Building tractable disjunctive constraints
Journal of the ACM (JACM)
A comparison of structural CSP decomposition methods
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Algebraic Characterization of Tractable Constraints
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Constraint Programming Approach to the Stable Marriage Problem
CP '01 Proceedings of the 7th 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
Implementing a Test for Tractability
Constraints
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Journal of Artificial Intelligence Research
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
Perfect Constraints Are Tractable
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Making bound consistency as effective as arc consistency
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This paper is concerned with the Constraint Satisfaction Problem (CSP). It is well-known that the general CSP is NP-hard. However, there has been significant success in discovering subproblems which are tractable (polynomial time solvable). One of the most effective ways to obtain a tractable subproblem has been to force all of the constraint relations to lie in some tractable language. In this paper we define a new way of identifying tractable subproblems of the CSP. Let P be an arbitrary CSP instance and @C be any tractable language. Suppose there exists, for each variable of P, a permutation of the domain such the resultant permuted constraint relations of P all lie in @C. The domain permuted instance is then an instance of a tractable class and can be solved by the polynomial time algorithm for @C. Solutions to P can be obtained by inverting the domain permutations. The question, for a given class of instances and language @C, whether such a set of domain permutations can be found efficiently is the key to this method's tractability. One of the important contributions made in this paper is the notion of a ''lifted constraint instance'' which is a powerful tool to study this question. *We consider the open problem of discovering domain permutations which make instances max-closed. We show that, for bounded arity instances over a Boolean domain this problem is tractable, while for domain size three it is intractable even for binary instances. *We give a simple proof verifying the tractability of discovering domain permutations which make instances row convex. We refute a published result by giving a simple proof of the intractability of discovering domain permutations which make instances, even with domain size four, connected row convex. *We demonstrate that triangulated and stable marriage instances are reducible, via domain permutations, to max-closed instances. This provides a simple explanation for arc consistency deciding these instances. *We verify with a simple direct proof the tractability of identification of renamable Horn instances, and the intractability of finding the largest renamable Horn subset of clauses of an instance of SAT. *We describe natural tractable classes which properly extend the maximal relational classes arising from tractable constraint languages. We believe that domain permutation reductions have a significant chance of being useful in practical applications.