A fixpoint definition of dynamic constraint satisfaction

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

Volumn 1713, Issue , 1999, Pages 419-434

  Soininen, Timo ^a   Gelle, Esther ^b   Niemelä, Ilkka ^a  

^a AALTO UNIVERSITY   (Finland)

^b ABB CORPORATE RESEARCH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; KNOWLEDGE REPRESENTATION;

COMBINATORIAL PROBLEM; DYNAMIC CONSTRAINT SATISFACTIONS; FIXPOINT DEFINITIONS; FIXPOINTS; MINIMALITY; NP COMPLETE; PRODUCT CONFIGURATION; PROOF OF CONCEPT;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84957360996     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_30     Document Type: Conference Paper

References (14)

1. T. Eiter and G. Gottlob. Complexity aspects of various semantics for disjunctive databases. In Proc. of the 12th Symposium on Principles of Database Systems, pages 158–167, 1993.
2. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. of the 5th Intern. Conf. on Logic Programming, pages 1070–1080, 1988.
3. E. M. Gelle. On the generation of locally consistent solution spaces. Ph.D. Thesis, Ecole Polytechnique Fédérale de Lausanne, Switzerland, 1998.
4. J. Lloyd. Foundations of Logic Programming. Springer-Verlag, 2nd edition, 1987.
5. S. Mittal and B. Falkenhainer. Dynamic constraint satisfaction problems. In Proc. of the 8th National Conf. on Artificial Intelligence, pages 25–32, 1990.
6. I. Niemelä and P. Simons. Smodels – an implementation of the stable model and well-founded semantics for normal logic programs. In Proc. of the 4th International Conf. on Logic Programming and Non-Monotonic Reasoning, pages 420–429, 1997.
7. D. Sabin and E. C. Freuder. Configuration as composite constraint satisfaction. In Configuration – Papers from the 1996 Fall Symposium. AAAI Technical Report FS-96-03, 1996.
8. D. Sabin and R. Weigel: Product configuration frameworks – a survey. IEEE Intelligent Systems & Their Applications, pages 42–49, July/August 1998.
9. T. Soininen and E. M. Gelle. Dynamic constraint satisfaction in configuration. In AAAI’99 Workshop on Configuration. To appear as AAAI Technical Report, 1999.
10. T. Soininen and I. Niemelä. Developing a declarative rule language for applications in product configuration. In Practical Aspects of Declarative Languages (PADL99), LNCS 1551. Springer-Verlag, 1999.
11. T. Soininen, J. Tiihonen, T. Männistö, and R. Sulonen. Towards a general ontology of configuration. AI EDAM, 12:357–372, 1998.
12. M. Stumptner, G. Friedrich, and A. Haselböck. Generative constraint-based configuration of large technical systems. AI EDAM, 12:307–320, 1998.
13. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London, 1993.
14. M. van Velzen. A Piece of CAKE, Computer Aided Knowledge Engineering on KADSified Configuration Tasks. Master’s thesis, University of Amsterdam, Social Science Informatics, 1993.