Boolean functions for dependency analysis: Algebraic properties and efficient representation
- 1 January 1994
- book chapter
- Published by Springer Nature
- p. 266-280
- https://doi.org/10.1007/3-540-58485-4_46
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Groundness analysis for PrologPublished by Association for Computing Machinery (ACM) ,1993
- Symbolic Boolean manipulation with ordered binary-decision diagramsACM Computing Surveys, 1992
- On derived dependencies and connected databasesThe Journal of Logic Programming, 1991
- Prop revisited: propositional formula as abstract domain for groundness analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Boolean ReasoningPublished by Springer Nature ,1990
- Safety of recursive Horn clauses with infinite relationsPublished by Association for Computing Machinery (ACM) ,1987
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- Negation as FailurePublished by Springer Nature ,1978