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, ...
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
Abstract We study the notion of strong equivalence between two disjunctive logic programs under the G3-stable model semantics, also called the P-stable semantics, and we show how s...
We study the properties of input-consuming derivations of moded logic programs. Inputconsuming derivations can be used to model the behavior of logic programs using dynamic schedu...