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, ...
In this paper we study the brokering and matchmaking problem, that is, how a requester’s requirements and preferences can be matched against a set of offerings collected by a bro...
Grigoris Antoniou, Thomas Skylogiannis, Antonis Bi...
The paper proposes a unification of the two main frameworks commonly used for the analysis of collective decisionmaking: the framework of preference aggregation, developed from t...
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...