Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T02:49:25.803Z Has data issue: false hasContentIssue false

On equivalence of infinitary formulas under the stable model semantics

Published online by Cambridge University Press:  16 May 2014

AMELIA HARRISON
Affiliation:
Department of Computer Science, University of Texas, Austin, TX, USA (e-mail: ameliaj@cs.utexas.edu)
VLADIMIR LIFSCHITZ
Affiliation:
Department of Computer Science, University of Texas, Austin, TX, USA (e-mail: ameliaj@cs.utexas.edu)
MIROSLAW TRUSZCZYNSKI
Affiliation:
Department of Computer Science, University of Kentucky, Lexington, Kentucky, UK
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Rapid Publications from the 12th International Conference on Logic Programming and Nonmonotonic Reasoning
Copyright
Copyright © Cambridge University Press 2014