This paper explores how reasoning over DL terminologies can be captured in argumentative terms, by establishing a translation into Assumption-Based Argumentation (ABA), a rule-based formalism comprising defeasible assumptions, where argumentation semantics are used to retrieve sets of jointly acceptable assumptions.
The Knowledge-based Argumentation Framework (KAF), an extension of AF with a Knowledge Base expressed in DL - Lite, is discussed, which includes concept and role instances describing the topology of an AF, besides additional knowledge on the domain.
Gianvincenzo Alfano, S. Greco, Tariq Mahmood et al.· 0 citations
This paper looks at the results of testing deontic axioms and systems with example problems using Kripke semantics and possible worlds over accessibility relations in the context of a large ontology, and considers the notion of a sanction in a Contrary To Duty scenario.
Christopher Feener, Adam Pease, Richard Thompson· 0 citations
This paper introduces ranking-based semantics for incomplete argumentation frameworks (IAFs), and proposes a number of principles the ranking-based semantics for IAFs should follow, some adapted from existing principles out of the formal argumentation literature, others novel principles tailored to IAFs.
Incomplete Abstract Argumentation Frameworks (iAAFs) extend Abstract Argumentation Frameworks (AAFs) by allowing arguments and attacks to be specified as uncertain, enabling a compact representation of alternative argumentation scenarios.
Despite extensive work on reasoning with iAAFs, their expressive power relative...
Bettina Fazzinga, Sergio Flesca, F. Furfaro· Proceedings of the Thirty-Fi...· 0 citations
This work constructs a rewriting which takes as input both shapes and an OWL EL$^-$ ontology -- a fragment of OWL EL restricting the usage of existential restrictions -- and produces SHACL constraints, providing a powerful tool which simplifies combining reasoning with validation.
Anouk Oudshoorn, Piotr Gorczyca, D. Arndt· 0 citations
This paper proposes Class Expression Simplifier (CES), a novel algorithm for the syntactic simplification of class expressions in Description Logics (DL), which aims to preserve formal semantics while reducing representational complexity.
Alkid Baci, N'Dah Jean Kouagou, Caglar Demir et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
