Results 1  10
of
10
An Interactive Semantics of Logic Programming
 THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2001
"... 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 ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
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.
On the expressiveness of linearity vs persistence in the asychronous picalculus
 In Proc. of LICS’06. IEEE Computer Society
, 2006
"... We present an expressiveness study of linearity and persistence of processes. We choose the πcalculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the πcalculus. Each one singles out a natural source of linearity/persistenc ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We present an expressiveness study of linearity and persistence of processes. We choose the πcalculus, one of the main representatives of process calculi, as a framework to conduct our study. We consider four fragments of the πcalculus. Each one singles out a natural source of linearity/persistence also present in other frameworks such as Concurrent Constraint Programming (CCP), Linear CCP, and several calculi for security. The study is presented by providing (or proving the nonexistence of) encodings among the fragments, a processesasformulae interpretation and a reduction from Minsky machines. 1
On the Expressiveness of Coordination via Shared Dataspaces
 Sci. Comput. Program
, 2000
"... A number of dierent coordination models for specifying interprocess communication and synchronisation rely on a notion of shared dataspace. Many of these models are extensions of the Linda coordination model, which includes operations for adding, deleting and testing the presence/absence of data in ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
A number of dierent coordination models for specifying interprocess communication and synchronisation rely on a notion of shared dataspace. Many of these models are extensions of the Linda coordination model, which includes operations for adding, deleting and testing the presence/absence of data in a shared dataspace. We compare the expressive power of three classes of coordination models based on shared dataspaces. The rst class relies on Linda's communication primitives, while a second class relies on the more general notion of multiset rewriting (e.g., like Bauhaus Linda or Gamma). Finally, we consider a third class of models featuring communication transactions that consist of sequences of Lindalike operations to be executed atomically (e.g., like in Shared Prolog or PoliS). 1 Introduction 1.1 Motivations As motivated by the constant expansion of computer networks and illustrated by the development of distributed applications, the design of modern software systems centers o...
Positive and negative preferences
 in CP 2005 workshop on preferences and soft constraints
, 2005
"... Abstract Many reallife problems present both negative and positive preferences. We extend and generalize the existing soft constraints framework to deal with both kinds of preferences. This amounts at adding a new mathematical structure, which has properties different from a semiring, to deal with ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract Many reallife problems present both negative and positive preferences. We extend and generalize the existing soft constraints framework to deal with both kinds of preferences. This amounts at adding a new mathematical structure, which has properties different from a semiring, to deal with positive preferences. Compensation between positive and negative preferences is also allowed. 1
Research Overview and Plans
"... Machine of Berry and Boudol, and the Join calculus of L'evy and his colleagues. Unfortunately, at that time we didn't continue the project because we could not figure out an appropriate "logical meaning" of these extended clauses (which was our original goal). Later on, after Linear Logic became pop ..."
Abstract
 Add to MetaCart
Machine of Berry and Boudol, and the Join calculus of L'evy and his colleagues. Unfortunately, at that time we didn't continue the project because we could not figure out an appropriate "logical meaning" of these extended clauses (which was our original goal). Later on, after Linear Logic became popular, Andreoli and Pareshi have proposed an analogous language (Linear Objects) and have shown that it can be seen as a fragment of Linear Logic.
DESIGN AND IMPLEMENTATION OF A CONCURRENT LOGIC PROGRAMMING LANGUAGE WITH LINEAR LOGIC CONSTRAINTS
"... Prolog is originally rooted in logic with the elegant mapping: “programs = formulas, execution = proof search”. Constraint logic programming extends Prolog to program in a richer structure than mere Herbrand terms. The underlying constraint solving engine requires either to be builtin or to add cor ..."
Abstract
 Add to MetaCart
Prolog is originally rooted in logic with the elegant mapping: “programs = formulas, execution = proof search”. Constraint logic programming extends Prolog to program in a richer structure than mere Herbrand terms. The underlying constraint solving engine requires either to be builtin or to add coroutines mechanisms that are not in the scope
Designing a Nonmonotonic Soft Concurrent Constraint Language for SLA Management
"... Abstract. We present an extension of the Soft Concurrent Constraint language to allow the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of ..."
Abstract
 Add to MetaCart
Abstract. We present an extension of the Soft Concurrent Constraint language to allow the nonmonotonic evolution of the constraint store. To accomplish this, we introduce some new operations: the retract(c) reduces the current store by c, the updateX(c) transactionally relaxes all the constraints of the store that deal with the variables in X set, and then adds a constraint c (usually with support = X); the nask(c) tests if c is not entailed by the store. We present this framework as a possible solution to the management of resources (e.g. web services and network resource allocation) that need a given Quality of Service (QoS). The QoS requirements of all the parties should converge, through a negotiation process, on a formal agreement defined as the Service Level Agreement, which specifies the contract that must be enforced. The main advantage is to have a preference (or cost) measure directly embedded in the language, and to have a highly flexible and parametric abstraction. 1
DOI: 10.1109/LICS.2006.39 On the Expressiveness of Linearity vs Persistence in the Asychronous PiCalculus
"... Several other frameworks using a persistent store can be found in the context of calculi for analyzing and describing security protocols. For instance, Crazzolara and Winskel’s SPL [7], the Spi Calculus variants by Fiore and Abadi [9] and by Amadio et al [1], and the calculus of Boreale and Buscemi ..."
Abstract
 Add to MetaCart
Several other frameworks using a persistent store can be found in the context of calculi for analyzing and describing security protocols. For instance, Crazzolara and Winskel’s SPL [7], the Spi Calculus variants by Fiore and Abadi [9] and by Amadio et al [1], and the calculus of Boreale and Buscemi [4] are all operationally defined in terms of configurations containing items of information (messages) which cannot be consumed during evolution. The idea is that the persistent store models an attacker’s ability to see and remember every message that has been in transit. A legitimate question is whether such persistence restricts the systems that we can specify, model or reason about in the framework. For instance, whether CCP can specify the kind of systems that can be described in Linear CCP. Analogously, in the context of the abovementioned
Models and Emerging Trends of Concurrent Constraint Programming ∗
, 2013
"... Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a ..."
Abstract
 Add to MetaCart
Concurrent Constraint Programming (CCP) has been used over the last two decades as an elegant and expressive model for concurrent systems. It models systems of agents communicating by posting and querying partial information, represented as constraints over the variables of the system. This covers a vast variety of systems as those arising in biological phenomena, reactive systems, netcentric computing and the advent of social networks and cloud computing. In this paper we survey the main applications, developments and current trends of CCP. 1
unknown title
"... Observational equivalences for linear logic concurrent constraint languages� RÉMY HAEMMERLÉ Technical University of Madrid, Madrid, Spain Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard’s l ..."
Abstract
 Add to MetaCart
Observational equivalences for linear logic concurrent constraint languages� RÉMY HAEMMERLÉ Technical University of Madrid, Madrid, Spain Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard’s linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous πcalculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.