no code implementations • 4 Aug 2016 • Amelia Harrison, Vladimir Lifschitz
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages.
no code implementations • 20 Dec 2013 • Amelia Harrison, Vladimir Lifschitz, Fangkai Yang
Input languages of answer set solvers are based on the mathematically simple concept of a stable model.
