Efficient groundness analysis in Prolog

DOI10.1017/S1471068402001485zbMath1087.68531MaRDI QIDQ4452593

Jacob M. Howe, Andy King

Publication date: 1 March 2004

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

zbMATH Keywords

abstract interpretationdefinite Boolean functionsfix-point algorithms.groundness analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (2)

A pearl on SAT and SMT solving in Prolog ⋮ Dependency Triples for Improving Termination Analysis of Logic Programs with Cut

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