-
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
-
13Logic, rationality and interaction : introduction to the special issueSynthese 195 (10): 4201-4204. 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.
-
25Logic, 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.
-
7Knowledge 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
-
29Multi-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
-
21Quantified 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
-
52On 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
-
140Quantified 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
-
53Multi-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
-
43Nonmonotonic reasoning, Grigoris AntoniouJournal of Logic, Language and Information 9 (1): 125-128. 2000.
-
42A general approach to multi-agent minimal knowledge: With tools and SamplesStudia Logica 72 (1): 61-84. 2002.We extend our general approach to characterizing information to multi-agent systems. In particular, we provide a formal description of an agent''s knowledge containing exactly the information conveyed by some (honest) formula . Only knowing is important for dynamic agent systems in two ways. First of all, one wants to compare different states of knowledge of an agent and, secondly, for agent a''s decisions, it may be relevant that (he knows that) agent b does not know more than . There are three…Read more
-
30Generalized quantifiers and modal logicJournal of Logic, Language and Information 2 (1): 19-58. 1993.We study several modal languages in which some (sets of) generalized quantifiers can be represented; the main language we consider is suitable for defining any first order definable quantifier, but we also consider a sublanguage thereof, as well as a language for dealing with the modal counterparts of some higher order quantifiers. These languages are studied both from a modal logic perspective and from a quantifier perspective. Thus the issues addressed include normal forms, expressive power, c…Read more
-
47Robust normative systems and a logic of norm complianceLogic Journal of the IGPL 18 (1): 4-30. 2010.Although normative systems, or social laws, have proved to be a highly influential approach to coordination in multi-agent systems, the issue of compliance to such normative systems remains problematic. In all real systems, it is possible that some members of an agent population will not comply with the rules of a normative system, even if it is in their interests to do so. It is therefore important to consider the extent to which a normative system is robust, i.e., the extent to which it remain…Read more
-
16Review: Donald Nute, Defeasible Deontic Logic (review)Bulletin of Symbolic Logic 6 (1): 89-94. 2000.
-
48Knowledge 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
-
36A Modal Logic for Mixed StrategiesStudia Logica 102 (2): 339-360. 2014.Modal logics have proven to be a very successful tool for reasoning about games. However, until now, although logics have been put forward for games in both normal form and games in extensive form, and for games with complete and incomplete information, the focus in the logic community has hitherto been on games with pure strategies. This paper is a first to widen the scope to logics for games that allow mixed strategies. We present a modal logic for games in normal form with mixed strategies, a…Read more
-
16A verification framework for agent programming with declarative goalsJournal of Applied Logic 5 (2): 277-302. 2007.
-
136Towards a theory of intention revisionSynthese 155 (2): 265-290. 2007.Although the change of beliefs in the face of new information has been widely studied with some success, the revision of other mental states has received little attention from the theoretical perspective. In particular, intentions are widely recognised as being a key attitude for rational agents, and while several formal theories of intention have been proposed in the literature, the logic of intention revision has been hardly considered. There are several reasons for this: perhaps most importan…Read more
-
66On the semantics of graded modalitiesJournal of Applied Non-Classical Logics 2 (1): 81-123. 1992.
-
113Everything is Knowable – How to Get to Know Whether a Proposition is TrueTheoria 78 (2): 93-114. 2012.Fitch showed that not every true proposition can be known in due time; in other words, that not every proposition is knowable. Moore showed that certain propositions cannot be consistently believed. A more recent dynamic phrasing of Moore-sentences is that not all propositions are known after their announcement, i.e., not every proposition is successful. Fitch's and Moore's results are related, as they equally apply to standard notions of knowledge and belief (S 5 and KD45, respectively). If we …Read more
-
University of LiverpoolRegular Faculty
Areas of Interest
Epistemology |
Logic and Philosophy of Logic |