On equivalence of infinitary formulas under the stable model semantics

DOI10.1017/S1471068414000088zbMath1379.68070arXiv1403.6689OpenAlexW2135808442MaRDI QIDQ4592970

Miroslaw Truszczynski, Amelia Harrison, Vladimir Lifschitz

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.6689

zbMATH Keywords

intuitionistic logicanswer set programmingstrong equivalencesemantics of aggregates

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (6)

An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms ⋮ Infinitary Equilibrium Logic and Strong Equivalence ⋮ Infinitary equilibrium logic and strongly equivalent logic programs ⋮ Proving infinitary formulas ⋮ Gelfond-Zhang aggregates as propositional formulas ⋮ Forgetting auxiliary atoms in forks

Cites Work

• Unnamed Item
• Unnamed Item
• On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
• Connecting First-Order ASP and the Logic FO(ID) through Reducts
• Logic Programming and Nonmonotonic Reasoning
• The sentential calculus with infinitely long expressions
• Strongly equivalent logic programs

This page was built for publication: On equivalence of infinitary formulas under the stable model semantics