Article contents
On equivalence of infinitary formulas under the stable model semantics
Published online by Cambridge University Press: 16 May 2014
Abstract
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.
- Type
- Rapid Publications from the 12th International Conference on Logic Programming and Nonmonotonic Reasoning
- Information
- Copyright
- Copyright © Cambridge University Press 2014
References
- 7
- Cited by