Solving over-constrained CSP using weighted OBDDs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1106, Issue , 1996, Pages 293-308

  Bouquet, Fabrice ^a   Jégou, Philippe ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION;

CLASSICAL TECHNIQUES; CONSISTENCY MAINTENANCE; DYNAMIC CONSTRAINTS; FINITE CONSTRAINTS; LOGICAL APPROACHES; OPTIMAL SOLUTIONS; ORDERED BINARY DECISION DIAGRAMS; OVER-CONSTRAINED SYSTEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 21344458901     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61479-6_30     Document Type: Conference Paper

References (17)

1. C. Bessière. Arc-consistency for dynamic constraint satisfaction problems. AAAI, Anaheim, USA, 1991.
2. G. Brewka. Prefered subtheories: An extended logical framwork for default reasoning. Proceedings of IJCAI 89, Detroit, USA, pages 1043-1048, 1989.
3. E. Bryant. Graph-based algorithhms for boolean function manipulation. IEEE Transactions on computers, C-35:677-691, 1986.
4. E. Bryant. Symbolic boolean manipulation with ordered bdd. ACM Computing Surveys, Vol 24 No. 3, September 1992.
5. C. Cayrol, M. C. Lagasquie-Schiex, and T. Schiex. Non-monotonic reasoning: from complexity to algorithms. 4-h International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, USA, 1996.
6. H. Cormen, C. Leiserson, and R. Rivest. Introduction to algorithms. MIT Press-McGraw-Hill, 1991.
7. M. Corsini and A. Rauzy. Toupie user’s manual. Technical report, LABRI, Universite de Bordeaux I, FVance, 1993.
8. O. Coudert and J. C. Madre. A logically complete reasonning maintenance system based on a logical constraint solver. IJCAI91, 1:294-299, 1991.
9. J. De Kleer. A comparaison of atms and csps techniques. In IJCAI89, volume Detroit, USA, pages 290-296, 1989.
10. R. Dechter and A. Dechter. Belief maintenance in dynamic constraint networks. In AAAI, volume Saint Paul, USA, pages 37-42, 1988.
11. P. Janssen, P. Jégou, B. Nougier, M. C. Vilarem, and B. Castro. Synthia: Assited design of peptide synthesis plans. New Journal of Chemistry, 14-12:969-976, 1990.
12. P. Jégou. Using Binary Decision Diagrams to solve Dynamic CSPs: Preliminary Report. In Constraint Satisfacton issues raised by practiced applications Workshop, editor, ECAI, 1994.
13. D. Lehmann. Another perspective on default reasoning. Technical report, Leibniz Center for Research in Computer Science. Hebrew University of Jerusalem. Israel, 1992.
14. U. Montanari. Networks of constaints: fundamental properties and applications to picture procesing. Information Sciences, 7:95-132, 1974.
15. A. Rauzy. Cedre version 0. 2: user’s guide. Technical report, LaBRI URA CNRS 1304, 1994.
16. T. Schiex and G. Verfaillie. Nogood recording for static and dynamic csps. In IEEE, editor, 5th IEEE International Conference on tools with Artificial Intelligence, 1993.
17. N. R. Vempaty. Solving constraint satisfaction problems using finite state automata. AAAI, San Jose, USA:453-458, 1992.