Weighted knowledge bases with typicality and defeasible reasoning in a gradual argumentation semantics

Author:

Alviano Mario1,Giordano Laura2,Dupré Daniele Theseider2

Affiliation:

1. Dipartimento di Matematica e Informatica (DEMACS), University of Calabria, Rende, Italy

2. Dipartimento di Scienze e Innovazione Tecnologica (DISIT), University of Piemonte Orientale, Alessandria, Italy

Abstract

Weighted knowledge bases for description logics with typicality provide a logical interpretation of MultiLayer Perceptrons, based on a “concept-wise” multi-preferential semantics. On the one hand, in the finitely many-valued case, Answer Set Programming (ASP) has been shown to be suitable for addressing defeasible reasoning from weighted knowledge bases for the boolean fragment of ALC . On the other hand, the semantics of weighted knowledge bases with typicality, in their different variants, have suggested some new gradual argumentation semantics, as well as an approach for defeasible reasoning over a weighted argumentation graph, building on the gradual semantics and, specifically on the φ-coherent semantics. In this paper, we explore the relationships between weighted knowledge bases and weighted argumentation graphs, to develop proof methods for defeasible reasoning over an argumentation graph under the φ-coherent semantics, in the finitely-valued case. We establish a mapping from a weighted argumentation graph to a weighted knowledge base as well as a lower bound on the complexity of the problem of verifying graded implications over an argumentation graph in the φ-coherent semantics. We also consider a mapping from weighted knowledge bases to weighted argumentation graphs, and provide an ASP implementation and some experimental results.

Publisher

IOS Press

Reference67 articles.

1. Alviano M. , Giordano L. and Theseider Dupre D. , Typicality, conditionals and a probabilistic semantics for gradual argumentation. In Proc. 21st International Workshop on Non-Monotonic Reasoning (NMR 2023), Rhodes, Greece, September 2-4, 2023, volume 3464 of CEUR Workshop Proceedings, (2023), pp. 4–13. CEUR-WS.org.

2. Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases;Alviano;Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany,2023

3. Alviano M. , Bartoli F. , Botta M. , Esposito R. , Giordano L. and Theseider Dupre D. , A preferential interpretation of multilayer perceptrons in a conditional logic with typicality, Int. Journal of Approximate Reasoning (2024), 164. URL https://doi.org/10.1016/j.ijar.2023.109065.

4. Amgoud L. and Ben-Naim J. , Evaluation of arguments in weighted bipolar graphs. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 14th European Conference, ECSQARU 2017, Lugano, Switzerland, July 10-14, 2017, Proceedings, volume 10369 of Lecture Notes in Computer Science, (2017), pp. 25–35. Springer.

5. Gradual semantics accounting for varied-strength attacks;Amgoud;Proceedings AAMAS ’19, Montreal, QC, Canada,2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3