Argumentation-Based Defeasible Reasoning For Existential Rules

Abdelraouf Hecham 1 Madalina Croitoru 1 Pierre Bisquert 2, 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 : Logic based argumentation allows for defeasible reasoning over monotonic logics via grounded semantics or defeasible logic programming (DeLP). We investigate the practical implementation of such techniques for existential rules, a logical language used by many Semantic Web and Ontology Based Data Access applications. Existing tools in the literature (ASPIC+, DeLP) perform poorly for such languages due to their choice of generic reasoning methods using resolution. Since existential rules account for weak negation (as opposed to more general languages) we claim that state of the art argumentation methods (ASPIC+ or DeLP) could be practically outperformed by dedicated forward chaining methods. We analyse this problem from a theoretical point of view, especially with regards to forward chaining issues such as derivation loss, and perform a series of experiments to empirically evaluate our performance claims.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01520171
Contributor : Abdelraouf Hecham <>
Submitted on : Wednesday, May 10, 2017 - 3:05:29 PM
Last modification on : Monday, November 18, 2019 - 3:36:10 PM
Long-term archiving on : Friday, August 11, 2017 - 12:12:41 PM

File

amaas17_defeasible.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : lirmm-01520171, version 1

Collections

Citation

Abdelraouf Hecham, Madalina Croitoru, Pierre Bisquert. Argumentation-Based Defeasible Reasoning For Existential Rules. AAMAS: Autonomous Agents and MultiAgent Systems, May 2017, Sao Paulo, Brazil. pp.1568-1569. ⟨lirmm-01520171⟩

Share

Metrics

Record views

373

Files downloads

484