Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2009

Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs

Résumé

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 restriction in relational databases) using conjunction, disjunction, and existential quantification. We report on a prototype implementation of a logic solver using Binary Decision Diagrams (BDDs) to represent boolean functions and compute the above-mentioned three operations. This work paves the way for efficient solvers for particular classes of logic programs e.g., static program analyses, which leverage BDD technologies to factorise similarities in the solution space.
Fichier principal
Vignette du fichier
PI-1939.pdf (296.42 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00433820 , version 1 (20-11-2009)
inria-00433820 , version 2 (24-11-2009)

Identifiants

  • HAL Id : inria-00433820 , version 2

Citer

Frédéric Besson, Thomas Jensen, Tiphaine Turpin. Computing the Least Fix-point Semantics of Definite Logic Programs Using BDDs. [Research Report] PI 1939, 2009, pp.25. ⟨inria-00433820v2⟩
214 Consultations
136 Téléchargements

Partager

Gmail Facebook X LinkedIn More