Infinitary Equilibrium Logic (2014)
Amelia Harrison, Vladimir Lifschitz, Agustin Valverde, David Pearce
Strong equivalence of logic programs is an important concept in the theory of answer set programming. Equilibrium logic was used to show that propositional formulas are strongly equivalent if and only if they are equivalent in the logic of here-and-there. We extend equilibrium logic to formulas with in finitely long conjunctions and disjunctions, defi ne and axiomatize an in finitary counterpart to the logic of here-and-there, and show that the theorem on strong equivalence holds in the in finitary case as well.
In Working Notes of Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2014.

Amelia Harrison Ph.D. Student ameliaj [at] cs utexas edu
Vladimir Lifschitz Faculty vl [at] cs utexas edu