Conditional constraint satisfaction: Logical foundations and complexity

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 88-93

  Gottlob, Georg ^a   Greco, Gianluigi ^b   Mancini, Toni ^c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALABRIA   (Italy)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL PROPERTIES; CONDITIONAL CONSTRAINT SATISFACTION PROBLEM; CONDITIONAL CONSTRAINTS; FIRST ORDER LOGIC; LOGICAL FOUNDATIONS; POLYNOMIAL HIERARCHIES; PRODUCT CONFIGURATION; STRUCTURAL DECOMPOSITION METHODS;

ARTIFICIAL INTELLIGENCE; STRUCTURAL DESIGN;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84880909742     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Bowen and D. Bahler. Conditional existence of variables in generalised constraint networks. In Proc. of AAAI'91, pages 215-220, 1991.
2. F. Bacchus and T. Walsh. Propagating Logical Combinations of Constraints. In Proc. of IJCAI' 05, pages 35-40, 1995.
3. R. Dechter. Constraint Processing. Morgan Kaufmann, Los Altos, 2003.
4. E. Gelle and B. Faltings. Solving mixed and conditional constraint satisfaction problems. Constraints, 8(2):107-141, 2003.
5. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural csp decomposition methods. Artif. Intell., 124(2):243-282, 2000. (Pubitemid 32029459)
6. G. Gottlob, N. Leone, and F. Scarcello. Computing logcfl certificates. TCS, 270(1-2):761-777, 2002. (Pubitemid 33142253)
7. J. Keppens and Q. Shen. Compositional model repositories via dynamic constraint satisfaction with order-of-magnitude preferences. JAIR, 21:499-550, 2004. (Pubitemid 41525909)
8. P. G. Kolaitis and M. Y. Vardi. Conjunctive-query containment and constraint satisfaction. JCSS, 61(2):302-332, 1998.
9. S. Mittal and B. Falkenhainer. Dynamic Constraint Satisfaction Problems. In Proc. of AAAI'90, pages 25-32, 2000.
10. J.K. Pearson and P.G. Jeavons. A survey of tractable constraint satisfaction problems. CSD-TR-97-15, Royal Holloway, University of London, July 1997.
11. N. Robertson and P. D. Seymour. Graph minors. II. algorithmic aspects of treewidth. J. of Algorithms, 7(3):309-322, 1986.
12. M. Sabin, E. C. Freuder, and R. J. Wallace. Greater efficiency for conditional constraint satisfaction. In Proc. of CP 2003, pages 649-663, 2003.
13. G. Soininen, T. Esther, and I. Niemelä. A fixpoint definition of Dynamic Constraint Satisfaction. In Proc. of CP' 99, pages 419-433, 1999.
14. G. Verfaillie and N. Jussien. Constraint solving in uncertain and dynamic environments: A survey. Constraints, 10:253-281, 2005. (Pubitemid 41118933)