Manipulating tree tuple languages by transforming logic programs

DOI10.1016/S1571-0661(04)80654-6MaRDI QIDQ4916223zbMATH OpenFDO

Authors Sébastien Limet, Gernot Salzer

Publication date 19 April 2013

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

Full work available at URL https://doi.org/10.1016/S1571-0661(04)80654-6

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Tree tuple languages from the logic programming point of view
• Transformations of logic programs
• scientific article; zbMATH DE number 4035104
• scientific article; zbMATH DE number 3976378
• Applying tree languages in proof theory

Cites work

• Alternating two-way AC-tree automata
• scientific article; zbMATH DE number 1705162 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 1375572 (Why is no real title available?)
• scientific article; zbMATH DE number 475424 (Why is no real title available?)
• scientific article; zbMATH DE number 1158762 (Why is no real title available?)
• scientific article; zbMATH DE number 1948181 (Why is no real title available?)
• scientific article; zbMATH DE number 1919508 (Why is no real title available?)
• scientific article; zbMATH DE number 1507182 (Why is no real title available?)
• Hyperresolution and automated model building
• Set constraints and automata

Cited in

(2)

• scientific article; zbMATH DE number 5529981 (Why is no real title available?)
• Tree tuple languages from the logic programming point of view

This page was built for publication: Manipulating tree tuple languages by transforming logic programs

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