The management of imprecise information in logic programs becomes important whenever the real world information to be represented is of an imperfect nature and the classical crisp "true, false" approximation is not adequate. In this work, we consider normal logic programs over complete lattices, where computable truth combination functions may appear in the rule bodies to manipulate truth values and we will provide a top-down query answering procedure.
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
Straccia U
2009
Abstract
The management of imprecise information in logic programs becomes important whenever the real world information to be represented is of an imperfect nature and the classical crisp "true, false" approximation is not adequate. In this work, we consider normal logic programs over complete lattices, where computable truth combination functions may appear in the rule bodies to manipulate truth values and we will provide a top-down query answering procedure.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_44256-doc_54547.pdf
solo utenti autorizzati
Descrizione: Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
Tipologia:
Versione Editoriale (PDF)
Dimensione
824.63 kB
Formato
Adobe PDF
|
824.63 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
