Two classes of Boolean functions for dependency analysis
- 31 May 1998
- journal article
- Published by Elsevier in Science of Computer Programming
- Vol. 31 (1) , 3-45
- https://doi.org/10.1016/s0167-6423(96)00039-1
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Evaluation of the domain propThe Journal of Logic Programming, 1995
- Suspension analyses for concurrent logic programsACM Transactions on Programming Languages and Systems, 1994
- Bottom-up abstract interpretation of logic programsTheoretical Computer Science, 1994
- Precise and efficient groundness analysis for logic programsACM Letters on Programming Languages and Systems, 1993
- A general framework for semantics-based bottom-up abstract interpretation of logic programsACM Transactions on Programming Languages and Systems, 1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- On derived dependencies and connected databasesThe Journal of Logic Programming, 1991
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Algebraic Structures with Hard Equivalence and Minimization ProblemsJournal of the ACM, 1984
- Decompositions and functional dependencies in relationsACM Transactions on Database Systems, 1980