Logic Programming Revisited

Christophe Fouqueré (1) , Virgile Mogbil (1)

1 LIPN - Laboratoire d'Informatique de Paris-Nord

The so famous Prolog paradigm is based on the refutation of a goal, i.e. inferring the empty clause by means of the resolution principle. Switching to sequent calculus, this reduces to a cut-free proof search of the empty formula using the program clauses and the negation of the goal as hypotheses. It has already been applied to full Linear Logic. In this survey, we switch from sequent calculus to graph computation by means of bipolar modules. We explain in which extent the use of such structures in the framework of Linear Logic helps to enlarge logic programming towards a distributed backward and forward computation paradigm.

Mots clés: linear logic; proof-nets; logic programming; focalization; proof search; parallel execution

Domaines: Logique en informatique [cs.LO]; Calcul parallèle, distribué et partagé [cs.DC]; Logique [math.LO]

Christophe Fouqueré, Virgile Mogbil. Logic Programming Revisited. 2011. ⟨hal-00198805v2⟩