In this work we generalize the semantics for negation in logic programs, putting together the constructive nature of the rule-based deductive database with the syntax-independence of the closed-world reasoning rules. These generalized semantics are shown to be a well-motivated and well-founded alternative to closed-world assumptions since they enjoy nice semantic and computational properties.
Negation and minimality in non-Horn databases / Schaerf, Marco. - (1993), pp. 147-157. (Intervento presentato al convegno 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems tenutosi a Washington, DC, USA).
Negation and minimality in non-Horn databases
Schaerf, Marco
1993
Abstract
In this work we generalize the semantics for negation in logic programs, putting together the constructive nature of the rule-based deductive database with the syntax-independence of the closed-world reasoning rules. These generalized semantics are shown to be a well-motivated and well-founded alternative to closed-world assumptions since they enjoy nice semantic and computational properties.| File | Dimensione | Formato | |
|---|---|---|---|
|
Schaerf_Negation_12993.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.12 MB
Formato
Adobe PDF
|
1.12 MB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
