Role-Value Maps and General Concept Inclusions in the Minimal Description Logic with Value Restrictions or Revisiting Old Skeletons in the DL Cupboard

Baader, Franz; Théron, Clément

doi:10.1007/s13218-020-00651-0

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2021

2023

Publication Types

Select...

Book1

Article1

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

A Short Introduction to SHACL for Logicians

Ortiz

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

A Short Introduction to SHACL for Logicians

Ortiz

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Efficient TBox Reasoning with Value Restrictions using the wer Reasoner

Baader¹,

Koopmann²,

Michel³

et al. 2021

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

The inexpressive Description Logic (DL) ${\cal F}{{\cal L}_0}$ , which has conjunction and value restriction as its only concept constructors, had fallen into disrepute when it turned out that reasoning in ${\cal F}{{\cal L}_0}$ w.r.t. general TBoxes is ExpTime-complete, that is, as hard as in the considerably more expressive logic ${\cal A}{\cal L}{\cal C}$ . In this paper, we rehabilitate ${\cal F}{{\cal L}_0}$ by presenting a dedicated subsumption algorithm for ${\cal F}{{\cal L}_0}$ , which is much simpler than the tableau-based algorithms employed by highly optimized DL reasoners. Our experiments show that the performance of our novel algorithm, as prototypically implemented in our ${\cal F}{{\cal L}_0}$ wer reasoner, compares very well with that of the highly optimized reasoners. ${\cal F}{{\cal L}_0}$ wer can also deal with ontologies written in the extension ${\cal F}{{\cal L}_ \bot }$ of ${\cal F}{{\cal L}_0}$ with the top and the bottom concept by employing a polynomial-time reduction, shown in this paper, which eliminates top and bottom. We also investigate the complexity of reasoning in DLs related to the Horn-fragments of ${\cal F}{{\cal L}_0}$ and ${\cal F}{{\cal L}_ \bot }$ .

show abstract

Role-Value Maps and General Concept Inclusions in the Minimal Description Logic with Value Restrictions or Revisiting Old Skeletons in the DL Cupboard

Cited by 2 publications

References 22 publications

A Short Introduction to SHACL for Logicians

A Short Introduction to SHACL for Logicians

Efficient TBox Reasoning with Value Restrictions using the wer Reasoner

Contact Info

Product

Resources

About