Argumentation-Based Defeasible Reasoning For Existential Rules - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

Argumentation-Based Defeasible Reasoning For Existential Rules


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.
Fichier principal
Vignette du fichier
amaas17_defeasible.pdf (119.92 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-01520171 , version 1 (10-05-2017)


  • HAL Id : lirmm-01520171 , version 1
  • PRODINRA : 390531


Abdelraouf Hecham, Madalina Croitoru, Pierre Bisquert. Argumentation-Based Defeasible Reasoning For Existential Rules. AAMAS 2017 - 16th International Conference on Autonomous Agents and MultiAgent Systems, May 2017, Sao Paulo, Brazil. pp.1568-1569. ⟨lirmm-01520171⟩
339 View
339 Download


Gmail Mastodon Facebook X LinkedIn More