Efficient groundness analysis in Prolog

DOI10.1017/S1471068402001485zbMATH Open1087.68531MaRDI QIDQ4452593FDOQ4452593

Authors: Jacob M. Howe, Andy King 

Publication date: 1 March 2004

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1538027
• A simple polynomial groundness analysis for logic programs
• Two classes of Boolean functions for dependency analysis
• scientific article; zbMATH DE number 1832222
• scientific article; zbMATH DE number 1692955

zbMATH Keywords

abstract interpretationdefinite Boolean functionsfix-point algorithms.groundness analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (12)

• Title not available (Why is that?)
• Worst-case groundness analysis using definite Boolean functions
• Boolean functions for finite-tree dependencies
• Efficient Local Unfolding with Ancestor Stacks for Full Prolog
• A simple polynomial groundness analysis for logic programs
• Title not available (Why is that?)
• A pearl on SAT and SMT solving in Prolog
• Dependency triples for improving termination analysis of logic programs with cut
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient algebraic effect handlers for Prolog
• Title not available (Why is that?)

This page was built for publication: Efficient groundness analysis in Prolog

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