Well-founded and stationary models of logic programs

DOI10.1007/BF01530784zbMATH Open0858.68014OpenAlexW2057947069MaRDI QIDQ1924748FDOQ1924748

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)

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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• A logic for default reasoning
• 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
• A kripke-kleene semantics for logic programs*
• On the declarative and procedural semantics of logic programs
• Static semantics for normal and disjunctive logic programs
• Negation in logic programming
• General logical databases and programs: Default logic semantics and stratification
• Three-valued nonmonotonic formalisms and semantics of logic programs
• A procedural semantics for well-founded negation in logic programs
• Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumption
• Negation as failure using tight derivations for general logic programs

Cited In (10)

• Snapshot Generation in a Constructive Object-Oriented Modeling Language
• The infinite-valued semantics: overview, recent results and future directions
• Logic Programming with Defaults and Argumentation Theories
• Recursive rules with aggregation: a simple unified semantics
• Partial equilibrium logic
• Well-Founded and Partial Stable Semantics Logical Aspects
• Loop checking and the well-founded semantics
• Efficient description logic reasoning in Prolog: The DLog system
• On the existence of stable models of non-stratified logic programs
• Modeling the suppression task under weak completion and well-founded semantics

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)