Thirteen Definitions of a Stable Model

DOI10.1007/978-3-642-15025-8_24zbMath1287.68021OpenAlexW1519247154MaRDI QIDQ3586017

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

nonmonotonic reasoninganswer set programmingstable models

Mathematics Subject Classification ID

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

Related Items (14)

Evaluating epistemic negation in answer set programming ⋮ The Modal Logic of Equilibrium Models ⋮ Temporal equilibrium logic: a survey ⋮ Characterizing and extending answer set semantics using possibility theory ⋮ Epistemic logic programs: a study of some properties ⋮ Semantics for conditional literals via the SM operator ⋮ Unnamed Item ⋮ Capturing equilibrium models in modal logic ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ A multiparametric view on answer set programming ⋮ Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs ⋮ First-order stable model semantics with intensional functions

Uses Software

• ASSAT
• Smodels

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• From answer set logic programming to circumscription via logic of GK
• ASSAT: computing answer sets of a logic program by SAT solvers
• Stable models and difference logic
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Non-monotonic logic. I
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• A rational reconstruction of nonmonotonic truth maintenance systems
• Nonmonotonic Logic II
• Tight, consistent, and computable completions for unrestricted logic programs
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Rules as actions: A situation calculus semantics for logic programs
• Weight constraints as nested expressions
• Diagnostic reasoning with A-Prolog
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Twelve Definitions of a Stable Model
• Strongly equivalent logic programs

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