658 search results - page 37 / 132 » A Logic for Graphs with QoS |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
CADE
2003
Springer
14 years 9 months ago
2003
Springer
This paper develops sound modelling and reasoning methods for imperative programs with pointers: heaps are modelled as mappings from addresses to values, and pointer structures are...
CIE
2006
Springer
14 years 12 days 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...
FCA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
DLT
2004
13 years 10 months ago
2004
New results on the recognizability of sets of finite graphs, hypergraphs and relational structures are presented. The general framework of this research which associates tightly a...