778 search results - page 24 / 156 » Expressiveness and complexity of graph logic |
104
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
IJCAI
2001
15 years 1 months ago
2001
In the last decade, there has been several studies on the computational complexity of planning. These studies normally assume that the goal of planning is to make a certain fluent...
97
Voted
DLOG
2003
15 years 1 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...
101
click to vote
KR
2004
Springer
15 years 5 months ago
2004
Springer
The main contribution of this paper is the definition of the preference description language ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
138
click to vote
PODS
2010
ACM
15 years 5 months ago
2010
ACM
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...