73 search results - page 5 / 15 » Tight Bounds on the Descriptional Complexity of Regular Expr... |
JAPLL
2010
13 years 6 months ago
2010
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
TOOLS
1999
IEEE
13 years 11 months ago
1999
IEEE
In this paper we enhance the SOFA Component Description Language with a semantic description of a component's functionality. There are two key requirements this description a...
DLOG
2008
13 years 9 months ago
2008
Abstract. We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural ty...
JUCS
2010
13 years 6 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
DLOG
2003
13 years 8 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...