We propose a parametric introduction of intensionally defined sets into any CLP(D) language. The result is a language CLP({D}), where constraints over sets of elements of D and over sets of sets of elements, and so on, can be expressed. The semantics of CLP({D}) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in CLP({D}) and propose algorithms for constraints simplification.

Intensional Sets in CLP

DOVIER, Agostino;
2003

Abstract

We propose a parametric introduction of intensionally defined sets into any CLP(D) language. The result is a language CLP({D}), where constraints over sets of elements of D and over sets of sets of elements, and so on, can be expressed. The semantics of CLP({D}) is based on the semantics of logic programs with aggregates and the semantics of CLP over sets. We investigate the problem of constraint resolution in CLP({D}) and propose algorithms for constraints simplification.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11390/677560
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 12
  • ???jsp.display-item.citation.isi??? 9
social impact