NP is as easy as detecting unique solutions
Theoretical Computer Science
Principles of artificial intelligence
Principles of artificial intelligence
Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Handbook of theoretical computer science (vol. A)
Artificial Intelligence
The OPL optimization programming language
The OPL optimization programming language
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Backtrack Searching in the Presence of Symmetry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Using Auxiliary Variables and Implied Constraints to Model Non-Binary Problems
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Dynamic Variable Ordering in CSPs
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
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
Compiling problem specification into SAT
Artificial Intelligence - Special volume on reformulation
Automated reformulation of specifications by safe delay of constraints
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
USING A THEOREM PROVER FOR REASONING ON CONSTRAINT PROBLEMS
Applied Artificial Intelligence
Abstraction via approximate symmetry
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Eliminating interchangeable values in constraint satisfaction problems
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Detecting and breaking symmetries by reasoning on problem specifications
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
A unifying framework for structural properties of CSPs: definitions, complexity, tractabilit
Journal of Artificial Intelligence Research
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
In this paper we tackle the issue of the automatic recognition of functional dependencies among guessed predicates in constraint problem specifications. Functional dependencies arise frequently in pure declarative specifications, because of the intermediate results that need to be computed in order to express some of the constraints, or due to precise modeling choices, e.g., to provide multiple viewpoints of the search space in order to increase constraint propagation. In either way, the recognition of dependencies greatly helps solvers, allowing them to avoid spending search on unfruitful branches, while maintaining the highest degree of declarativeness. By modeling constraint problem specifications as second-order formulae, we provide a characterization of functional dependencies in terms of semantic properties of first-order ones, and prove undecidability of the problem of their recognition. Despite such negative result, we advocate the (in many cases effective) possibility of using automated tools to mechanize this task. Additionally, we show how suitable search procedures can be automatically synthesized in order to exploit recognized dependencies. We present opl examples of various problems, taken from bio-informatics, planning and resource allocation, and show how in many cases opl greatly benefits from the addition of such search procedures. Moreover, we also give evidence that writing sophisticated ad-hoc search procedures that handle dependencies exploiting the peculiarities of the particular problem is a very difficult and error-prone task which in many cases does not seem to pay-off.