859 citations
- Aix-Marseille UniversitéFR204 papers
- Centre National de la Recherche ScientifiqueFR180 papers
- Université de ToulonFR108 papers
- Institut Universitaire de FranceFR32 papers
- Centre de physique des particules de MarseilleFR30 papers
- Universitat de ValènciaES30 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR29 papers
- Université Paris-SaclayFR29 papers
- Université Paris-SudFR29 papers
- Institut Méditerranéen d’OcéanologieFR28 papers
- GéoazurFR27 papers
- Institut National de Physique Nucléaire et de Physique des ParticulesFR27 papers
6 papers · 2 filters
Complexity of Łukasiewicz Modal Probabilistic Logics
Daniil Kozhemiachenko, Igor Sedlár
Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we s…
Paraconsistent Constructive Modal Logic
Han Gao, Daniil Kozhemiachenko, Nicola Olivetti
We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional att…
Complexity of Abduction in Łukasiewicz Logic
Katsumi Inoue, Daniil Kozhemiachenko
We explore the problem of explaining observations in contexts involving statements with truth degrees such as `the lift is loaded', `the symptoms are severe', etc. To formalise the…
Graphical Conditions for the Existence, Unicity and Number of Regular Models
Van-Giang Trinh, Belaid Benhamou, Sylvain Soliman +1
The regular models of a normal logic program are a particular type of partial (i.e. 3-valued) models which correspond to stable partial models with minimal undefinedness. In this p…
Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
Titouan Carette, Marc de Visme, Vivien Ducros +2
Minimizing finite automata, proving trace equivalence of labelled transition systems or representing sofic subshifts involve very similar arguments, which suggests the possibility…
Trees in graphs of large linear cliquewidth
Mikołaj Bojańczyk, Pierre Ohlmann
The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precise…