Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation

DOI10.1007/978-3-540-89439-1_47zbMath1182.68093OpenAlexW1569900092MaRDI QIDQ5505589

John P. Gallagher, Mads Rosendahl

Publication date: 27 January 2009

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89439-1_47

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Grammars and rewriting systems (68Q42)

Related Items (2)

Equational approximations for tree automata completion ⋮ Proving semantic properties as first-order satisfiability

This page was built for publication: Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation