9 citations · 10 across the 5 of their papers we have counts for
8 papers
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…
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…
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…
Reasoning about Evolving Nonmonotonic Knowledge Bases
T. Eiter, M. Fink, G. Sabbatini +1
Recently, several approaches to updating knowledge bases modeled as extended logic programs have been introduced, ranging from basic methods to incorporate (sequences of) sets of r…
Complexity of Nested Circumscription and Nested Abnormality Theories
Marco Cadoli, Thomas Eiter, Georg Gottlob
The need for a circumscriptive formalism that allows for simple yet elegant modular problem representation has led Lifschitz (AIJ, 1995) to introduce nested abnormality theories (N…
New Results on Monotone Dualization and Generating Hypergraph Transversals
Thomas Eiter, Georg Gottlob, Kazuhisa Makino
We consider the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent open proble…