47 citations · 47 across the 1 of their papers we have counts for
4 papers
Unfolding Partiality and Disjunctions in Stable Model Semantics
T. Janhunen, I. Niemela, D. Seipel +2
The paper studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementat…
Extending and Implementing the Stable Model Semantics
Patrik Simons
An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the semantics and the algorithm to handle new and more express…
Smodels: A System for Answer Set Programming
Ilkka Niemela, Patrik Simons, Tommi Syrjanen
The Smodels system implements the stable model semantics for normal logic programs. It handles a subclass of programs which contain no function symbols and are domain-restricted bu…
Extending the Stable Model Semantics with More Expressive Rules
Patrik Simons
The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by int…