On equivalence of infinitary formulas under the stable model semantics

Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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.

Original languageEnglish
Pages (from-to)18-34
Number of pages17
JournalTheory and Practice of Logic Programming
Issue number1
StatePublished - Jan 26 2015

Bibliographical note

Publisher Copyright:
Copyright © 2014 Cambridge University Press.


  • answer set programming
  • intuitionistic logic
  • semantics of aggregates
  • strong equivalence

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics
  • Artificial Intelligence


Dive into the research topics of 'On equivalence of infinitary formulas under the stable model semantics'. Together they form a unique fingerprint.

Cite this