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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Pierre-Henri Paris

dblp:208/0271 · DBLP profile ↗
← Back
8ranked-venue papers
3as first author
4since 2021 · last 2026
0000-0002-9665-1187ORCID · verified

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

Artificial intelligence and machine learning · 4 · 1 first-author · 3 since 2021Databases, data management, data science and information retrieval · 4 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 1 first-authorTheory of computation · 1 · 1 since 2021

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.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 100%
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
Computer vision › Image recognition and object detection › object detection
contextual reasoning
0.812024
Qiana: A First-Order Formalism to Quantify over Contexts and Formulas · KR 2024
Knowledge graphs
knowledge graph construction
0.812024
YAGO 4.5: A Large and Clean Knowledge Base with a Rich Taxonomy · SIGIR 2024
Knowledge graphs
taxonomy construction
0.812024
YAGO 4.5: A Large and Clean Knowledge Base with a Rich Taxonomy · SIGIR 2024
Logic in computer science
first-order logic
0.812024
Qiana: A First-Order Formalism to Quantify over Contexts and Formulas · KR 2024

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

paraconsistent logic · 1.5first-order theorem proving · 1.5
YearPublicationVenuePosition
2026 Qiana: A First-Order Formalism to Quantify over Contexts and Formulas with Temporality
abstract
We introduce Qiana, a logic framework for reasoning on formulas that are true only in specific contexts. In Qiana, it is possible to quantify over both formulas and contexts to express, e.g., that “everyone knows everything Alice says”. Qiana also permits paraconsistent logics within contexts, so that contexts can contain contradictions. Furthermore, Qiana is based on first-order logic, and is finitely axiomatizable, so that Qiana theories are compatible with pre-existing first-order logic theorem provers. We show how Qiana can be used to represent temporality, event calculus, and modal logic. We also discuss different design alternatives of Qiana.
Simon Coumes, Pierre-Henri Paris, François Schwarzentruber, Fabian M. Suchanek
J. Artif. Intell. Res.2
2024 Qiana: A First-Order Formalism to Quantify over Contexts and Formulas
abstract
We introduce Qiana, a logic framework for reasoning on formulas that are true only in specific contexts. In Qiana, it is possible to quantify over both formulas and contexts to express, e.g., that ``everyone knows everything Alice says''. Qiana also permits paraconsistent logics within contexts, so that contexts can contain contradictions. Furthermore, Qiana is based on first-order logic, and is finitely axiomatizable, so that Qiana theories are compatible with pre-existing first-order logic theorem provers.
Simon Coumes, Pierre-Henri Paris, François Schwarzentruber, Fabian M. Suchanek
KR2
2024 MAFALDA: A Benchmark and Comprehensive Study of Fallacy Detection and Classification
abstract
Chadi Helwe, Tom Calamai, Pierre-Henri Paris, Chloé Clavel, Fabian Suchanek. Proceedings of the 2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2024.
Chadi Helwe, Tom Calamai, Pierre-Henri Paris, Chloé Clavel, Fabian M. Suchanek
NAACL-HLT3
2024 YAGO 4.5: A Large and Clean Knowledge Base with a Rich Taxonomy
abstract
International audience
Fabian M. Suchanek, Mehwish Alam, Thomas Bonald, Lihu Chen, Pierre-Henri Paris, Jules Soria
SIGIR5
2020 OntoSemStats: An Ontology to Express the Use of Semantics in RDF-Based Knowledge Graphs
Pierre-Henri Paris, Fayçal Hamdi 0001, Samira Si-Said Cherfi
ICWE1
2020 Contextual Propagation of Properties for Knowledge Graphs - A Sentence Embedding Based Approach
Pierre-Henri Paris, Fayçal Hamdi 0001, Nobal B. Niraula, Samira Si-Said Cherfi
ISWC (1)1
2019 Revealing the Conceptual Schemas of RDF Datasets
Subhi Issa, Pierre-Henri Paris, Fayçal Hamdi 0001, Samira Si-Said Cherfi
CAiSE2
2019 Interlinking RDF-based datasets: A structure-based approach
abstract
With an increase in the number of Linked Open Data datasets, insufficient interlinking quality can lead to a decrease in overall data quality. Therefore, it is necessary to keep the interlinking quality as high as possible. One of the main ways to link datasets is to use owl:sameAs links, i.e. to indicate that two things are the same. But with its strict semantics, there is a lot of misuse of owl:sameAs in the wild. Indeed, identity is often relative and depends on the context of use. We therefore propose an approach that enables considering the characteristics of involved datasets to interlink datasets thanks to owl:sameAs statements. The experimental results performed on real-world datasets show that the proposed approach is promising.
Pierre-Henri Paris, Fayçal Hamdi 0001, Samira Si-Said Cherfi
KES1