Add to ORKGWe close the gap in the complexity classification of subsumption in the simple description logic ${\cal FL}_0$, which allows for conjunctions and universal value restriction only. We prove that the subsumption problem in ${\cal FL}_0$ is PSPACE-complete for descriptive semantics when cyclic definitions are allowed. Our proof uses automata theory and as a by-product we establish the PSPACE-completeness of a certain decision problem for regular languages
Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting r...
In a previous report we have investigates subsumption in the presence of terminological cycles for t...
In this paper syntactic objects-concept constructors, called part restrictions-are considered in Des...
We close the gap in the complexity classification of subsumption in the simple description logic ${\...
We close the gap in the complexity classification of subsumption in the simple description logic \\c...
We close the gap in the complexity classification of subsumption in the simple description logic \\c...
We prove the PSPACE-completeness of the subsumption problem for(cyclic) terminologies with respect t...
We prove the PSPACE-completeness of the subsumption problem for(cyclic) terminologies with respect t...
AbstractIn the area of Description Logic (DL), both tableau-based and automata-based algorithms are ...
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to ...
Cyclic definitions in description logics have until now been investigated only for description logic...
Abstract. In Description Logics (DLs), both tableau-based and automata-based algorithms are frequent...
TBoxes are an important component of knowledge representation systems based on description logics (...
. This paper compares two approaches for deriving subsumption algorithms for the description logic A...
We study the complexity of the combination of the Description Logics ALCQ and ALCQI with a terminolo...
Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting r...
In a previous report we have investigates subsumption in the presence of terminological cycles for t...
In this paper syntactic objects-concept constructors, called part restrictions-are considered in Des...
We close the gap in the complexity classification of subsumption in the simple description logic ${\...
We close the gap in the complexity classification of subsumption in the simple description logic \\c...
We close the gap in the complexity classification of subsumption in the simple description logic \\c...
We prove the PSPACE-completeness of the subsumption problem for(cyclic) terminologies with respect t...
We prove the PSPACE-completeness of the subsumption problem for(cyclic) terminologies with respect t...
AbstractIn the area of Description Logic (DL), both tableau-based and automata-based algorithms are ...
In Description Logics (DLs), both tableau-based and automatabased algorithms are frequently used to ...
Cyclic definitions in description logics have until now been investigated only for description logic...
Abstract. In Description Logics (DLs), both tableau-based and automata-based algorithms are frequent...
TBoxes are an important component of knowledge representation systems based on description logics (...
. This paper compares two approaches for deriving subsumption algorithms for the description logic A...
We study the complexity of the combination of the Description Logics ALCQ and ALCQI with a terminolo...
Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting r...
In a previous report we have investigates subsumption in the presence of terminological cycles for t...
In this paper syntactic objects-concept constructors, called part restrictions-are considered in Des...