Title :
Between well-founded semantics and stable model semantics
Author_Institution :
Univ. de Provence, Marseille, France
Abstract :
Using fixpoint operations, we define a new semantics for Datalog programs with negation. The semantics is deterministic. Given a program Δ, the model of Δ in the new semantics includes the well-founded model, and is included in all stable models, if such models exist. In particular, there exist programs that have no stable models, or their well-founded model is empty, but their model in the new semantics is meaningful
Keywords :
DATALOG; database theory; deductive databases; logic programming; programming language semantics; programming theory; stability; Datalog programs; deterministic semantics; fixpoint operations; negation; stable model semantics; well-founded semantics; Deductive databases; Logic programming;
Conference_Titel :
Database Engineering and Applications, 1999. IDEAS '99. International Symposium Proceedings
Conference_Location :
Montreal, Que.
Print_ISBN :
0-7695-0265-2
DOI :
10.1109/IDEAS.1999.787277
