Showing cs.AIShow all
2 papers · 1 filter
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.AI2002
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…