Twelve Definitions of a Stable Model

DOI10.1007/978-3-540-89982-2_8zbMATH Open1185.68166OpenAlexW1494751716MaRDI QIDQ5504644FDOQ5504644

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

• Answer Set Programming: A Primer
• Abstraction for non-ground answer set programs
• Title not available (Why is that?)
• Stable models and circumscription
• The Seventh Answer Set Programming Competition: Design and Results
• Logic programming
• Quo Vadis Answer Set Programming?
• Title not available (Why is that?)
• Grounded fixpoints and their applications in knowledge representation
• Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty
• Determining inference semantics for disjunctive logic programs
• Combining nonmonotonic knowledge bases with external sources
• Well-supported semantics for logic programs with generalized rules
• RASP and ASP as a fragment of linear logic
• Thirteen Definitions of a Stable Model

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)