2125 search results - page 71 / 425 » On Graph Complexity |
SEMWEB
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms ...
CORR
2007
Springer
13 years 7 months 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...
AGTIVE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Domain specific modeling languages are of increasing importance for the development of software and other systems. Meta tools are needed to support rapid development of d...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
FOCS
2003
IEEE
14 years 29 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...