On equivalence of infinitary formulas under the stable model semantics. Issue 1 (January 2015)

• Record Type: Journal Article
• Authors: HARRISON, AMELIA; LIFSCHITZ, VLADIMIR; TRUSZCZYNSKI, MIROSLAW
• Is Part Of: Theory and practice of logic programming. Volume 15:Issue 1(2015)
• Page Start: 18
• Page End: 34
• Publication Date: 2015-01
• Subjects: Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068414000088
• Languages: English
• ISSNs: 1471-0684

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>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.</p> </abstract>