activity
20112026
most citedExtensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints

113 citations · 167 across the 14 of their papers we have counts for

collaborators
Showing cs.AIShow all

13 papers · 1 filter

cs.AI2026

Answering Path Queries under Linear and Guarded Existential Rules

Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier +1

Ontology-mediated query answering is concerned with the problem of answering queries over knowledge bases consisting of a database instance and an ontology. While most work in the…

cs.AI2022

Normalisations of Existential Rules: Not so Innocuous!

David Carral, Lucas Larroque, Marie-Laure Mugnier +1

Existential rules are an expressive knowledge representation language mainly developed to query data. In the literature, they are often supposed to be in some normal form that simp…

cs.AI2021

Parallelisable Existential Rules: a Story of Pieces

Maxime Buron, Marie-Laure Mugnier, Michaël Thomazo

In this paper, we consider existential rules, an expressive formalism well suited to the representation of ontological knowledge and data-to-ontology mappings in the context of ont…

cs.AI2020

Oblivious and Semi-Oblivious Boundedness for Existential Rules

Pierre Bourhis, Michel Leclère, Marie-Laure Mugnier +3

We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independe…

cs.AI2020★ 1 cited

Characterizing Boundedness in Chase Variants

Stathis Delivorias, Michel Leclère, Marie-Laure Mugnier +1

Existential rules are a positive fragment of first-order logic that generalizes function-free Horn rules by allowing existentially quantified variables in rule heads. This family o…

cs.AI2018★ 2 cited

On the k-Boundedness for Existential Rules

Stathis Delivorias, Michel Leclere, Marie-Laure Mugnier +1

The chase is a fundamental tool for existential rules. Several chase variants are known, which differ on how they handle redundancies possibly caused by the introduction of nulls.…

cs.AI2016★ 24 cited

A General Modifier-based Framework for Inconsistency-Tolerant Query Answering

Jean Francois Baget, Salem Benferhat, Zied Bouraoui +5

We propose a general framework for inconsistency-tolerant query answering within existential rule setting. This framework unifies the main semantics proposed by the state of art an…

cs.AI2015★ 8 cited

Combining Existential Rules and Transitivity: Next Steps

Jean-François Baget, Meghyn Bienvenu, Marie-Laure Mugnier +1

We consider existential rules (aka Datalog+) as a formalism for specifying ontologies. In recent years, many classes of existential rules have been exhibited for which conjunctive…

cs.AI2014★ 2 cited

Worst-case Optimal Query Answering for Greedy Sets of Existential Rules and Their Subclasses

Sebastian Rudolph, Michaël Thomazo, Jean-François Baget +1

The need for an ontological layer on top of data, associated with advanced reasoning mechanisms able to exploit the semantics encoded in ontologies, has been acknowledged both in t…

cs.AI2014

Extending Acyclicity Notions for Existential Rules (\emph{long version})

Jean-Francois Baget, Fabien Garreau, Marie-Laure Mugnier +1

Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology-Based Query Answering. Entailment with existential rules is und…

cs.AI2014★ 10 cited

Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation

Jean-François Baget, Fabien Garreau, Marie-Laure Mugnier +1

Existential rules have been proposed for representing ontological knowledge, specifically in the context of Ontology- Based Data Access. Entailment with existential rules is undeci…

cs.AI2013

Sound, Complete and Minimal UCQ-Rewriting for Existential Rules

Mélanie König, Michel Leclère, Marie-Laure Mugnier +1

We address the issue of Ontology-Based Data Access, with ontologies represented in the framework of existential rules, also known as Datalog+/-. A well-known approach involves rewr…

cs.AI2011★ 113 cited

Extensions of Simple Conceptual Graphs: the Complexity of Rules and Constraints

J. F. Baget, M. L. Mugnier

Simple conceptual graphs are considered as the kernel of most knowledge representation formalisms built upon Sowa's model. Reasoning in this model can be expressed by a graph homom…