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

DOI10.1016/S0304-3975(00)00045-1MaRDI QIDQ5941206zbMATH OpenOpenAlexWikidataFDO

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

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

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

Recommendations

• Static semantics for normal and disjunctive logic programs
• Semantics of (disjunctive) logic programs based on partial evaluation
• Logic Programming
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Comparisons and computation of well-founded semantics for disjunctive logic programs

Cites work

• A tableau calculus for minimal model reasoning
• Autoepistemic circumscription and logic programming
• Autoepistemic logic of knowledge and beliefs
• Characterizations of the disjunctive stable semantics by partial evaluation
• Characterizations of the disjunctive well-founded semantics: Confluent calculi and iterated GCWA
• Circumscription - a form of non-monotonic reasoning
• Computation of the semantics of autoepistemic belief theories
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 1241670 (Why is no real title available?)
• scientific article; zbMATH DE number 1158758 (Why is no real title available?)
• Hyper tableaux
• 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 circumscription and negation as failure
• On the relationship between CWA, minimal model, and minimal herbrand model semantics
• Static semantics for normal and disjunctive logic programs
• The well-founded semantics for general logic programs

Cited in

(6)

• Autoepistemic logic of knowledge and beliefs
• Static semantics for normal and disjunctive logic programs
• Partial equilibrium logic
• Equivalence of well-founded and stable semantics
• A general theory of confluent rewriting systems for logic programming and its applications
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: On the equivalence of the static and disjunctive well-founded semantics and its computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5941206)