Home |
Personal Info |
Papers |
Teaching |
Links |
The AND-Compositionality of CLP Computed Answer Constraints
Roberto Bagnara
Dipartimento di Informatica
Università di Pisa
Corso Italia 40
I-56125 Pisa
Italy
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, BibTeX entry.
[Page last updated on December 10, 1999, 11:30:49.]
bagnara@cs.unipr.it
Home | Personal | Papers | Teaching | Links