Artificial Intelligence and Symbolic Computation

DOI10.1007/b100361zbMath1109.68501OpenAlexW4205793925MaRDI QIDQ5464701

Nao Hirokawa, Aart Middeldorp

Publication date: 19 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100361

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Related Items (14)

Relative termination via dependency pairs ⋮ Reducing Relative Termination to Dependency Pair Problems ⋮ Proving termination of context-sensitive rewriting by transformation ⋮ Polynomials over the reals in proofs of termination : from theory to practice ⋮ Tyrolean termination tool: techniques and features ⋮ Mechanizing and improving dependency pairs ⋮ Arctic Termination ...Below Zero ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ Automating the dependency pair method ⋮ Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Increasing interpretations ⋮ Increasing Interpretations ⋮ Tuple interpretations for termination of term rewriting

This page was built for publication: Artificial Intelligence and Symbolic Computation