Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs 3 1 Introduction Since their introduction by Bryant , Binary Decisions Diagrams

@inproceedings{Besson2009ComputingTL,
  title={Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs 3 1 Introduction Since their introduction by Bryant , Binary Decisions Diagrams},
  author={Fr{\'e}d{\'e}ric Besson and Thomas Jensen and Tiphaine Turpin},
  year={2009}
}
We present the semantic foundations for computing the least fix-point semantics of definite logic programs using only standard operations over boolean functions. More precisely, we propose a representation of sets of first-order terms by boolean functions and a provably sound formulation of intersection, union, and projection (an operation similar to… CONTINUE READING