Theory of finite or infinite trees revisited

DOI10.1017/S1471068407003171zbMath1148.68043MaRDI QIDQ3514890

Thi-Bich-Hanh Dao, Thom Frühwirth, Khalil Djelloul

Publication date: 23 July 2008

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

zbMATH Keywords

complete theoryrewriting ruleslogical first-order formulatheory of finite or infinite trees

Mathematics Subject Classification ID

Trees (05C05) Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (8)

A decision procedure for (co)datatypes in SMT solvers ⋮ A Decision Procedure for (Co)datatypes in SMT Solvers ⋮ A logical framework with higher-order rational (circular) terms ⋮ Unnamed Item ⋮ An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints ⋮ A full first-order constraint solver for decomposable theories ⋮ From decomposable to residual theories ⋮ A Full First-Order Constraint Solver for Decomposable Theories

Cites Work

• Term Rewriting and All That

This page was built for publication: Theory of finite or infinite trees revisited