Static semantics for normal and disjunctive logic programs

DOI10.1007/BF01530826MaRDI QIDQ1924728zbMATH OpenOpenAlexFDO

Authors Teodor C. Przymusinski

Publication date 27 January 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01530826

zbMATH Keywords

disjunctive logic programmingstatic expansions of disjunctive programs

Mathematics Subject Classification ID

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

Recommendations

• On the equivalence of the static and disjunctive well-founded semantics and its computation
• scientific article; zbMATH DE number 25192
• Semantics of (disjunctive) logic programs based on partial evaluation

Cites work

• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 1292289 (Why is no real title available?)
• scientific article; zbMATH DE number 978236 (Why is no real title available?)
• A skeptical theory of inheritance in nonmonotonic semantic networks
• Autoepistemic circumscription and logic programming
• Autoepistemic logic of knowledge and beliefs
• Circumscription - a form of non-monotonic reasoning
• Generalized disjunctive well-founded semantics for logic programs.
• Inferring negative information from disjunctive databases
• Negation as failure using tight derivations for general logic programs
• On the relationship between circumscription and negation as failure
• Semantical considerations on nonmonotonic logic
• The well-founded semantics for general logic programs
• Weak generalized closed world assumption

Cited in

(18)

• Autoepistemic logic of knowledge and beliefs
• A tableau calculus for minimal model reasoning
• The infinite-valued semantics: overview, recent results and future directions
• On the equivalence of the static and disjunctive well-founded semantics and its computation
• A logic programming system for nonmonotonic reasoning
• Characterizations of the stable semantics by partial evaluation
• Semantics of structured normal logic programs
• Disjunctive logic programs, answer sets, and the cut rule
• Characterizing D-WFS: confluence and iterated GCWA
• On logics and semantics for general logic programs
• Prolegomena to logic programming for non-monotonic reasoning
• Well-founded and stationary models of logic programs
• Well-Founded and Partial Stable Semantics Logical Aspects
• Determining inference semantics for disjunctive logic programs
• Strong and explicit negation in non-monotonic reasoning and logic programming
• Belief, provability, and logic programs
• Enhancing disjunctive logic programming systems by SAT checkers
• Closed world assumption for disjunctive reasoning

This page was built for publication: Static semantics for normal and disjunctive logic programs

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