An Interactive Semantics of Logic Programming Ugo Montanari, Università di Pisa, Italie Abstract:
We apply to logic programming some recently emerging ideas
from the field of reduction-based communicating
systems, with the aim of giving evidence of the hidden interactions
and the coordination mechanisms that rule the operational machinery
of such a programming paradigm.
The semantic framework we have chosen for presenting our
results is tile logic, which has the advantage of allowing a
uniform treatment of goals and observations and of applying abstract
categorical tools for proving the results. As main contributions, we
mention the finitary presentation of abstract unification, and a
concurrent and coordinated abstract semantics consistent with the
most common semantics of logic programming. Moreover, the
compositionality of the tile semantics is guaranteed by standard
results, as it reduces to check that the tile systems associated to
logic programs enjoy the tile decomposition property. Alain Colmerauer, Université de Marseille, France Résumé : La réduction des intervalles, servant de domaines aux variables d'une contrainte de multiplication, se révèle un exercice pénible. Lorsque ces intervalles peuvent être ouverts et non-bornés ou, lorsque l'ensemble de leurs bornes événtuelles est astreint à être un sous-ensemble fini des réels, l'exercice devient particulièrement ardu. Il est alors nécessaire de faire appel à quatre propriétés qui feront l'objet de l'exposé.
|
© INRIA (pour toute question ou suggestion sur le site écrire à A. ED-DBALI) |