In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
We propose an integrated theoretical framework, grounded in possibility theory, to account for all the aspects involved in representing and changing beliefs, representing and gene...
We introduce a game setting called a joint process, where the history of actions determine the state, and the state and agent properties determine the payoff. This setting is a sp...
Abstract. Belief merging is often described as the process of defining a base which best represents the beliefs of a group of agents (a profile of belief bases). The resulting base...
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...