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
A comparison of structural CSP decomposition methods
Artificial Intelligence
Theoretical Computer Science
A Fixpoint Definition of Dynamic Constraint Satisfaction
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Constraint Processing
Journal of Artificial Intelligence Research
Propagating logical combinations of constraints
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Dynamic constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Tackling the partner units configuration problem
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Proceedings of the 27th IEEE/ACM International Conference on Automated Software Engineering
Constraint-Based refactoring with foresight
ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
Modeling and solving technical product configuration problems
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Hi-index | 0.00 |
Conditional Constraint Satisfaction Problems (CCSPs) are generalizations of classical CSPs that support conditional activation of variables and constraints. Despite the interest emerged for CCSPs in the context of modelling the intrinsic dynamism of diagnosis, structural design, and product configuration applications, a complete characterization of their computational properties and of their expressiveness is still missing. In fact, the aim of the paper is precisely to face these open research issues. First, CCSPs are formally characterized in terms of a suitable fragment of first-order logic. Second, the complexity of some basic reasoning tasks for CCSPs is studied, by establishing completeness results for the first and the second level of the polynomial hierarchy. Finally, motivated by the hardness results, an island of tractability for CCSPs is identified, by extending structural decomposition methods originally proposed for CSPs.