709 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Université Toulouse III - Paul SabatierFR432 papers
- Université Toulouse - Jean JaurèsFR332 papers
- Université Toulouse-I-CapitoleFR331 papers
- Institut Polytechnique de BordeauxFR326 papers
- Centre National de la Recherche ScientifiqueFR253 papers
- Université de ToulouseFR159 papers
- Institut National Polytechnique de ToulouseFR101 papers
- Université Fédérale de Toulouse Midi-PyrénéesFR92 papers
- École Nationale Supérieure d'Électrotechnique, d'Électronique, d'Informatique, d'Hydraulique et des TélécommunicationsFR52 papers
- Institut national de recherche en sciences et technologies du numériqueFR26 papers
- Institut Universitaire de FranceFR19 papers
- Sorbonne UniversitéFR19 papers
42 papers · 1 filter
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…
Modal Logic for Simulation, Refinement, and Mutual Ignorance
Hans van Ditmarsch, Tim French, Rustam Galimullin +1
Simulation and refinement are variations of the bisimulation relation, where in the former we keep only atoms and forth, and in the latter only atoms and back. Quantifying over sim…
Graded Distributed Belief
Emiliano Lorini, Dmitry Rozplokhas
We introduce a new logic of graded distributed belief that allows us to express the fact that a group of agents distributively believe that a certain fact holds with at least stren…
Dynamic Hypersequents for Public Announcement Logic
Clara Lerouvillois, Francesca Poggiolesi
Dynamic Epistemic Logic extends classical epistemic logic by modeling not only static knowledge but also its evolution through information updates. Among its various systems, Publi…
Rational Capability in Concurrent Games
Yinfeng Li, Emiliano Lorini, Munyque Mittelmann
We extend concurrent game structures (CGSs) with a simple notion of preference over computations and define a minimal notion of rationality for agents based on the concept of domin…
Direct Encoding of Declare Constraints in ASP
Francesco Chiariello, Valeria Fionda, Antonio Ielo +1
Answer Set Programming (ASP), a well-known declarative logic programming paradigm, has recently found practical application in Process Mining. In particular, ASP has been used to m…
Comparing the Update Expressivity of Communication Patterns and Action Models
Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth +1
Any kind of dynamics in dynamic epistemic logic can be represented as an action model. Right? Wrong! In this contribution we prove that the update expressivity of communication pat…
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…
Qualitative uncertainty and dynamics of argumentation through dynamic logic
Antonio Yuste-Ginel, Andreas Herzig
Dynamics and uncertainty are essential features of real-life argumentation, and many recent studies have focused on integrating both aspects into Dung's well-known abstract Argumen…
Univalent Monoidal Categories
Kobe Wullaert, Ralph Matthes, Benedikt Ahrens
Univalent categories constitute a well-behaved and useful notion of category in univalent foundations. The notion of univalence has subsequently been generalized to bicategories an…
Impure Simplicial Complexes: Complete Axiomatization
Rojo Randrianomentsoa, Hans van Ditmarsch, Roman Kuznets
Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection o…
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…
Resource separation in dynamic logic of propositional assignments
Joseph Boudou, Andreas Herzig, Nicolas Troquard
We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction…
Mixed Nondeterministic-Probabilistic Interfaces
Albert Benveniste, Kim Larsen, Jean-Baptiste Raclet
Interface theories are powerful frameworks supporting incremental and compositional design of systems through refinements and constructs for conjunction, and parallel composition.…
A framework for modelling Molecular Interaction Maps
Jean-Marc Alliot, Marta Cialdea Mayer, Robert Demolombe +2
Metabolic networks, formed by a series of metabolic pathways, are made of intracellular and extracellular reactions that determine the biochemical properties of a cell, and by a se…
To Be Announced
Hans van Ditmarsch
In this survey we review dynamic epistemic logics with modalities for quantification over information change. Of such logics we present complete axiomatizations, focussing on axiom…
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…
Game Description Logic with Integers: A GDL Numerical Extension
Munyque Mittelmann, Laurent Perrussel
Many problems can be viewed as games, where one or more agents try to ensure that certain objectives hold no matter the behavior from the environment and other agents. In recent ye…
Exploring the Jungle of Intuitionistic Temporal Logics
Joseph Boudou, Martín Diéguez, David Fernández-Duque +1
The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of…
Revisiting Explicit Negation in Answer Set Programming
Felicidad Aguado, Pedro Cabalar, Jorge Fandinno +3
A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation. This explici…
Social Choice Methods for Database Aggregation
Francesco Belardinelli, Umberto Grandi
Knowledge can be represented compactly in multiple ways, from a set of propositional formulas, to a Kripke model, to a database. In this paper we study the aggregation of informati…
Founded (Auto)Epistemic Equilibrium Logic Satisfies Epistemic Splitting
Jorge Fandinno
In a recent line of research, two familiar concepts from logic programming semantics (unfounded sets and splitting) were extrapolated to the case of epistemic logic programs. The p…
Founded World Views with Autoepistemic Equilibrium Logic
Pedro Cabalar, Jorge Fandinno, Luis Fariñas
Defined by Gelfond in 1991 (G91), epistemic specifications (or programs) are an extension of logic programming under stable models semantics that introducessubjective literals. A s…
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.