Analysis of logic programs using regular tree languages (extended abstract)

DOI10.1007/978-3-642-32211-2_1MaRDI QIDQ4909309zbMATH OpenOpenAlexFDO

Authors John P. Gallagher

Publication date 13 March 2013

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32211-2_1

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic programming (68N17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Logic Programming
• scientific article; zbMATH DE number 4035104
• Finite-tree analysis for constraint logic-based languages
• scientific article; zbMATH DE number 1832223
• Logic Programming

Cited in

(4)

• Logic Programming
• Characterization of Logics over Ranked Tree Languages
• scientific article; zbMATH DE number 4035104 (Why is no real title available?)
• Finite-tree analysis for constraint logic-based languages

This page was built for publication: Analysis of logic programs using regular tree languages (extended abstract)

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