We propose a new negation rule for logic programming which derives existentially closed negative literals, and we define a completion with respect to which this rule is sound and complete. The rule is called "Negation As Instantiation'. According to it, a negated atom succeeds whenever all the branches of the SLD-tree for the atom either fail or instantiate the atom.
Negation as Instantiation
Di Pierro, Alessandra
;
1995-01-01
Abstract
We propose a new negation rule for logic programming which derives existentially closed negative literals, and we define a completion with respect to which this rule is sound and complete. The rule is called "Negation As Instantiation'. According to it, a negated atom succeeds whenever all the branches of the SLD-tree for the atom either fail or instantiate the atom.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0890540185711133-main.pdf
accesso aperto
Tipologia:
Documento in Post-print
Licenza:
Copyright dell'editore
Dimensione
1.11 MB
Formato
Adobe PDF
|
1.11 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
