Short note preferred extensions are partial stable models

DOI10.1016/0743-1066(92)90015-UMaRDI QIDQ4015962zbMATH OpenDBLPWikidataFDO

Authors A. C. Kakas, P. Mancarella

Publication date 10 November 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(92)90015-U

zbMATH Keywords

normal logic programspartial stable modelspreferred extensionssemantics

Mathematics Subject Classification ID

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

Recommendations

• Preferred extensions as stable models
• Stable models and circumscription
• scientific article; zbMATH DE number 67821
• Extensions of homogeneous models
• scientific article; zbMATH DE number 1877044
• scientific article; zbMATH DE number 800808
• scientific article; zbMATH DE number 176723
• Partitioning subsets of stable models
• The family of stable models
• scientific article; zbMATH DE number 4127183

Cited in

(22)

• Expressive power and complexity of partial models for disjunctive deductive databases
• Soundness of abductive proof procedure with respect to constraint for non-ground abducibles
• Adding closed world assumptions to well-founded semantics
• On the duality of abduction and model generation in a framework for model generation with equality
• Logic program semantics and circumscription of autoepistemic theories
• On rules of abduction.
• The expressive powers of stable models for bound and unbound DATALOG queries
• A unifying view for logic programming with non-monotonic reasoning
• An abstract, argumentation-theoretic approach to default reasoning
• Integrating induction and abduction in logic programming
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• A nondeterministic well-founded semantics
• Dialectic proof procedures for assumption-based, admissible argumentation
• scientific article; zbMATH DE number 1696793 (Why is no real title available?)
• Oscillating behavior of logic programs
• Approved Models for Normal Logic Programs
• Preferred extensions as stable models
• On the equivalence of semantics for normal logic programs
• Logic Programming and Nonmonotonic Reasoning
• A sound and complete procedure for a general logic program in non-floundering derivations with respect to the 3-valued stable model semantics
• Three-valued completion for abductive logic programs
• Contributions to the stable model semantics of logic programs with negation

This page was built for publication: Short note preferred extensions are partial stable models

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