Sciweavers

330 search results - page 17 / 66
» Open Problems in Logic and Games
Sort
View
AAAI
2006
13 years 9 months ago
A Computational Model of Logic-Based Negotiation
This paper presents a computational model of negotiation based on Nebel's syntax-based belief revision. The model guarantees a unique bargaining solution for each bargaining ...
Dongmo Zhang, Yan Zhang
WOA
2003
13 years 9 months ago
Policy Management for Virtual Communities of Agents
— In this paper we study the rational balance between local and global policies in virtual communities of agents. To study this problem we use a logical framework for modelling o...
Guido Boella, Leendert W. N. van der Torre
ENTCS
2008
79views more  ENTCS 2008»
13 years 8 months ago
The Compositional Method and Regular Reachability
The compositional method, introduced by Feferman and Vaught in 1959, allows to reduce the model-checking problem for a product structure to the model-checking problem for its fact...
Ingo Felscher
ECTEL
2009
Springer
13 years 12 months ago
The Influence of Coalition Formation on Idea Selection in Dispersed Teams: A Game Theoretic Approach
In an open innovation environment, organizational learning takes place by means of dispersed teams which expand their knowledge through collaborative idea generation. Research is o...
Rory L. L. Sie, Marlies Bitter-Rijpkema, Peter B. ...
AIML
2008
13 years 9 months ago
A modal perspective on monadic second-order alternation hierarchies
abstract. We establish that the quantifier alternation hierarchy of formulae of Second-Order Propositional Modal Logic (SOPML) induces an infinite corresponding semantic hierarchy ...
Antti Kuusisto