Thirteen Definitions of a Stable Model

DOI10.1007/978-3-642-15025-8_24zbMATH Open1287.68021OpenAlexW1519247154MaRDI QIDQ3586017FDOQ3586017

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

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

zbMATH Keywords

answer set programmingnonmonotonic reasoningstable models

Mathematics Subject Classification ID

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

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
• Logic programs with stable model semantics as a constraint programming paradigm
• Extending the Smodels system with cardinality and weight constraints
• The Semantics of Predicate Logic as a Programming Language
• Title not available (Why is that?)
• 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
• Stable models and difference logic
• Title not available (Why is that?)
• Diagnostic reasoning with A-Prolog
• 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?)
• Twelve Definitions of a Stable Model
• A rational reconstruction of nonmonotonic truth maintenance systems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (24)

• Temporal equilibrium logic: a survey
• Epistemic logic programs: a study of some properties
• The Modal Logic of Equilibrium Models
• Title not available (Why is that?)
• Stability, supportedness, minimality and Kleene answer set programs
• Twelve Definitions of a Stable Model
• Evaluating epistemic negation in answer set programming
• Characterizing and extending answer set semantics using possibility theory
• Title not available (Why is that?)
• Stable models and circumscription
• A multiparametric view on answer set programming
• Stable models and difference logic
• Signed dual tableaux for Kleene answer set programs
• Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
• Title not available (Why is that?)
• Answering the ``why in answer set programming -- a survey of explanation approaches
• A simple fixed point characterization of three-valued stable model semantics
• First-order stable model semantics with intensional functions
• FLP answer set semantics without circular justifications for general logic programs
• The family of stable models
• Epistemic logic programs: a study of some properties
• Semantics for conditional literals via the SM operator
• Capturing equilibrium models in modal logic
• On the minimality of stable models

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)