886 search results - page 34 / 178 » Reasoning with contextual graphs |
124
click to vote
LICS
2005
IEEE
15 years 7 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
125
click to vote
LICS
2003
IEEE
15 years 7 months ago
2003
IEEE
We define the class of micro-macro stack graphs, a new class of graphs modeling infinite-state sequential systems with a decidable model-checking problem. Micro-macro stack grap...
103
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
127
click to vote
CADE
2009
Springer
16 years 2 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
107
click to vote
AMAI
2000
Springer
15 years 6 months ago
2000
Springer
Several formalisms have been proposed for qualitative reasoning about regions and their topological relations in space. These formalisms, based on pairwise relations, do not allow...