Embedding extensional finite sets in CLP

@inproceedings{Dovier1993EmbeddingEF,
  title={Embedding extensional finite sets in CLP},
  author={Agostino Dovier and Gianfranco Rossi},
  booktitle={ILPS},
  year={1993}
}
In this paper we review the definition of {log}1, a logic language with sets, from the viewpoint of CLP. We show that starting with a CLP-scheme allows a more uniform treatment of the built-in set operations (namely, =, ∈ and their negative counterparts), and allows all the theoretical results of CLP to be immediately exploitable. We prove this by precisely defining the privileged interpretation domain and the axioms of the selected set theory. Then we define a non-deterministic procedure for… CONTINUE READING

From This Paper

Topics from this paper.
27 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

CLPS: A Set Constraint Logic Programming Language

  • B. Legeard, E. Legros
  • Research Report, Laboratoire d’automatique de…
  • 1991
Highly Influential
5 Excerpts

insiemi/multiinsiemi/iperinsiemi incorporare nella programmazione logica? (in Italian)

  • E. G. Omodeo, A. Policriti, G. Rossi. Che genere di
  • In Proc. GULP’93 - 8th Italian Conf. on Logic…
  • 1993
1 Excerpt

A WAMbased implementation of a Logic Language with Sets

  • A. Dovier, E. Pontelli
  • 1992
1 Excerpt

Desiderata for Logic Programming with sets

  • R. Sigal.
  • 1992

Similar Papers

Loading similar papers…