2022
DOI: 10.1007/978-3-031-06981-9_4
|View full text |Cite
|
Sign up to set email alerts
|

Union and Intersection of All Justifications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 32 publications
0
1
0
Order By: Relevance
“…While the former problem remains polynomial in EL, the latter necessarily needs exponential time, as the number of justifications may be exponential on the size of the ontology. Despite some potential uses, which have been identified for non standard reasoning [6], only very recently have specific algorithms for computing the unions and intersection of justifications been developed [9,14]. To the best of our knowledge, no previous work has considered computing the justifications of minimal cardinality directly.…”
Section: Preliminariesmentioning
confidence: 99%
“…While the former problem remains polynomial in EL, the latter necessarily needs exponential time, as the number of justifications may be exponential on the size of the ontology. Despite some potential uses, which have been identified for non standard reasoning [6], only very recently have specific algorithms for computing the unions and intersection of justifications been developed [9,14]. To the best of our knowledge, no previous work has considered computing the justifications of minimal cardinality directly.…”
Section: Preliminariesmentioning
confidence: 99%