@proceedings {BagnaraCSZ96,
	title = {The AND-compositionality of CLP Computed Answer Constraints},
	journal = {Proceedings APPIA-GULP-PRODE{\textquoteright}96 Joint Conference on Declarative Programming},
	year = {1996},
	pages = {355{\textendash}366},
	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.},
	author = {Roberto Bagnara and Marco Comini and Francesca Scozzari and Enea Zaffanella},
	editor = {Navarro, M.}
}
