Sciweavers

2436 search results - page 140 / 488
» Comonadic Notions of Computation
Sort
View
131
Voted
CONCUR
2006
Springer
15 years 7 months ago
Some Remarks on Definability of Process Graphs
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 ...
Clemens Grabmayer, Jan Willem Klop, Bas Luttik
EDBTW
2006
Springer
15 years 7 months ago
Preference-Driven Querying of Inconsistent Relational Databases
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...
123
Voted
CONCUR
2008
Springer
15 years 6 months ago
Invariants for Parameterised Boolean Equation Systems
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...
Simona Orzan, Tim A. C. Willemse
ECAI
2008
Springer
15 years 5 months ago
Coalition Structures in Weighted Voting Games
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...
COMMA
2008
15 years 5 months ago
Focused search for Arguments from Propositional Knowledge
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...
Vasiliki Efstathiou, Anthony Hunter