Static semantics for normal and disjunctive logic programs

DOI10.1007/BF01530826zbMath0855.68015OpenAlexW2028245171MaRDI QIDQ1924728

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

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

Related Items (14)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semantical considerations on nonmonotonic logic
• Inferring negative information from disjunctive databases
• On the relationship between circumscription and negation as failure
• Circumscription - a form of non-monotonic reasoning
• Autoepistemic circumscription and logic programming
• Generalized disjunctive well-founded semantics for logic programs.
• Autoepistemic logic of knowledge and beliefs
• Weak generalized closed world assumption
• A skeptical theory of inheritance in nonmonotonic semantic networks
• Negation as failure using tight derivations for general logic programs
• The well-founded semantics for general logic programs

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