Bottom-Up Tree Automata with Term Constraints
From MaRDI portal
Publication:4933333
DOI10.1007/978-3-642-16242-8_41zbMath1306.68096OpenAlexW1522049580MaRDI QIDQ4933333
Publication date: 12 October 2010
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-642-16242-8_41
Related Items (3)
Crossing the Syntactic Barrier: Hom-Disequalities for ${\mathcal H}_1$-Clauses ⋮ Extending \(H_1\)-clauses with disequalities ⋮ Paths, tree homomorphisms and disequalities for -clauses
This page was built for publication: Bottom-Up Tree Automata with Term Constraints