R. Bruni, U. Montanari, F. Rossi, An interactive semantics of logic programming, Theory and Practice of Logic Programming. 1 (6) (2001) 647-- 690.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....A detailed case study shows that the straightforward application of the general framework to basic parallel processes yields a concurrent operational semantics whose 19 observations exactly characterize the ordinary causal weak bisimilarity based on Darondeau and Degano s causal trees. In [BMR01] Tile Logic is applied to Logic Programming by exploiting a nitary presentation of uni cation as pullback to de ne the coordination rules between goals and concurrent refutations. The result is the view of Logic Programming as an interactive system, equipped with concurrent and coordinated ....

R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. Theory and Practice of Logic Programming, 1(6):647-690, 2001.

No context found.

R. Bruni, U. Montanari, F. Rossi, An interactive semantics of logic programming, Theory and Practice of Logic Programming. 1 (6) (2001) 647-- 690.

No context found.

R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. Theory and Practice of Logic Programming, 1(6):647--690, 2001.

No context found.

R. Bruni, U. Montanari, F. Rossi, An interactive semantics of logic programming, Theory and Practice of Logic Programming. 1 (6) (2001) 647-- 690.

.... ) These compositions are called diagonal and yield two monoidal categories. Though the direction of the arrows in Figure 1 follows the intuitive way of composing states (from left to right) and computations (from top to down) opposites categories can be as well considered, as done e.g. in [10, 11], when this is convenient to model certain operational features, and this impacts in reversing the direction of arrows either in one dimension or in both. tl extends the ordinary observational equivalences such as trace semantics and bisimilarity by taking htrigger; e ecti pairs as labels, ....

Bruni, R., U. Montanari and F. Rossi, An interactive semantics of logic programming, Theory and Practice of Logic Prog. 1(6) (2001), pp. 647-690. 20 Bruni et al.

....#) These compositions are called diagonal and yield two monoidal categories. Though the direction of the arrows in Figure 1 follows the intuitive way of composing states (from left to right) and computations (from top to down) opposites categories can be as well considered, as done e.g. in [10, 11], when this is convenient to model certain operational features, and this impacts in reversing the direction of arrows either in one dimension or in both. tl extends the ordinary observational equivalences such as trace semantics and bisimilarity by taking #trigger, pairs as labels, favoring ....

Bruni, R., U. Montanari and F. Rossi, An interactive semantics of logic programming, Theory and Practice of Logic Prog. 1(6) (2001), pp. 647--690.

....on TL, CTS and CS can be easily translated in our framework, the use of spatial formulae makes our approach applicable to a wider class of calculi. The idea of using unification for building formulae comes from Logic Programming and more precisely by its view as an interactive system presented in [7]. 1 Notation To ease the presentation we consider one sorted signatures, but our results easily extend to the many sorted case. A signature is a set of operators S together with an arity function ar : S . For n , we let S f S ar . We denote by S X the term algebra ....

R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. Theory and Practice of Logic Programming, 1(6):647--690, 2001.

....closed and open terms and favoring the application of coalgebraic techniques [17] The second approach consists of finding a minimal class of instantiations (not necessarily ground) under which to close the open terms. An application of this technique to logic programming has been considered in [13] offering some preliminary results on its possible generalization and integration with the contextualization problem (to some extent, instantiations can be viewed as internal contextualizations) In particular, the application to logic programming is illustrative because unification employs ....

....this work can be better understood as part of a larger research that aims at the uniform integration inside the tile framework of several concepts of general interest. In this perspective, there is a series of recent works that have tight connection with the dynamic closure presented here [42, 30, 4, 13]. The papers [42, 30] concern the characterization of a minimal set of contexts with respect to which the bisimilarity on ground terms should be closed so to get a congruence, with the goal of keeping the transition system finitely branching. The results in [13] offer, to some extent, the ....

[Article contains additional citation context not shown here]

R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming, 2000. Submitted.

No context found.

R. Bruni, U. Montanari, and F. Rossi. An interactive semantics of logic programming. Theory and Practice of Logic Programming, 1(6):647-690, 2001.

No context found.

Roberto Bruni, Ugo Montanari, and Francesca Rossi. An interactive semantics of logic programming. Manuscript, Dipartimento di Informatica, Universit`a di Pisa, submitted for publication, 2000. 20

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC