Deduction in Existential Conjunctive First-Order Logic: an Algorithm and Experiments - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2010

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

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.

Dates and versions

lirmm-00537836 , version 1 (19-11-2010)

Identifiers

Cite

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⟩
365 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More