57 citations · 75 across the 21 of their papers we have counts for
24 papers
Resolving Asynchronous Distributed Knowledge
Philippe Balbiani, Hans van Ditmarsch, Clara Lerouvillois
There are by now various epistemic modal logics with intersection modalities for distributed knowledge and intersection update modalities for dynamic phenomena like agents sharing…
Intuitionistic modal logic LIK4 is decidable
Philippe Balbiani, Çigdem Gencer, Tinko Tinchev
In this note, we prove that intuitionistic modal logic LIK4 is decidable.
Axiomatisation for an asynchronous epistemic logic with sending and receiving messages
Philippe Balbiani, Hans van Ditmarsch, Clara Lerouvillois
We investigate a logic for asynchronous announcements wherein the sending of the messages by the environment is separated from their reception by the individual agents. Both come w…
Intuitionistic modal logics: epistemic reasoning with distributed knowledge
Philippe Balbiani
In this article, we add a diamond to the parametrized box-based propositional language of intuitionistic doxastic logic and intuitionistic epistemic logic introduced by Artemov and…
PSPACE-completeness of bimodal transitive weak-density logic
Philippe Balbiani, Olivier Gasquet
Windows have been introduce in \cite{BalGasq25} as a tool for designing polynomial algorithms to check satisfiability of a bimodal logic of weak-density. In this paper, after revis…
Complexity of some modal logics of density (extended version)
Philippe Balbiani, Olivier Gasquet
By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in . By using a tableau-like approach, we prove that…
Intuitionistic modal logics: new and simpler decidability proofs for FIK and LIK
Philippe Balbiani, Cigdem Gencer
In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and s…
Intuitionistic modal logics: a minimal setting
Philippe Balbiani, Çigdem Gencer
We introduce an intuitionistic modal logic strictly contained in the intuitionistic modal logic IK and being an appropriate candidate for the title of ``minimal normal intuitionist…
Local Intuitionistic Modal Logics and Their Calculi
Philippe Balbiani, Han Gao, Çiğdem Gencer +1
We investigate intuitionistic modal logics with locally interpreted and . The basic logic LIK is stronger than constructive modal logic WK and incomparable with…
Constructive S4 modal logics with the finite birelational frame property
Philippe Balbiani, Martín Diéguez, David Fernández-Duque +1
The logics and are the two leading intuitionistic variants of the modal logic . Whether the finite model property holds for each of these…
A Natural Intuitionistic Modal Logic: Axiomatization and Bi-nested Calculus
Philippe Balbiani, Han Gao, Çiğdem Gencer +1
We introduce FIK, a natural intuitionistic modal logic specified by Kripke models satisfying the condition of forward confluence. We give a complete Hilbert-style axiomatization of…
Simple Axioms for Local Properties
Philippe Balbiani, Wiebe van der Hoek, Louwe B. Kuijer
Correspondence theory allows us to create sound and complete axiomatizations for modal logic on frames with certain properties. For example, if we restrict ourselves to transitive…
Some constructive variants of S4 with the finite model property
Philippe Balbiani, Martín Diéguez, David Fernández-Duque
The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem. In…
About the unification types of the modal logics determined by classes of deterministic frames
Philippe Balbiani, Çiğdem Gencer, Maryam Rostamigiv +1
The unification problem in a propositional logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a uni…
Intuitionistic Linear Temporal Logics
Philippe Balbiani, Joseph Boudou, Martín Diéguez +1
We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transiti…
About the unification type of simple symmetric modal logics
Philippe Balbiani, Çiğdem Gencer
The unification problem in a normal modal logic is to determine, given a formula F, whether there exists a substitution s such that s(F) is in that logic. In that case, s is a unif…
Representation theorems for extended contact algebras based on equivalence relations
Philippe Balbiani, Tatyana Ivanova
The aim of this paper is to give new representation theorems for extended contact algebras. These representation theorems are based on equivalence relations.
Frame-validity games and lower bounds on the complexity of modal axioms
Philippe Balbiani, David Fernández-Duque, Andreas Herzig +1
We introduce frame-equivalence games tailored for reasoning about the size, modal depth, number of occurrences of symbols and number of different propositional variables of modal f…
Bisimulations for intuitionistic temporal logics
Philippe Balbiani, Joseph Boudou, Marín Diéguez +1
We introduce bisimulations for the logic with `next', `until' and `release', an intuitionistic temporal logic based on structures equipped with a partial order used to inte…
Exploring the bidimensional space: A dynamic logic point of view
Philippe Balbiani, David Fernández-Duque, Emiliano Lorini
We present a family of logics for reasoning about agents' positions and motion in the plane which have several potential applications in the area of multi-agent systems (MAS), such…
DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE
Philippe Balbiani, Andreas Herzig, François Schwarzentruber +1
We prove that the model checking and the satisfiability problem of both Dynamic Logic of Propositional Assignments DL-PA and Coalition Logic of Propositional Control and Delegation…
A simple proof of the completeness of APAL
Philippe Balbiani, Hans van Ditmarsch
We provide a simple proof of the completeness of arbitrary public announcement logic APAL. The proof is an improvement over the proof found in the publication Knowable as Known aft…
A Modal Logic for Termgraph Rewriting
Ph. Balbiani, R. Echahed, A. Herzig
We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-o…
Alternative axiomatics and complexity of deliberative STIT theories
Philippe Balbiani, Andreas Herzig, Nicolas Troquard
We propose two alternatives to Xu's axiomatization of the Chellas STIT. The first one also provides an alternative axiomatization of the deliberative STIT. The second one starts fr…