Static semantics for normal and disjunctive logic programs

DOI10.1007/BF01530826zbMATH Open0855.68015OpenAlexW2028245171MaRDI QIDQ1924728FDOQ1924728

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)

Cites Work

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

Cited In (17)

• A tableau calculus for minimal model reasoning
• Autoepistemic logic of knowledge and beliefs
• Characterizing D-WFS: Confluence and iterated GCWA
• The infinite-valued semantics: overview, recent results and future directions
• On the equivalence of the static and disjunctive well-founded semantics and its computation
• Characterizations of the stable semantics by partial evaluation
• A logic programming system for nonmonotonic reasoning
• Semantics of structured normal logic programs
• Disjunctive logic programs, answer sets, and the cut rule
• 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
• Strong and explicit negation in non-monotonic reasoning and logic programming
• Belief, provability, and logic programs
• Closed world assumption for disjunctive reasoning
• Enhancing disjunctive logic programming systems by SAT checkers

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)