Twelve Definitions of a Stable Model

DOI10.1007/978-3-540-89982-2_8MaRDI QIDQ5504644zbMATH OpenOpenAlexFDO

Authors Vladimir Lifschitz

Publication date 22 January 2009

Published in Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-89982-2_8

Mathematics Subject Classification ID

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

Recommendations

• Thirteen Definitions of a Stable Model
• Stable models and circumscription
• scientific article; zbMATH DE number 1368933
• scientific article; zbMATH DE number 1114052
• Contributions to the stable model semantics of logic programs with negation

Cites work

• A logic for default reasoning
• ASSAT: computing answer sets of a logic program by SAT solvers
• Circumscription - a form of non-monotonic reasoning
• Extending the Smodels system with cardinality and weight constraints
• From answer set logic programming to circumscription via logic of GK
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• scientific article; zbMATH DE number 25193 (Why is no real title available?)
• scientific article; zbMATH DE number 4128783 (Why is no real title available?)
• scientific article; zbMATH DE number 2085248 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• scientific article; zbMATH DE number 3359806 (Why is no real title available?)
• scientific article; zbMATH DE number 4185010 (Why is no real title available?)
• Logic Programming and Nonmonotonic Reasoning
• Logics in Artificial Intelligence
• Nested expressions in logic programs
• Non-monotonic logic. I
• Nonmonotonic Logic II
• Rules as actions: A situation calculus semantics for logic programs
• Semantical considerations on nonmonotonic logic
• Strongly equivalent logic programs
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Tight, consistent, and computable completions for unrestricted logic programs
• Weight constraints as nested expressions

Cited in

(18)

• Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty
• Determining inference semantics for disjunctive logic programs
• Well-supported semantics for logic programs with generalized rules
• Thirteen Definitions of a Stable Model
• Answer Set Programming: A Primer
• Combining nonmonotonic knowledge bases with external sources
• RASP and ASP as a fragment of linear logic
• scientific article; zbMATH DE number 1890625 (Why is no real title available?)
• The Seventh Answer Set Programming Competition: Design and Results
• scientific article; zbMATH DE number 7455722 (Why is no real title available?)
• Stable models and circumscription
• Quo Vadis Answer Set Programming?
• Abstraction for non-ground answer set programs
• Logic programming
• Answer set programming for pattern generation in logical analysis of data
• On the foundations of grounding in answer set programming
• A brief history of updates of answer-set programs
• Grounded fixpoints and their applications in knowledge representation

Describes a project that uses

Uses Software

• ASSAT
• Smodels

This page was built for publication: Twelve Definitions of a Stable Model

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