Pair-sharing over rational trees

DOI10.1016/S0743-1066(00)00009-1MaRDI QIDQ4520179zbMATH OpenOpenAlexFDO

Authors Andy King

Publication date 12 December 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(00)00009-1

zbMATH Keywords

sharing information

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Paired-domination of trees
• Paired domination in trees
• On Rational Trees
• scientific article; zbMATH DE number 3570368
• Trees with large paired-domination number
• Pairs of trees in tree--tree triangulations
• Generalizing Kruskal's theorem to pairs of cohabitating trees
• scientific article; zbMATH DE number 5054162
• Total and paired-domination numbers of a tree
• Publication:4206740

Cited in

(11)

• Set-sharing is redundant for pair-sharing
• Representation sharing for Prolog
• Optimality in goal-dependent analysis of Sharing
• On the interaction between sharing and linearity
• Lazy Set-Sharing Analysis
• A correct, precise and efficient integration of set-sharing, freeness and linearity for the analysis of finite and rational tree languages
• scientific article; zbMATH DE number 1832223 (Why is no real title available?)
• An algebraic approach to sharing analysis of logic programs
• Optimal multibinding unification for sharing and linearity analysis
• Static Analysis
• Finite-tree analysis for constraint logic-based languages

Describes a project that uses

Uses Software

• SICStus

This page was built for publication: Pair-sharing over rational trees

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