331 search results - page 28 / 67 » Quantified coalition logic |
125
click to vote
IJCAI
2001
15 years 3 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
115
Voted
JSYML
2002
15 years 1 months ago
2002
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
111
Voted
LPAR
2007
Springer
15 years 8 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
92
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We study the complexity of evaluating positive equality-free sentences of first-order (FO) logic over a fixed, finite structure B. This may be seen as a natural generalisation of ...
93
Voted
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
We present and formally investigate Cooperative Boolean Games, a new, natural family of coalitional games that are both compact and expressive. In such a game, an agent's pri...