9 citations · 10 across the 5 of their papers we have counts for
Showing 2005 · cs.AIShow all
2 papers · 2 filters
cs.AI2005
Semantical Characterizations and Complexity of Equivalences in Answer Set Programming
Thomas Eiter, Michael Fink, Stefan Woltran
In recent research on non-monotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P union R and Q unio…
cs.AI2005
Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications
Thomas Eiter, Axel Polleres
Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NP-complete problems can be encoded in the answe…