An algebraic approach to sharing analysis of logic programs

DOI10.1016/S0743-1066(99)00007-2MaRDI QIDQ4939543zbMATH OpenOpenAlexFDO

Authors Michael Codish, V. Lagoon, F. Bueno

Publication date 6 February 2000

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0743-1066(99)00007-2

zbMATH Keywords

set logic programs

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Pair-sharing over rational trees
• Soundness, idempotence and commutativity of set-sharing
• On the interaction between sharing and linearity
• Lazy Set-Sharing Analysis
• Set-sharing is redundant for pair-sharing

Cited in

(13)

• Type dependencies for logic programs using ACI-unification
• A first-order language for expressing sharing and type properties of logic programs
• Pair-independence and freeness analysis through linear refinement.
• Foundations of logic programming in hybrid logics with user-defined sharing
• A general framework for variable aliasing: towards optimal operators for sharing properties
• On the design of a correct freeness analysis for logic programs
• Optimality in goal-dependent analysis of Sharing
• On the interaction between sharing and linearity
• Lazy Set-Sharing Analysis
• scientific article; zbMATH DE number 1222406 (Why is no real title available?)
• scientific article; zbMATH DE number 1222415 (Why is no real title available?)
• Negative Ternary Set-Sharing
• Parallel Logic Programming: A Sequel

This page was built for publication: An algebraic approach to sharing analysis of logic programs

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