Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-29T08:53:09.725Z Has data issue: false hasContentIssue false
  • English
  • Français

An interactive semantics of logic programming

Published online by Cambridge University Press:  16 May 2007

Roberto Bruni ,
Ugo Montanari  and
Francesca Rossi
Roberto Bruni
Affiliation:
Dipartimento di Informatka, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy e-mail: bruni@di.unipi.it, ugo@di.unipi.it
Ugo Montanari
Affiliation:
Dipartimento di Informatka, Università di Pisa, Corso Italia 40, 56125 Pisa, Italy e-mail: bruni@di.unipi.it, ugo@di.unipi.it
Francesca Rossi
Affiliation:
Dipartimento di Matematica Pura ed Applicata, Università di Padova, Via Belzoni, 7, 35131 padovo, Italy email: frossi@math.unipd.it.
Get access Rights & Permissions [Opens in a new window]

Abstract

We apply to logic programming some recently emerging ideas from the field of reductionbased 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. An extension of the approach for handling constraint systems is also discussed.

Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 1 , Issue 6 , November 2001 , pp. 647 - 690
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)