[Back]

S. Woltran:
"On Implementing Nested Logic Programs";
Talk: Dagstuhl Seminar Nr. 02381, Nonmonotonic Reasoning, Answer Set Programming and Constraints, Dagstuhl, Germany (invited); 2002-09-15 - 2002-09-20.

Nested logic programs have recently been introduced in order to allow for arbitrarily nested formulas in the heads and the bodies of logic program rules under the answer sets semantics. These programs generalise the well-known class of disjunctive logic programs providing a very flexible and compact framework for knowledge representation and reasoning.

Recent research provided several different approaches to implement such programs. One of the considered techniques deals with translations of nested logic programs into disjunctive logic programs, thus giving front-ends to dlv and smodels to compute the answer sets of nested programs. The other approaches follow a different strategy, albeit they also rely on a certain reduction technique. However, the outcome here is not a logic program, but a formula in quantified Boolean logic, and for some newly introduced subclasses, a formula in classical propositional logic. In the talk, we discuss these approaches.