Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Richard Dapoigny

dblp:24/1348 · DBLP profile ↗
← Back
14ranked-venue papers
11as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 10 · 8 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 4 · 3 first-author · 1 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-authorTheory of computation · 2 · 2 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science › knowledge representation and reasoning › knowledge representation
mereology
1.012026
A Topological Rewriting of Tarski's Mereogeometry · AAAI 2026
Logic in computer science
proof theory
1.012026
A Topological Rewriting of Tarski's Mereogeometry · AAAI 2026
Logic in computer science
type theory
1.012026
A Topological Rewriting of Tarski's Mereogeometry · AAAI 2026
Logic in computer science › knowledge representation and reasoning › spatial reasoning
qualitative spatial reasoning
0.312026
A Topological Rewriting of Tarski's Mereogeometry · AAAI 2026

Methods — techniques the papers use, named apart from their topics

lambda-MM · 1.0coq · 1.0
YearPublicationVenuePosition
2026 A Topological Rewriting of Tarski's Mereogeometry
abstract
Qualitative spatial representation approaches which rely on Goodman-style predicative mereological theories and on a pseudo-topology, often causes some problems either for their use as a meta-information for knowledge conceptualization in advanced geometric reasoning, since they lack Euclidean geometry and fully-fledged topological spaces in the classical sense. Therefore, this paper seeks to extend an existing formalization, grounded in an underlying type theory using the Coq language, together with the Whitehead-like point-free Tarski's geometry. More precisely, we leverage an available library called lambda-MM to formalize Tarski's geometry of solids by investigating an algebraic formulation of topological relations on top of the library. Given that Tarski's work is grounded in Lesniewski’s mereology, and despite the fact that lambda-MM barely implements Tarski's geometry, the first part of the paper supplements their work by proving that mereological classes correspond to regular open sets. It forms a topology of individual names extensible with Tarski's geometric primitives. Unlike classical approaches used in qualitative logical theories, we adopt a solution that enables the specification of a topological space from mereology and a geometric subspace, thereby enhancing the theory’s expressiveness. Then, in a second part, we prove that Tarski’s geometry forms a subspace of the previous topology in which regions are restricted classes. We prove three postulates of Tarski’s work reducing his axiomatic system and extend the theory with the T2 (Hausdorff) property and additional definitions.
Richard Dapoigny
AAAI1
2015 A Coq-Based Axiomatization of Tarski's Mereogeometry
Richard Dapoigny, Patrick Barlatier
COSIT1
2015 Toward a Type-Theoretical Approach for an Ontologically-Based Detection of Underground Networks
Meriem Hafsi, Richard Dapoigny, Philippe Bolon
KSEM2
2011 Using a Dependently-Typed Language for Expressing Ontologies
Richard Dapoigny, Patrick Barlatier
KSEM1
2010 Towards Ontological Correctness of Part-whole Relations with Dependent Types
abstract
Generally, part-whole relations are modeled using fragments of first-order logic(FOL) and difficulties arise when meta-reasoning is done over their properties, leading to reason outside the logic. Alternatively, classical languages for ontological reasoning such as Description Logics + Logic Programming lack of expressive formal foundations resulting in ambiguous interpretations of relations. Moreover, they show some difficulties to prove that a given meta property is logically correct. In order to address these problems, we suggest a formal framework using a dependent (higher-order) type theory such as those used in program checking and theorem provers (e.g., Coq). All properties of part-whole relations are formalized through abstract constructs called parameterized specifications (p-specifications). We detail their content and explain how they are suitable to build an ontology of formal properties that can be further used for reasoning about higher-order properties.
Richard Dapoigny, Patrick Barlatier
FOIS1
2010 Modeling Contexts with Dependent Types
abstract
In the area of knowledge representation, a challenging topic is the formalization of context knowledge on the basis of logical foundations and ontological semantics. However, most attempts to provide a formal model of contexts suffer from a number of difficulties, such as limited expressiveness of representation, restricted variable quantification, lack of (meta) reasoning about properties, etc. In addition, type theory originally developed for formal modeling of mathematics has also been successfully applied to the correct specification of programs and in the semantics of natural language. In this paper, we suggest a type theoretical approach to the problem of context and action modeling. Type theory is used both for representing the system's knowledge of the discourse domain and for reasoning about it. For that purpose, we extend an existing dependent type theory having nice properties, with context-based rules and appropriate inductive types. We claim that the resulting theory exploiting the power of dependent types is able to provide a very expressive system together with a unified theory allowing higher-order reasoning.
Richard Dapoigny, Patrick Barlatier
Fundam. Informaticae1
2009 Towards an Ontological Modeling with Dependent Types: Application to Part-Whole Relations
Richard Dapoigny, Patrick Barlatier
ER1
2009 Reasoning about Relations with Dependent Types: Application to Context-Aware Applications
Richard Dapoigny, Patrick Barlatier
ISMIS1
2006 Modeling and Multi-agent Specification of IF-Based Distributed Goal Ontologies
Naçima Mellal, Richard Dapoigny, Patrick Barlatier, Laurent Foulloy
IEA/AIE2
2005 deriving behavior from goal structure for the intelligent control of physical systems
Richard Dapoigny, Patrick Barlatier, Éric Benoît, Laurent Foulloy
ICINCO1
2005 Formal Goal Generation for Intelligent Control Systems
Richard Dapoigny, Patrick Barlatier, Laurent Foulloy, Éric Benoît
IEA/AIE1
2003 Agent-Based Implementation on Intelligent Instruments
Richard Dapoigny, Éric Benoît, Laurent Foulloy
IEA/AIE1
2003 Functional Ontology for Intelligent Instruments
Richard Dapoigny, Éric Benoît, Laurent Foulloy
ISMIS1
2001 Fuzzy-based intelligent sensors: modeling, design, application
abstract
This paper presents a modeling of intelligent sensors based on a representation of the sensor by services it uses or it proposes, and by its user operating modes (USOMs). This modeling is used for the definition of the reactive layer of distributed agent based intelligent sensors. Our area of interest is the agent-level layer in which the concept of IIC (intelligent instrument cluster) is defined. An application that uses fuzzy-based intelligent sensors is presented in order to illustrate the concepts.
Éric Benoît, Richard Dapoigny, Laurent Foulloy
ETFA (2)2