-
3Future Event Logic- Axioms and ComplexityIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 77-99. 1998.
-
2Aleatoric Propositions: Reasoning About CoinsIn Helle Hvid Hansen, Andre Scedrov & Ruy J. G. B. De Queiroz (eds.), Logic, Language, Information, and Computation: 29th International Workshop, WoLLIC 2023, Halifax, NS, Canada, July 11–14, 2023, Proceedings, Springer Nature Switzerland. pp. 227-243. 2023.Aleatoric propositions are a generalisation of Boolean propositions, that are intrinsically probabilistic, or determined by the toss of a (biased) coin. Rather than let propositions take a true/false valuation, we assume they act as a biased coin, that will sometimes land heads (true), and sometimes land tails (false). Complex propositions then correspond to a conditional series of tosses of these coins. We extend the syntax and semantics for Aleatoric Logic to include a novel fixed-point operat…Read more
-
33Semantics for Knowledge and Change of AwarenessJournal of Logic, Language and Information 23 (2): 169-195. 2014.We examine various logics that combine knowledge, awareness, and change of awareness. An agent can become aware of propositional propositions but also of other agents or of herself. The dual operation to becoming aware, forgetting, can also be modelled. Our proposals are based on a novel notion of structural similarity that we call awareness bisimulation, the obvious notion of modal similarity for structures encoding knowledge and awareness
-
13An ontology for maintenance procedure documentationApplied ontology 18 (2): 169-206. 2023.In mining, manufacturing and industrial process industries, maintenance procedures are used as an aid to guide technicians through complex manual tasks. These procedures are not machine-readable, and cannot support reasoning in digitally integrated manufacturing systems. Procedure documents contain unstructured text and are stored in a variety of formats. The aim of this work is to query information held in real industrial maintenance procedures. To achieve this, we develop an ontology for maint…Read more
-
22Positive AnnouncementsStudia Logica 109 (3): 639-681. 2020.Arbitrary public announcement logic ) reasons about how the knowledge of a set of agents changes after true public announcements and after arbitrary announcements of true epistemic formulas. We consider a variant of arbitrary public announcement logic called positive arbitrary public announcement logic ), which restricts arbitrary public announcements to announcement of positive formulas. Positive formulas prohibit statements about the ignorance of agents. The positive formulas correspond to the…Read more
-
4Synthesis for Temporal Logic over the RealsIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 217-238. 1998.
-
Undecidablity for arbitrary public announcement logicIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 23-42. 1998.
-
Bisimulation Quantified Modal Logics: DecidabilityIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 147-166. 1998.
-
Refinement Quantified Logics of Knowledge and Belief for Multiple AgentsIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 317-338. 1998.
-
4A Sound and Complete Proof System for QPTLIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 127-147. 1998.
-
10Undecidablity for arbitrary public announcement logicIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 23-42. 1998.
-
31The Undecidability of Quantified AnnouncementsStudia Logica 104 (4): 597-640. 2016.This paper demonstrates the undecidability of a number of logics with quantification over public announcements: arbitrary public announcement logic, group announcement logic, and coalition announcement logic. In APAL we consider the informative consequences of any announcement, in GAL we consider the informative consequences of a group of agents all of which are simultaneously making known announcements. So this is more restrictive than APAL. Finally, CAL is as GAL except that we now quantify ov…Read more
-
11Synthesis for Temporal Logic over the RealsIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 217-238. 1998.
-
16A Sound and Complete Proof System for QPTLIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 127-147. 1998.
-
5Refinement Quantified Logics of Knowledge and Belief for Multiple AgentsIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 317-338. 1998.
-
6A Composable Language for Action ModelsIn Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10, Csli Publications. pp. 197-216. 2014.
-
9Future Event Logic- Axioms and ComplexityIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 77-99. 1998.
-
8Bisimulation Quantified Modal Logics: DecidabilityIn Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic, Csli Publications. pp. 147-166. 1998.
-
19Indiscrete Models: Model Building and Model Checking over Linear TimeIn Kamal Lodaya (ed.), Logic and its Applications, Springer. pp. 50--68. 2013.
-
21Tim French, Wiebe van der Hoek, Petar Iliev and Barteld Kooi. Succinctness of Epistemic Languages. In: T. Walsh (editor). Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI-11), pp. 881-886, AAAI Press, Menlo Park
-
22Expressiveness and succinctness of a logic of robustnessJournal of Applied Non-Classical Logics 25 (3): 193-228. 2015.This paper compares the recently proposed Robust Full Computational Tree Logic to model robustness in concurrent systems with other computational tree logic -based logics. RoCTL* extends CTL* with the addition of the operators Obligatory and Robustly, which quantify over failure-free paths and paths with one more failure respectively. This paper focuses on examining the succinctness and expressiveness of RoCTL* by presenting translations to and from RoCTL*. The core result of this paper is to sh…Read more
-
29Μ-programs, uniform interpolation and bisimulation quantifiers for modal logics ★Journal of Applied Non-Classical Logics 16 (3-4): 297-309. 2006.We consider the relation between the uniform interpolation property and the elimination of non-standard quantifiers (the bisimulation quantifiers) in the context of the ?-calculus. In particular, we isolate classes of frames where the correspondence between these two properties is nicely smooth