64 search results - page 13 / 13 » On the Proof Complexity of Deep Inference |
99
Voted
TOPLAS
2008
15 years 27 days ago
2008
lem of inferring termination from such abstract information is not the halting problem for programs and may well be decidable. If this is the case, the decision algorithm forms a &...
CAV
2009
Springer
16 years 1 months ago
2009
Springer
D-Finder tool implements a compositional method for the verification of component-based systems described in BIP language encompassing multi-party interaction. For deadlock detecti...
131
Voted
ESWS
2005
Springer
15 years 6 months ago
2005
Springer
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g....
104
Voted
IJCAI
1989
15 years 2 months ago
1989
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...