2019
DOI: 10.1007/978-3-030-31095-0_9
|View full text |Cite
|
Sign up to set email alerts
|

Efficient TBox Reasoning with Value Restrictions—Introducing the $$\mathcal {F\!L}_{o}{} \textit{wer}$$ Reasoner

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…For tableau-based reasoning systems, the expected behavior is the other way around, as these reasoners try to create a counter-example to contradict the subsumption to be tested. Thus, evaluation results might not be as informative if one would just generate pairs for the subsumption test randomly without distinguishing between positive and negative tests as it was done in the earlier study (Michel et al 2019).…”
Section: Test Datamentioning
confidence: 99%
See 3 more Smart Citations
“…For tableau-based reasoning systems, the expected behavior is the other way around, as these reasoners try to create a counter-example to contradict the subsumption to be tested. Thus, evaluation results might not be as informative if one would just generate pairs for the subsumption test randomly without distinguishing between positive and negative tests as it was done in the earlier study (Michel et al 2019).…”
Section: Test Datamentioning
confidence: 99%
“…In the initial study on FL o wer, we compared the performance for all three implemented reasoning tasks Subsumption, Subsumer Set and Classification (Michel et al 2019). Although the OWL API supports computing subsumer sets and is implemented by all considered reasoner systems, https://www.cambridge.org/core/terms.…”
Section: Evaluation Setupmentioning
confidence: 99%
See 2 more Smart Citations
“…"Efficient TBox Reasoning with Value Restrictions using the FL0wer Reasoner" by Franz Baader, Patrick Koopmann, Friedrich Michel, Anni-Yasmin Turhan, and Benjamin Zarriess is an extended version of the paper by Michel et al (2019). The paper presents a novel algorithm for solving the ExpTime-hard subsumption problem in FL0 w.r.t.…”
Section: Introductionmentioning
confidence: 99%