408 search results - page 36 / 82 » Reasoning with Very Expressive Fuzzy Description Logics |
JIPS
2010
13 years 2 months ago
2010
Classical warranty plans require crisp data obtained from strictly controlled reliability tests. However, in a real situation these requirements might not be fulfilled. In an extre...
CSL
2007
Springer
14 years 1 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
DEXAW
1999
IEEE
13 years 12 months ago
1999
IEEE
Recent efforts in the Conceptual Modelling community have been devoted to properly capturing time-varying information, and several proposals of temporally enhanced Entity-Relation...
DLOG
2003
13 years 9 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...
DLOG
2001
13 years 9 months ago
2001
Description logics have been designed and studied in a modular way. This has allowed a methodic approach to complexity evaluation. We present a way to preserve this modularity in ...