- Record: found
- Abstract: not found
- Book Chapter: not found
Logic for Programming, Artificial Intelligence, and Reasoning
Derivational Complexity of Knuth-Bendix Orders Revisited
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references17
- Record: found
- Abstract: not found
- Book Chapter: not found
Automated Termination Proofs with AProVE
Jürgen Giesl, René Thiemann, Peter Schneider-Kamp … (2004)
- Record: found
- Abstract: not found
- Book Chapter: not found
Termination proofs and the length of derivations
Dieter Hofbauer, Clemens Lautemann (1989)