From the 2 of 12 papers with an AI index.
5 citations
- Aix-Marseille UniversitéFR10 papers
- Centre National de la Recherche ScientifiqueFR8 papers
- École Normale Supérieure de LyonFR2 papers
- Laboratoire de l'Informatique du ParallélismeFR2 papers
- Université Grenoble AlpesFR2 papers
- Artificial Intelligence Research InstituteES1 paper
- Carleton UniversityCA1 paper
- Centrale MarseilleFR1 paper
- Czech Academy of SciencesCZ1 paper
- Czech Academy of Sciences, Institute of Computer ScienceCZ1 paper
- Délégation Provence et CorseFR1 paper
- GIPSA-LabFR1 paper
4 papers · 1 filter
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…
Reasoning About Probabilities, Actions, and Knowledge in Fuzzy Modal Logic
Daniil Kozhemiachenko, Igor Sedlár
We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expres…
Probabilistic Abduction in a Fuzzy Logic Framework
Tommaso Flaminio, Katsumi Inoue, Daniil Kozhemiachenko
We study the problem of explaining observations about the probabilities of events, such as "it rains of the time", "rain and snow are equally likely", etc. We explain these…
Extensional Taylor Expansion
Lison Blondeau-Patissier, Pierre Clairambault, Lionel Vaux Auclair
We introduce a calculus of extensional resource terms. These are resource terms à la Ehrhard-Regnier, but in infinitely eta-long form. The calculus still retains a finite syntax an…