Infinitary equilibrium logic and strongly equivalent logic programs

DOI10.1016/j.artint.2017.02.002zbMath1419.68120OpenAlexW2590401811MaRDI QIDQ2407875

Yanyan Li

Publication date: 6 October 2017

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2017.02.002

zbMATH Keywords

answer set programminglogic of here-and-therestrong equivalence

Mathematics Subject Classification ID

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

Related Items

An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Strong Equivalence of Logic Programs with Counting ⋮ A progression semantics for first-order logic programs ⋮ Here and There with Arithmetic ⋮ Relating Two Dialects of Answer Set Programming ⋮ Verifying Tight Logic Programs with anthem and vampire ⋮ Autoepistemic answer set programming ⋮ Query inseparability for \(\mathcal{ALC}\) ontologies

Uses Software

• Gringo

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On intermediate many-valued logics
• Logic programs with stable model semantics as a constraint programming paradigm
• Finite limitations on Dummett's LC
• Connecting First-Order ASP and the Logic FO(ID) through Reducts
• Infinitary Equilibrium Logic and Strong Equivalence
• Introduction to Boolean Algebras
• Infinitary intuitionistic logic from a classical point of view
• On equivalence of infinitary formulas under the stable model semantics
• Abstract gringo
• Proving infinitary formulas
• Propositional theories are strongly equivalent to logic programs
• Logic Programming and Nonmonotonic Reasoning
• The sentential calculus with infinitely long expressions
• Strongly equivalent logic programs