Theory of finite or infinite trees revisited

DOI10.1017/S1471068407003171MaRDI QIDQ3514890zbMATH OpenFDO

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

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) Grammars and rewriting systems (68Q42) Logic in computer science (03B70)

Recommendations

• Extension of First-Order Theories into Trees
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• Frontiers of Combining Systems

Cites work

• Term Rewriting and All That

Cited in

(25)

• A first-order axiomatization of the theory of finite trees
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Extension of First-Order Theories into Trees
• Implicit renewal theorem for trees with general weights
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• 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
• Reducing higher-order recursion scheme equivalence to coinductive higher-order constrained Horn clauses
• A Full First-Order Constraint Solver for Decomposable Theories
• Representations of infinite tree sets
• A complete axiomatization of strict equality
• Frontiers of Combining Systems
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• Finite tree property for first-order logic with identity and functions
• An improved lower bound for the elementary theories of trees
• scientific article; zbMATH DE number 7453200 (Why is no real title available?)
• A decision procedure for (co)datatypes in SMT solvers
• New Computational Paradigms
• On the bounded theories of finite trees
• Asymmetrization of infinite trees
• And/Or Trees Revisited
• scientific article; zbMATH DE number 2080306 (Why is no real title available?)
• A decision procedure for (co)datatypes in SMT solvers
• A logical framework with higher-order rational (circular) terms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3514890)