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.
|Number of pages||17|
|Journal||Theory and Practice of Logic Programming|
|State||Published - Jan 26 2015|
Bibliographical notePublisher Copyright:
Copyright © 2014 Cambridge University Press.
- answer set programming
- intuitionistic logic
- semantics of aggregates
- strong equivalence
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics
- Artificial Intelligence