2 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.AI2006★ 2 cited
Logic programs with monotone abstract constraint atoms
V. W. Marek, I. Niemela, M. Truszczynski]
We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalize…
cs.LO2003
Bounded LTL Model Checking with Stable Models
Keijo Heljanko, Ilkka Niemelä
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syste…