Complexity and scalability of defeasible reasoning in many-valued weighted knowledge bases with typicality
Not on the map. Why?
Abstract (arXiv)
Weighted knowledge bases for description logics with typicality under a "concept-wise" multi-preferential semantics provide a logical interpretation of MultiLayer Perceptrons. In this context, Answer Set Programming (ASP) has been shown to be suitable for addressing defeasible reasoning in the finitely many-valued case, providing a Pip2 upper bound on the complexity of the problem, nonetheless leaving unknown the exact complexity and only providing a proof-of-concept implementation. This paper fulfils the lack by providing a PNP[log]-completeness result and new ASP encodings that deal with weighted knowledge bases with large search spaces.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 6 of its 37 references that are in the map. First posted on arXiv 8 Mar 2023.
Builds on
6 of 37 references.
References · 6
- 2020An ASP approach for reasoning in a concept-aware multipreferential lightweight DLcited by 12
- 2020Weighted defeasible knowledge bases and a multipreference semantics for a deep neural network modelcited by 11
- 2021On the KLM properties of a fuzzy DL with Typicalitycited by 6
- 2021Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measurescited by 4
- 2022An ASP approach for reasoning on neural networks under a finitely many-valued semantics for weighted conditional knowledge basescited by 4
- 2022Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentationcited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1.
2 papers.