Stable models and circumscription
From MaRDI portal
Publication:543596
DOI10.1016/j.artint.2010.04.011zbMath1227.68103OpenAlexW2134039900MaRDI QIDQ543596
Joohyung Lee, Vladimir Lifschitz, Paolo Ferraris
Publication date: 17 June 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.04.011
Related Items (44)
Expressiveness of Logic Programs under the General Stable Model Semantics ⋮ On elementary loops of logic programs ⋮ Evaluating epistemic negation in answer set programming ⋮ ASPMT(QS): Non-Monotonic Spatial Reasoning with Answer Set Programming Modulo Theories ⋮ Lifschitz and Circumscription ⋮ Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming ⋮ Connecting First-Order ASP and the Logic FO(ID) through Reducts ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Representing first-order causal theories by logic programs ⋮ Bringing existential variables in answer set programming and bringing non-monotony in existential rules: two sides of the same coin ⋮ System aspmt2smt: Computing ASPMT Theories by SMT Solvers ⋮ Functional completion ⋮ A progression semantics for first-order logic programs ⋮ Ordered completion for logic programs with aggregates ⋮ Modeling and Reasoning in Event Calculus using Goal-Directed Constraint Answer Set Programming ⋮ Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs ⋮ Program completion in the input language of GRINGO ⋮ Representing hybrid automata by action language modulo theories ⋮ An event calculus production rule system for reasoning in dynamic and uncertain domains ⋮ First-order modular logic programs and their conservative extensions ⋮ Stable models for infinitary formulas with extensional atoms ⋮ Non-monotonic spatial reasoning with answer set programming modulo theories ⋮ Statistical relational extension of answer set programming ⋮ Ordered completion for first-order logic programs on finite structures ⋮ Extended RDF: computability and complexity issues ⋮ Arguing correctness of ASP programs with aggregates ⋮ Semantics for conditional literals via the SM operator ⋮ Verifying Tight Logic Programs with anthem and vampire ⋮ Modular Answer Set Programming as a Formal Specification Language ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Relating constraint answer set programming languages and algorithms ⋮ Lloyd-Topor completion and general stable models ⋮ Disjunctive logic programs with existential quantification in rule heads ⋮ On the stable model semantics for intensional functions ⋮ Relational theories with null values and non-herbrand stable models ⋮ Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues ⋮ Module theorem for the general theory of stable models ⋮ Preferred First-Order Answer Set Programs ⋮ John McCarthy's legacy ⋮ Revising event calculus theories to recover from unexpected observations ⋮ Determining inference semantics for disjunctive logic programs ⋮ selp: A Single-Shot Epistemic Logic Program Solver ⋮ First-order stable model semantics with intensional functions ⋮ Optimizing the computation of overriding in \(\mathcal{DL}^{\mathsf{N}}\)
Uses Software
Cites Work
- 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
- Semantical considerations on nonmonotonic logic
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- A logic of knowledge and justified assumption
- Extending and implementing the stable model semantics
- Logic programs with stable model semantics as a constraint programming paradigm
- Loop formulas for circumscription
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs
- Tight, consistent, and computable completions for unrestricted logic programs
- Rules as actions: A situation calculus semantics for logic programs
- Tight logic programs
- A Characterization of Strong Equivalence for Logic Programs with Variables
- Logic Programming and Nonmonotonic Reasoning
- Twelve Definitions of a Stable Model
- Safe Formulas in the General Theory of Stable Models (Preliminary Report)
- Strongly equivalent logic programs
This page was built for publication: Stable models and circumscription
