This paper outlines a novel approach to the computation of answer sets in an evolving and interactive environment. Instead of recomputing the semantics of the entire program, our a...
In Answer Set Programming it is not possible to deduce any conclusion from an inconsistent program (ie: a program that has no model). The same issue occurs in classical logic wher...
This paper studies compositional semantics of nonmonotonic logic programs. We suppose the answer set semantics of extended disjunctive programs and consider the following problem. ...
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
We investigate the combination of answer set programming and qualitative optimization techniques. Answer set optimization programs (ASO programs) have two parts. The generating pr...