The concept of a stable model for infinitary propositional formulas can be used to define the semantics of answer set programming languages. A semantics of this kind serves as a specification for the latest version of the answer set grounder GRINGO.

PDF

ALP Newsletter (2015).

@article{ALP2015, title={Infinitary Formulas in Answer Set Programming}, author={Amelia Harrison and Vladimir Lifschitz and Miroslaw Truszczynski}, booktitle={ALP Newsletter}, url="http://www.cs.utexas.edu/users/ai-lab?alp15", year={2015} }