9 citations · 9 across the 3 of their papers we have counts for
3 papers
cs.LO2005★ 9 cited
Data complexity of answering conjunctive queries over SHIQ knowledge bases
M. Magdalena Ortiz de la Fuente, Diego Calvanese, Thomas Eiter +1
An algorithm for answering conjunctive queries over SHIQ knowledge bases that is coNP in data complexity is given. The algorithm is based on the tableau algorithm for reasoning wit…
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…