Boolean functions for finite-tree dependencies

DOI10.1007/3-540-45653-8_40MaRDI QIDQ2996195zbMATH OpenOpenAlexFDO

Authors Roberto Bagnara, Enea Zaffanella, Roberta Gori, Patricia M. Hill

Publication date 6 May 2011

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45653-8_40

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Finite-tree analysis for constraint logic-based languages
• scientific article; zbMATH DE number 1832223
• Two classes of Boolean functions for dependency analysis
• Efficient groundness analysis in Prolog
• scientific article; zbMATH DE number 1692955

Cited in

(5)

• Associative and commutative tree representations for Boolean functions
• scientific article; zbMATH DE number 1379304 (Why is no real title available?)
• scientific article; zbMATH DE number 1832223 (Why is no real title available?)
• scientific article; zbMATH DE number 5200724 (Why is no real title available?)
• Finite-tree analysis for constraint logic-based languages

This page was built for publication: Boolean functions for finite-tree dependencies

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