We present a simple, yet general top-down query answering procedure for many-valued logic programming, which allow to deal with imprecision and some forms of uncertainty. The main features of the logic are: ii{i} the truth values are taken from a complete lattice; ii{ii} computable functions may appear in the rule bodies to manipulate truth values. To answer queries, we provide a novel and simple tabling-like top-down procedure.
A Simple Top-Down Query Answering Procedure for Many-Valued Logic Programming
Straccia U
2006
Abstract
We present a simple, yet general top-down query answering procedure for many-valued logic programming, which allow to deal with imprecision and some forms of uncertainty. The main features of the logic are: ii{i} the truth values are taken from a complete lattice; ii{ii} computable functions may appear in the rule bodies to manipulate truth values. To answer queries, we provide a novel and simple tabling-like top-down procedure.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_160393-doc_128031.pdf
accesso aperto
Descrizione: A Simple Top-Down Query Answering Procedure for Many-Valued Logic Programming
Dimensione
299.83 kB
Formato
Adobe PDF
|
299.83 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
