Infinitary Equilibrium Logic and Strong Equivalence

DOI10.1007/978-3-319-23264-5_33zbMath1467.68173OpenAlexW2401444989MaRDI QIDQ3449222

No author found.

Publication date: 4 November 2015

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23264-5_33

Mathematics Subject Classification ID

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

Related Items (4)

Stable Models for Temporal Theories ⋮ Infinitary equilibrium logic and strongly equivalent logic programs ⋮ Stable models for infinitary formulas with extensional atoms ⋮ Proving infinitary formulas

Cites Work

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

This page was built for publication: Infinitary Equilibrium Logic and Strong Equivalence