-
10FoLLI-LNCS is the publication platform for the Association of Logic, Language and Information. The Association was founded in 1991 to advance research and education on the interface between logic, linguistics, computer science, and cognitive science. The FoLLI Publications on Logic, Language and Information aim to disseminate results of cutting-edge research and tutorial materials in these interdisciplinary areas. This LNCS volume is part of FoLLi book serie and contains the papers presented at …Read more
-
14Logic, rationality and interaction : introduction to the special issueSynthese 195 (10): 4201-4204. 2018.
-
Playing Cards with Hintikka: An Introduction to Dynamic Epistemic LogicIn Hans van Ditmarsch & Gabriel Sandu (eds.), Jaakko Hintikka on Knowledge and Game Theoretical Semantics, Springer. 2018.
-
23Fully Arbitrary Public AnnouncementsIn Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11, Csli Publications. pp. 252-267. 2016.
-
20Some Exponential Lower Bounds on Formula-size in Modal LogicIn Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10, Csli Publications. pp. 139-157. 2014.
-
27Logic, rationality and interaction : introduction to the special issueSynthese 195 (10): 4201-4204. 2018.
-
8Public Announcements and Belief ExpansionIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 335-346. 1998.
-
9Knowledge Condition GamesJournal of Logic, Language and Information 15 (4): 425-452. 2006.Understanding the flow of knowledge in multi-agent protocols is essential when proving the correctness or security of such protocols. Current logical approaches, often based on model checking, are well suited for modeling knowledge in systems where agents do not act strategically. Things become more complicated in strategic settings. In this paper we show that such situations can be understood as a special type of game – a knowledge condition game – in which a coalition “wins” if it is able to b…Read more
-
30Multi-Modal CTL: Completeness, Complexity, and an ApplicationStudia Logica 92 (1): 1-26. 2009.We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that the logic is de…Read more
-
22Quantified coalition logicSynthese 165 (2): 269-294. 2008.We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as “every coalition satisfying property P can achieve φ” and “there exists a coalition C satisfying property P such that C can achieve φ”. We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is neve…Read more
-
53On agents that have the ability to chooseStudia Logica 66 (1): 79-119. 2000.We demonstrate ways to incorporate nondeterminism in a system designed to formalize the reasoning of agents concerning their abilities and the results of the actions that they may perform. We distinguish between two kinds of nondeterministic choice operators: one that expresses an internal choice, in which the agent decides what action to take, and one that expresses an external choice, which cannot be influenced by the agent. The presence of abilities in our system is the reason why the usual a…Read more
-
141Quantified Coalition LogicSynthese 165 (2). 2008.We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs of Quantified Coalition Logic (QCL) allow us to express such properties as "every coalition satisfying property P can achieve φ" and "there exists a coalition C satisfying property P such that C can achieve φ". We give an axiomatisation of QCL, and show that while it is no more expressive than Coalition Logic, it is neve…Read more
-
54Multi-Modal CTL: Completeness, Complexity, and an ApplicationStudia Logica 92 (1). 2009.We define a multi-modal version of Computation Tree Logic (CTL) by extending the language with path quantifiers $E^\delta $ and $E^\delta $ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a CTL axiomatisation for each dimension. Completeness is proved by employing the completeness result for CTL to obtain a model along each dimension in turn. We also show that…Read more
-
18Seeing Is BelievingJournal of Logic, Language and Information 6 (1): 33-61. 1997.In this paper a formal framework is proposed in which variousinformative actions are combined, corresponding to the different ways in whichrational agents can acquire information. In order to solve the variousconflicts that could possibly occur when acquiring information fromdifferent sources, we propose a classification of the informationthat an agent possesses according to credibility. Based on this classification, we formalize what itmeans for agents to have seen or heard something, or to bel…Read more
-
37Reasoning About Social Choice FunctionsJournal of Philosophical Logic 40 (4): 473-498. 2011.We introduce a logic specifically designed to support reasoning about social choice functions. The logic includes operators to capture strategic ability, and operators to capture agent preferences. We establish a correspondence between formulae in the logic and properties of social choice functions, and show that the logic is expressively complete with respect to social choice functions, i.e., that every social choice function can be characterised as a formula of the logic. We prove that the log…Read more
-
89Multi-Modal CTL: Completeness, Complexity, and an Application (review)Studia Logica 92 (1): 1-26. 2009.We define a multi-modal version of Computation Tree Logic (ctl) by extending the language with path quantifiers E δ and A δ where δ denotes one of finitely many dimensions, interpreted over Kripke structures with one total relation for each dimension. As expected, the logic is axiomatised by taking a copy of a ctl axiomatisation for each dimension. Completeness is proved by employing the completeness result for ctl to obtain a model along each dimension in turn. We also show that the logic is de…Read more
-
47Logics for Qualitative Coalitional GamesLogic Journal of the IGPL 17 (3): 299-321. 2009.Qualitative Coalitional Games are a variant of coalitional games in which an agent's desires are represented as goals that are either satisfied or unsatisfied, and each choice available to a coalition is a set of goals, which would be jointly satisfied if the coalition made that choice. A coalition in a QCG will typically form in order to bring about a set of goals that will satisfy all members of the coalition. Our goal in this paper is to develop and study logics for reasoning about QCGs. We b…Read more
-
45Honesty in partial logicStudia Logica 56 (3): 323-360. 1996.We propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the notions of honesty and circumscription in this logic: What is the state of an agent that 'only knows φ' and which honest φ enable such circumscription? Redefining stable sets enables us to provide suitable syntactic a…Read more
-
78Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applicationsStudia Logica 75 (1): 125-157. 2003.Branching-time temporal logics have proved to be an extraordinarily successful tool in the formal specification and verification of distributed systems. Much of their success stems from the tractability of the model checking problem for the branching time logic CTL, which has made it possible to implement tools that allow designers to automatically verify that systems satisfy requirements expressed in CTL. Recently, CTL was generalised by Alur, Henzinger, and Kupferman in a logic known as Altern…Read more
-
28On obligations and normative ability: Towards a logical analysis of the social contractJournal of Applied Logic 3 (3-4): 396-420. 2005.
-
34Iterated Belief Change in Multi-Agent SystemsLogic Journal of the IGPL 11 (2): 223-246. 2003.We give a model for iterated belief change in multi-agent systems. The formal tool we use for this is a combination of modal and dynamic logic. Two core notions in our model are the expansion of the knowledge and beliefs of an agent, and the processing of new information. An expansion is defined as the change in the knowledge and beliefs of an agent when it decides to believe an incoming formula while holding on to its current propositional beliefs. To prevent our agents from forming inconsisten…Read more
-
University of LiverpoolRegular Faculty
Areas of Interest
Epistemology |
Logic and Philosophy of Logic |