9 citations · 10 across the 5 of their papers we have counts for
6 papers · 1 filter
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…
QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks
Uwe Egly, Thomas Eiter, Hans Tompits +1
In this paper, we outline the prototype of an automated inference tool, called QUIP, which provides a uniform implementation for several nonmonotonic reasoning formalisms. The theo…
DLV - A System for Declarative Problem Solving
Thomas Eiter, Wolfgang Faber, Christoph Koch +2
DLV is an efficient logic programming and non-monotonic reasoning (LPNMR) system with advanced knowledge representation mechanisms and interfaces to classic relational database sys…