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

Khalil Ben Mohamed 1, 2 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.
Document type :
Conference papers
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00537836
Contributor : Khalil Ben Mohamed <>
Submitted on : Friday, November 19, 2010 - 2:59:34 PM
Last modification on : Wednesday, June 5, 2019 - 11:58:13 AM

Links full text

Identifiers

Collections

Citation

Khalil Ben Mohamed, Michel Leclère, Marie-Laure Mugnier. Deduction in Existential Conjunctive First-Order Logic: an Algorithm and Experiments. AIMSA'10: International Conference on Artificial Intelligence: Methodology, Systems, Applications, Sep 2010, Varna, Bulgaria. pp.1-10, ⟨10.1007/978-3-642-15431-7_1⟩. ⟨lirmm-00537836⟩

Share

Metrics

Record views

724