Skip to Main content Skip to Navigation

Deduction in Existential Conjunctive First-Order Logic: an Algorithm and Experiments

Khalil Ben Mohamed 1 Michel Leclère 2 Marie-Laure Mugnier 2 
2 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 : We consider the deduction problem in the existential conjunctive fragment of first-order logic with atomic negation. This problem can be recast in terms of other database and artificial intelligence problems, namely query containment, clause entailment and boolean query answering. We refine an algorithm scheme that was proposed for query containment, which itself improves other known algorithms in databases. To study it experimentally, we build a random generator and analyze the influence of several parameters on the problem instance difficulty. Using this methodology, we experimentally compare several heuristics. We also present preliminary results on the comparison of our algorithm, which is based on homomorphism checks, to the theorem prover Prover9, which is based on the resolution method.
Document type :
Complete list of metadata
Contributor : Khalil Ben Mohamed Connect in order to contact the contributor
Submitted on : Friday, March 12, 2010 - 5:34:18 PM
Last modification on : Friday, August 5, 2022 - 3:03:00 PM


  • HAL Id : lirmm-00463579, version 1



Khalil Ben Mohamed, Michel Leclère, Marie-Laure Mugnier. Deduction in Existential Conjunctive First-Order Logic: an Algorithm and Experiments. RR-10010, 2010, pp.20. ⟨lirmm-00463579⟩



Record views