Home |
Personal Info |
Research |
Papers |
Teaching |
About |
The AND-Compositionality of CLP Computed Answer Constraints (AGP'96)
[Page last updated on "gennaio 13, 2005, 15:31:42".]Roberto Bagnara, Marco Comini, Francesca Scozzari, and Enea Zaffanella
Abstract
We present a semantic characterization of CLP languages for the class of quick-checking systems. We define a semantics of computed answer constraints which is AND-compositional, does not loose the distinction between active and passive constraints in the answers and has both a top-down and a bottom-up characterization. We also show that an incrementality property we impose on the constraint solver is essential in order to define an AND-compositional atom-based semantics.
Available: PDF, 300 DPI, 600 DPI, and 1200 DPI PostScript, DVI, and BibTeX entry.
enea.zaffanella@unipr.it
| Home | Personal Info | Research | Papers | Teaching | About