Infinitary Formulas in Answer Set Programming (2015)
Amelia Harrison, Vladimir Lifschitz, and Miroslaw Truszczynski
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.
View:
PDF
Citation:
ALP Newsletter (2015).
Bibtex:

Amelia Harrison Ph.D. Student ameliaj [at] cs utexas edu
Vladimir Lifschitz Faculty vl [at] cs utexas edu