On the equivalence of the static and disjunctive well-founded semantics and its computation

DOI10.1016/S0304-3975(00)00045-1zbMath0973.68132OpenAlexW2081383291WikidataQ126781939 ScholiaQ126781939MaRDI QIDQ5941206

Teodor C. Przymusinski, Stefan Brass, Jürgen Dix, Ilkka Niemelä

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00045-1

zbMATH Keywords

disjunctive deductive databasesdisjunctive logic programming

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

Autoepistemic logic of knowledge and beliefs, Partial equilibrium logic, A general theory of confluent rewriting systems for logic programming and its applications, Enhancing global SLS-resolution with loop cutting and tabling mechanisms

Uses Software

• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relationship between circumscription and negation as failure
• Circumscription - a form of non-monotonic reasoning
• Autoepistemic circumscription and logic programming
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Autoepistemic logic of knowledge and beliefs
• Computation of the semantics of autoepistemic belief theories
• Static semantics for normal and disjunctive logic programs
• Logic programming and nonmonotonic reasoning. Proceedings of the 4th international conference, LPNMR '97, held in Dagstuhl, Germany, July 28--31, 1997
• On the relationship between CWA, minimal model, and minimal herbrand model semantics
• The well-founded semantics for general logic programs
• Characterizations of the disjunctive stable semantics by partial evaluation
• A tableau calculus for minimal model reasoning
• Hyper tableaux