Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
We first provide a mapping from Pearce’s equilibrium logic and Ferraris’s general logic programs to Lin and Shoham’s logic of knowledge and justified assumptions, a nonmon...