Positive Boolean functions as multiheaded clauses

DOI)" />>) 10.1007/3-540-45635-X_16>)MaRDI QIDQ4736508zbMATH OpenFDO

Authors Jacob M. Howe, Andy King

Publication date 9 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2237/22370120.htm

zbMATH Keywords

Abstract interpretationBoolean functionsconstraint logic programsgroundness analysis

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Two classes of Boolean functions for dependency analysis
• A simple polynomial groundness analysis for logic programs
• Efficient groundness analysis in Prolog
• Implementing groundness analysis with definite Boolean functions
• The Def-inite approach to dependency analysis

Cited in

(5)

• Positive Boolean dependencies
• Two classes of Boolean functions for dependency analysis
• Quadtrees as an abstract domain
• A pearl on SAT and SMT solving in Prolog
• A simple polynomial groundness analysis for logic programs

This page was built for publication: Positive Boolean functions as multiheaded clauses

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