Tree tuple languages from the logic programming point of view

DOI10.1007/S10817-006-9064-8zbMath1113.68038OpenAlexW1985272693MaRDI QIDQ877842

Gernot Salzer, Sébastien Limet

Publication date: 3 May 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9064-8

zbMATH Keywords

inductive definitions over language expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17)

Related Items (2)

Towards more precise rewriting approximations ⋮ Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems

Cites Work

• Rational tree relations
• Set constraints and automata
• Haskell overloading is DEXPTIME-complete
• Set constraints with intersection
• Hyperresolution and automated model building
• Theoretical Aspects of Computing – ICTAC 2005
• Grid structures and undecidable constraint theories
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree tuple languages from the logic programming point of view