On equivalence of infinitary formulas under the stable model semantics
From MaRDI portal
Publication:4592970
DOI10.1017/S1471068414000088zbMATH Open1379.68070arXiv1403.6689OpenAlexW2135808442MaRDI QIDQ4592970FDOQ4592970
Authors: Amelia Harrison, Vladimir Lifschitz, Mirosław Truszczyński 
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming. To appear in Theory and Practice of Logic Programming (TPLP).
Full work available at URL: https://arxiv.org/abs/1403.6689
Recommendations
- On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
- Stable models for infinitary formulas with extensional atoms
- scientific article; zbMATH DE number 1302492
- Equivalence for the \(G_3^\prime\)-stable models semantics
- Stable models of formulas with generalized quantifiers (preliminary report)
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Infinitary formulas preserved under unions of models
- scientific article; zbMATH DE number 1163986
- Stable formulas in intuitionistic logic
- Model theory for infinite quantifier languages
Logic programming (68N17) Logic in computer science (03B70) Semantics in the theory of computing (68Q55)
Cites Work
- Logic Programming and Nonmonotonic Reasoning
- Strongly equivalent logic programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
- Connecting first-order ASP and the logic FO(ID) through reducts
- The sentential calculus with infinitely long expressions
Cited In (13)
- On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
- Safe Formulas in the General Theory of Stable Models (Preliminary Report)
- Proving infinitary formulas
- Infinitary Equilibrium Logic and Strong Equivalence
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Infinitary definitions of equivalence relations in models of PA
- Forgetting auxiliary atoms in forks
- Erratum to: ``Reasoning with infinite stable models
- Some remarks on equivalence in infinitary and stationary logic
- Gelfond-Zhang aggregates as propositional formulas
- Stable models for infinitary formulas with extensional atoms
- Infinitary equilibrium logic and strongly equivalent logic programs
This page was built for publication: On equivalence of infinitary formulas under the stable model semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592970)
