778 search results - page 28 / 156 » Expressiveness and complexity of graph logic |
156
click to vote
CADE
2012
Springer
13 years 6 months ago
2012
Springer
The problem of SPARQL query containment is defined as determining if the result of one query is included in the result of another for any RDF graph. Query containment is important...
129
click to vote
ICDM
2005
IEEE
15 years 10 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
141
click to vote
TCS
2010
15 years 2 months ago
2010
Automatic debugging of UML class diagrams helps in the visual specification of software systems because users cannot detect errors in logical consistency easily. This paper focus...
233
click to vote
ICDE
2007
IEEE
16 years 5 months ago
2007
IEEE
In many applications it is important to find a meaningful relationship between the schemas of a source and target database. This relationship is expressed in terms of declarative ...
126
click to vote
IJCAI
2003
15 years 5 months ago
2003
Many description logics (DLs) combine knowledge tation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings. We propose to extend ...