On the basis of the model-theoretic completeness of a bi-modal system L for Prolog propositional programs with negation by failure the author extends D. Gabbay's idea on modal completion to prove the completeness of SLDNF-resolution within the system L. (The system L extends the known modal system G for arithmetical probability.)
Modal interpretation for negation by failure
TERRACINI, Lea
1988-01-01
Abstract
On the basis of the model-theoretic completeness of a bi-modal system L for Prolog propositional programs with negation by failure the author extends D. Gabbay's idea on modal completion to prove the completeness of SLDNF-resolution within the system L. (The system L extends the known modal system G for arithmetical probability.)
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.
