Thirteen Definitions of a Stable Model

DOI10.1007/978-3-642-15025-8_24MaRDI QIDQ3586017zbMATH OpenOpenAlexFDO

Authors Vladimir Lifschitz

Publication date 3 September 2010

Published in Fields of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15025-8_24

zbMATH Keywords

answer set programmingnonmonotonic reasoningstable models

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• Twelve Definitions of a Stable Model
• scientific article; zbMATH DE number 800808
• Stable models and circumscription
• The family of stable models
• Sixty Years of Stable Models
• A stability theory for model systems
• A description of autostable models
• scientific article; zbMATH DE number 1877044
• On stability in finite models
• Publication:4507831

Cites work

• A logic for default reasoning
• A rational reconstruction of nonmonotonic truth maintenance systems
• ASSAT: computing answer sets of a logic program by SAT solvers
• Circumscription - a form of non-monotonic reasoning
• Diagnostic reasoning with A-Prolog
• 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 1368933 (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
• Logic programs with stable model semantics as a constraint programming paradigm
• 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
• Stable models and difference 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
• Twelve Definitions of a Stable Model
• Weight constraints as nested expressions

Cited in

(28)

• Stable models and difference logic
• A simple fixed point characterization of three-valued stable model semantics
• A multiparametric view on answer set programming
• First-order stable model semantics with intensional functions
• Capturing equilibrium models in modal logic
• FLP answer set semantics without circular justifications for general logic programs
• Epistemic logic programs: a study of some properties
• Semantics for conditional literals via the SM operator
• Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
• Evaluating epistemic negation in answer set programming
• On the minimality of stable models
• The Modal Logic of Equilibrium Models
• The family of stable models
• scientific article; zbMATH DE number 1114052 (Why is no real title available?)
• Temporal equilibrium logic: a survey
• Characterizing and extending answer set semantics using possibility theory
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 1877044 (Why is no real title available?)
• scientific article; zbMATH DE number 1890625 (Why is no real title available?)
• scientific article; zbMATH DE number 7453100 (Why is no real title available?)
• Stability, supportedness, minimality and Kleene answer set programs
• Answering the ``why in answer set programming -- a survey of explanation approaches
• Stable models and circumscription
• Twelve Definitions of a Stable Model
• Signed dual tableaux for Kleene answer set programs
• Epistemic logic programs: a study of some properties
• A simple proof-theoretic characterization of stable models: reduction to difference logic and experiments
• Synthesizing strongly equivalent logic programs: Beth definability for answer set programs via Craig interpolation in first-order logic

Describes a project that uses

Uses Software

• ASSAT
• Smodels

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

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