2021
DOI: 10.4204/eptcs.345.19
|View full text |Cite
|
Sign up to set email alerts
|

Weighted Conditional EL^bot Knowledge Bases with Integer Weights: an ASP Approach

Abstract: Weighted knowledge bases for description logics with typicality have been recently considered under a "concept-wise" multipreference semantics (in both the two-valued and fuzzy case), as the basis of a logical semantics of Multilayer Perceptrons. In this paper we consider weighted conditional E L ⊥ knowledge bases in the two-valued case, and exploit ASP and asprin for encoding concept-wise multipreference entailment for weighted KBs with integer weights.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…This work is a first step towards the definition of proof methods for reasoning from weighted KBs under a finitely many-valued preferential semantics in more expressive or lightweight DLs. For , the two-valued case has been studied in previous work by Giordano and Theseider Dupré (2021a).…”
Section: Discussionmentioning
confidence: 99%
“…This work is a first step towards the definition of proof methods for reasoning from weighted KBs under a finitely many-valued preferential semantics in more expressive or lightweight DLs. For , the two-valued case has been studied in previous work by Giordano and Theseider Dupré (2021a).…”
Section: Discussionmentioning
confidence: 99%
“…This work is a first step towards the definition of proof methods for reasoning from weighted KBs under a finitely many-valued preferential semantics in more expressive or lightweight DLs. For EL, the two-valued case has been studied in [26].…”
Section: Discussionmentioning
confidence: 99%