Automated Deduction – CADE-19

DOI10.1007/b11829zbMath1278.68264OpenAlexW2483160171MaRDI QIDQ5900708

Nao Hirokawa, Aart Middeldorp

Publication date: 20 April 2010

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

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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

On proving \(C_E\)-termination of rewriting by size-change termination ⋮ Verifying termination and reduction properties about higher-order logic programs ⋮ Certifying a Termination Criterion Based on Graphs, without Graphs ⋮ On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs ⋮ The size-change principle and dependency pairs for termination of term rewriting

This page was built for publication: Automated Deduction – CADE-19