An Infinite-Valued Semantics for Logic Programs with Negation

We give a purely model-theoretic (denotational) characterization of the semantics of logic programs with negation allowed in clause bodies. In our semantics (the first of its kind) the meaning of a program is, as in the classical case, the unique minimum model in a programindependent ordering. We us...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Rondogiannis, Panos, Wadge, William W.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Deductive Database Exact sciences and technology Logic Program Logic Programming Minimum Model Programming theory Stable Model Semantic Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!