233 citations
- Université d'OrléansFR47 papers
- Services déconcentrés d'appui à la recherche Val de LoireFR39 papers
- Centre National de la Recherche ScientifiqueFR29 papers
- Université de ToursFR16 papers
- Laboratoire d'Informatique Fondamentale d'Orléans13 papers
- GREMAN, Matériaux, Microélectronique, Acoustique, NanotechnologiesFR11 papers
- Institut Polytechnique de BordeauxFR9 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR9 papers
- Université de BordeauxFR9 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR8 papers
- Czech Academy of SciencesCZ7 papers
- Czech Academy of Sciences, Institute of Computer ScienceCZ7 papers
8 papers · 1 filter
Crisp bi-Gödel modal logic and its paraconsistent expansion
Marta Bilkova, Sabine Frittella, Daniil Kozhemiachenko
In this paper, we provide a Hilbert-style axiomatisation for the crisp bi-Gödel modal logic $\KbiG$. We prove its completeness w.r.t.\ crisp Kripke models where formulas at each st…
Qualitative reasoning in a two-layered framework
Marta Bilkova, Sabine Frittella, Daniil Kozhemiachenko +1
The reasoning with qualitative uncertainty measures involves comparative statements about events in terms of their likeliness without necessarily assigning an exact numerical value…
Fusion of Satellite Images and Weather Data with Transformer Networks for Downy Mildew Disease Detection
William Maillet, Maryam Ouhami, Adel Hafiane
Crop diseases significantly affect the quantity and quality of agricultural production. In a context where the goal of precision agriculture is to minimize or even avoid the use of…
Generative models-based data labeling for deep networks regression: application to seed maturity estimation from UAV multispectral images
Eric Dericquebourg, Adel Hafiane, Raphael Canals
Monitoring seed maturity is an increasing challenge in agriculture due to climate change and more restrictive practices. Seeds monitoring in the field is essential to optimize the…
On graphs coverable by k shortest paths
Maël Dumas, Florent Foucaud, Anthony Perez +1
We show that if the edges or vertices of an undirected graph can be covered by shortest paths, then the pathwidth of is upper-bounded by a single-exponential function o…
Paraconsistent Gödel modal logic
Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko
We introduce a~paraconsistent modal logic , based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation . We use the l…