Book chapter
Constraint Logic Programming over unions of Constraint theories
Principles and Practice of Constraint Programming — CP96, pp.436-450
Lecture Notes in Computer Science, Springer Berlin Heidelberg
06/01/2005
DOI: 10.1007/3-540-61551-2_92
Abstract
In this paper, we propose an extension of the Jaffar-Lassez Constraint Logic Programming scheme that operates with unions of constraint theories with different signatures and decides the satisfiability of mixed constraints by appropriately combining the constraint solvers of the component theories. We describe the extended scheme and provide logical and operational semantics for it along the lines of those given for the original scheme. Then we show how the main soundness and completeness results of Constraint Logic Programming lift to our extension.
Details
- Title: Subtitle
- Constraint Logic Programming over unions of Constraint theories
- Creators
- Cesare Tinelli - University of Illinois Urbana-ChampaignMehdi Harandi - University of Illinois Urbana-Champaign
- Resource Type
- Book chapter
- Publication Details
- Principles and Practice of Constraint Programming — CP96, pp.436-450
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/3-540-61551-2_92
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 06/01/2005
- Academic Unit
- Computer Science
- Record Identifier
- 9984259465702771
Metrics
6 Record Views