The complexity of promise problems with applications to public-key cryptography
Information and Control
NP is as easy as detecting unique solutions
Theoretical Computer Science
Handbook of theoretical computer science (vol. A)
The graph isomorphism problem: its structural complexity
The graph isomorphism problem: its structural complexity
On the computation of local interchangeability in discrete constraint satisfaction problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Act, and the rest will follow: exploiting determinism in planning as satisfiability
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Synthesizing constraint expressions
Communications of the ACM
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Managing Don't Cares in Boolean Satisfiability
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Exploiting functional dependencies in declarative problem specifications
Artificial Intelligence
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS
Applied Artificial Intelligence
Generalizing consistency and other constraint properties to quantified constraints
ACM Transactions on Computational Logic (TOCL)
Neighborhood interchangeability and dynamic bundling for non-binary finite CSPs
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
QCSP-solve: a solver for quantified constraint satisfaction problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Many-to-many interchangeable sets of values in CSPs
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Eliminating redundancy in CSPs through merging and subsumption of domain values
ACM SIGAPP Applied Computing Review
Hi-index | 0.00 |
Literature on Constraint Satisfaction exhibits the definition of several "structural" properties that can be possessed by CSPs, like (in)consistency, substitutability or interchangeability. Current tools for constraint solving typically detect such properties efficiently by means of incomplete yet effective algorithms, and use them to reduce the search space and boost search. In this paper, we provide a unifying framework encompassing most of the properties known so far, both in CSP and other fields' literature, and shed light on the semantical relationships among them. This gives a unified and comprehensive view of the topic, allows new, unknown, properties to emerge, and clarifies the computational complexity of the various detection problems. In particular, among the others, two new concepts, fixability and removability emerge, that come out to be the ideal characterisations of values that may be safely assigned or removed from a variable's domain, while preserving problem satisfiability. These two notions subsume a large number of known properties, including inconsistency, substitutability and others. Because of the computational intractability of all the property-detection problems, by following the CSP approach we then determine a number of relaxations which provide sufficient conditions for their tractability. In particular, we exploit forms of language restrictions and local reasoning.