Skip to Main content Skip to Navigation

Traitement de requêtes conjonctives avec négation : algorithmes et expérimentations

Khalil Ben Mohamed 1
1 GRAPHIK - Graphs for Inferences on Knowledge
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : In this thesis, we consider problems at the intersection of two areas: databases and knowledge bases. We focus on two equivalent problems on conjunctive queries with negation: query containment and query answering with boolean queries while making the open-world assumption. We reformulate these problems as a deduction problem in a first-order logic fragment. Then we refine existing algorithm schemes and propose new algorithms. To study and compare them experimentally, we propose a random generator and we analyze the influence of parameters on problem instances difficulty. Finally, we analyze the improvements brought out by our refinements and we compare experimentally the algorithms.
Complete list of metadatas

Cited literature [52 references]  Display  Hide  Download
Contributor : Khalil Ben Mohamed <>
Submitted on : Friday, February 4, 2011 - 12:10:59 PM
Last modification on : Thursday, May 24, 2018 - 3:59:22 PM
Document(s) archivé(s) le : Thursday, May 5, 2011 - 3:06:30 AM


  • HAL Id : tel-00563217, version 1



Khalil Ben Mohamed. Traitement de requêtes conjonctives avec négation : algorithmes et expérimentations. Autre [cs.OH]. Université Montpellier II - Sciences et Techniques du Languedoc, 2010. Français. ⟨tel-00563217⟩



Record views


Files downloads