47 citations · 47 across the 2 of their papers we have counts for
5 papers
Logic programs with monotone cardinality atoms
Victor W. Marek, Ilkka Niemela, Miroslaw Truszczynski
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of pro…
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…
DES: a Challenge Problem for Nonmonotonic Reasoning Systems
Maarit Hietalahti, Fabio Massacci, Ilkka Niemela
The US Data Encryption Standard, DES for short, is put forward as an interesting benchmark problem for nonmonotonic reasoning systems because (i) it provides a set of test cases of…
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…