496 search results - page 34 / 100 » Practical Reasoning for Very Expressive Description Logics |
123
click to vote
TABLEAUX
2000
Springer
15 years 1 months ago
2000
Springer
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
CSL
2007
Springer
15 years 3 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 ...
CVPR
2012
IEEE
13 years 4 days ago
2012
IEEE
Modeling objects using formal grammars has recently regained much attention in computer vision. Probabilistic logic programming, such as Bilattice based Logical Reasoning (BLR), i...
DEXAW
1999
IEEE
15 years 2 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
14 years 11 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...