ACM Home Page
Please provide us with feedback. Feedback
Logics of propositional control
Full text PdfPdf (239 KB)
Source International Conference on Autonomous Agents archive
Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems table of contents
Hakodate, Japan
SESSION: Logics for agent systems table of contents
Pages: 193 - 200  
Year of Publication: 2006
ISBN:1-59593-303-4
Author
Jelle Gerbrandy  Dipartimento di Informatica, Torino, Italia
Sponsors
IFMAS : The International Foundation for Multiagent Systems
ATAL : The International Workshop on Agent Theories, Architectures, and Languages
SIGART: ACM Special Interest Group on Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1160633.1160664
What is a DOI?

ABSTRACT

The 'Cooperation Logic of Propositional Control', CL-PC, of van der Hoek and Wooldridge is a logic for reasoning about the ability of agents and groups of agents to obtain a certain state of affairs in a situation in which each of the agents controls a number of propositional variables.We present a number of generalizations of this model, to represent situations in which agents only partially control the value of a variable, or cases in which agents share the control of a variable. We discuss and axiomatize some of these logics of 'partial control.' In addition, we show how this family of logics are closely connected to a body of work in mathematical logic: Cylindric Modal Logic.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
D. Gabbay and V. B. Shehtman. Products of modal logics, part i. Logic Journal of the IGPL, 6(1):73--146, 1998.
 
4
P. Harrenstein. Logic in Conflict. Logical Explorations in Strategic Equilibrium. PhD thesis, Utrecht University, 2004.
 
5
R. Hirsch, I. Hodkinson, and A. Kurucz. On modal logics between KxKxK and S5xS5xS5. Journal of Symbolic Logic, 67:221--234, 2002.
 
6
C. List and P. Pettit. Aggregating sets of judgements: An impossibility result. Economics and Philosophy, 18:89--110, 2002.
 
7
R. Maddux. The equational theory of ca3 is undecidable. Journal of Symbolic Logic, 45(2):311--316, 1980.
 
8
S. Mikulas. Gabbay-style calculi. In H. Wansing, editor, Proof Theory of Modal Logic, volume 2 of Applied Logic Series, pages 243--252. Kluwer Academic Publishers, 1996.
 
9
M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Dissertation Series 2001--10.
 
10
M. Pauly. A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1):149--166, 2002.
 
11
M. Pauly and M. van Hees. Logical constraints on judgment aggregation. Journal of Philosophical Logic, 2003. forthcoming.
12
 
13
 
14
 
15
Y. Venema. Rectangular games. Journal of Symbolic Logic, 63(4):1549--1564, 1998.