Well-founded and stationary models of logic programs

DOI10.1007/BF01530784MaRDI QIDQ1924748zbMATH OpenOpenAlexFDO

Authors Teodor C. Przymusinski

Publication date 20 October 1996

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

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

zbMATH Keywords

disjunctive logic programslogic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• The well-founded semantics for general logic programs
• scientific article; zbMATH DE number 25192
• Static semantics for normal and disjunctive logic programs

Cites work

• A kripke-kleene semantics for logic programs*
• A logic for default reasoning
• A procedural semantics for well-founded negation in logic programs
• A skeptical theory of inheritance in nonmonotonic semantic networks
• Autoepistemic logic
• Circumscription - a form of non-monotonic reasoning
• General logical databases and programs: Default logic semantics and stratification
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 4147555 (Why is no real title available?)
• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• scientific article; zbMATH DE number 4160107 (Why is no real title available?)
• scientific article; zbMATH DE number 4166939 (Why is no real title available?)
• scientific article; zbMATH DE number 3755910 (Why is no real title available?)
• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• scientific article; zbMATH DE number 25192 (Why is no real title available?)
• scientific article; zbMATH DE number 43398 (Why is no real title available?)
• scientific article; zbMATH DE number 611094 (Why is no real title available?)
• scientific article; zbMATH DE number 1761429 (Why is no real title available?)
• scientific article; zbMATH DE number 4185010 (Why is no real title available?)
• scientific article; zbMATH DE number 4185011 (Why is no real title available?)
• Negation as failure using tight derivations for general logic programs
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Negation in logic programming
• On the declarative and procedural semantics of logic programs
• On the relationship between circumscription and negation as failure
• Semantical considerations on nonmonotonic logic
• Static semantics for normal and disjunctive logic programs
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Three-valued nonmonotonic formalisms and semantics of logic programs

Cited in

(15)

• Logic programs, well-orderings, and forward chaining
• Recursive rules with aggregation: a simple unified semantics
• Partial equilibrium logic
• scientific article; zbMATH DE number 1696793 (Why is no real title available?)
• Well-Founded and Partial Stable Semantics Logical Aspects
• Efficient description logic reasoning in Prolog: The DLog system
• On the existence of stable models of non-stratified logic programs
• The family of stable models
• scientific article; zbMATH DE number 1759372 (Why is no real title available?)
• The infinite-valued semantics: overview, recent results and future directions
• Modeling the suppression task under weak completion and well-founded semantics
• Stable generated models, partial temporal logic and disjunctive defaults
• Loop checking and the well-founded semantics
• Logic Programming with Defaults and Argumentation Theories
• Snapshot Generation in a Constructive Object-Oriented Modeling Language

This page was built for publication: Well-founded and stationary models of logic programs

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