Advertisement
Published in:
2013 | OriginalPaper | Chapter
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
(Preliminary Report)
Authors : Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski
Published in: Logic Programming and Nonmonotonic Reasoning
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
It has been known for a long time that intuitionistically equivalent formulas 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.