On derived dependencies and connected databases
Journal of Logic Programming
Precise and efficient groundness analysis for logic programs
ACM Letters on Programming Languages and Systems (LOPLAS)
Global analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical model for relational abstract domains
ACM Transactions on Programming Languages and Systems (TOPLAS)
Two classes of Boolean functions for dependency analysis
Science of Computer Programming
Sharing and groundness dependencies in logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
A faster solver for general systems of equations
Science of Computer Programming
Incremental analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Analysis of Standard Prolog Programs
ESOP '96 Proceedings of the 6th European Symposium on Programming Languages and Systems
Implementing Groundness Analysis with Definite Boolean Functions
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Factorizing Equivalent Variable Pairs in ROBDD-Based Implementations of Pos
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
The Def-inite Approach to Dependency Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Worst-case groundness analysis using definite Boolean functions
Theory and Practice of Logic Programming
Inferring non-suspension conditions for logic programs with dynamic scheduling
ACM Transactions on Computational Logic (TOCL)
Quadtrees as an Abstract Domain
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximate quantifier elimination for propositional boolean formulae
NFM'11 Proceedings of the Third international conference on NASA Formal methods
Techniques for scaling up analyses based on pre-interpretations
ICLP'05 Proceedings of the 21st international conference on Logic Programming
A pearl on SAT solving in prolog
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A pearl on SAT and SMT solving in Prolog
Theoretical Computer Science
Theory propagation and rational-trees
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
| Hi-index | 0.00 |
Boolean functions are ubiquitous in the analysis of (constraint) logic programs.The domain of positive Boolean functions, Pos, has been used for expressing, for example, groundness, finiteness and sharing dependencies.The performance of an analyser based on Boolean functions is critically dependent on the way in which the functions are represented.This paper discusses multiheaded clauses as a representation of positive Boolean functions.The domain operations for multiheaded clauses are conceptually simple and can be implemented straightforwardly in Prolog.Moreo ver these operations generalise those for the less algorithmically complex operations of propositional Horn clauses, leading to naturally stratified algorithms.The multiheaded clause representation is used to build a pos-based groundness analyser.The analyser performs surprisingly well and scales smoothly, not requiring widening to analyse any program in the benchmark suite.