Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs.

DOI10.1016/S1571-0661(04)80654-6zbMath1261.68104MaRDI QIDQ4916223

Sébastien Limet, Gernot Salzer

Publication date: 19 April 2013

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Cites Work

• Set constraints and automata
• Alternating two-way AC-tree automata
• Hyperresolution and automated model building
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Manipulating Tree Tuple Languages by Transforming Logic Programs1 1Extended abstract; see http://www.logic.at/css/ftp03.pdf for the proofs.