778 search results - page 17 / 156 » Expressiveness and complexity of graph logic |
DLOG
2007
14 years 12 months ago
2007
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as formalisms capable of capturing and reasoning about imprecise and vague knowledge. The last years, research in Desc...
DLOG
1996
14 years 10 months ago
1996
Number restrictions are concept constructors that are available in almost all implemented description logic systems. However, even though there has lately been considerable effort...
SPAA
2009
ACM
15 years 10 months ago
2009
ACM
We analyze the correctness and complexity of two well-known routing algorithms, introduced by Gafni and Bertsekas (1981): By reversing the directions of some edges, these algorith...
FLAIRS
2003
14 years 11 months ago
2003
Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a nu...
107
click to vote
LPAR
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Recently, local logics for Mazurkiewicz traces are of increasing interest. This is mainly due to the fact that the satisfiability problem has the same complexity as in t...