778 search results - page 45 / 156 » Expressiveness and complexity of graph logic |
CADE
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
120
click to vote
MKWI
2008
15 years 1 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...
132
Voted
JAR
2007
15 years 12 days ago
2007
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
98
Voted
CORR
2007
Springer
15 years 15 days ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
107
Voted
PODS
1998
ACM
15 years 4 months ago
1998
ACM
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...