We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and ...
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...
The concept of invariance for Parameterised Boolean Equation Systems (PBESs) is studied in greater detail. We identify an issue with the associated theory and fix this problem by p...
Abstract. Weighted voting games are a popular model of collaboration in multiagent systems. In such games, each agent has a weight (intuitively corresponding to resources he can co...
Edith Elkind, Georgios Chalkiadakis, Nicholas R. J...
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...