Results 1  10
of
753,132
The Linear Logic Semantics of Concurrent Constraint Programs Revisited
"... Building upon previous work on the logical semantics of concurrent constraint programming languages (CC) in linear logic, we show that a new translation of CC expressions by logical formulae makes it possible to characterize both non entailmentclosed properties of CC computations in linear logic, a ..."
Abstract
 Add to MetaCart
Building upon previous work on the logical semantics of concurrent constraint programming languages (CC) in linear logic, we show that a new translation of CC expressions by logical formulae makes it possible to characterize both non entailmentclosed properties of CC computations in linear logic
A Precise Logical Semantics of Concurrent Constraint Programs
"... We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailmentclosed observable properties of CC computations as provable formulae in LL. ..."
Abstract
 Add to MetaCart
We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailmentclosed observable properties of CC computations as provable formulae in LL.
A Precise Logical Semantics of Concurrent Constraint Programs
"... We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailmentclosed observable properties of CC computations as provable formulae in LL. The problem of characterizing non en ..."
Abstract
 Add to MetaCart
We study the relation between Concurrent Constraint Programming languages (CC) and Linear Logic. CC processes have a direct translation into LL formulae which characterizes the entailmentclosed observable properties of CC computations as provable formulae in LL. The problem of characterizing non
Concurrent Constraint Programming
, 1993
"... This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of comput.ing with parhal information, and the concommitant notions of consistency and entailment. ’ In this framework, computation emerges from the interaction of concurrently executing agent ..."
Abstract

Cited by 502 (16 self)
 Add to MetaCart
text of concurrency because of the use of constraints for communication and control, and in the context of AI because of the availability of simple yet powerful mechanisms for controlling inference, and the promise that very rich representational/programming languages, sharing the same set of abstract properties, may
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Constraint Logic Programming: A Survey
"... Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in differe ..."
Abstract

Cited by 864 (25 self)
 Add to MetaCart
Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve
Semantic foundations of concurrent constraint programming
, 1990
"... Concurrent constraint programming [Sar89,SR90] is a simple and powerful model of concurrent computation based on the notions of storeasconstraint and process as information transducer. The storeasvaluation conception of von Neumann computing is replaced by the notion that the store is a constr ..."
Abstract

Cited by 282 (27 self)
 Add to MetaCart
(augment the store with a new constraint). This is a very general paradigm which subsumes (among others) nondeterminate dataflow and the (concurrent) (constraint) logic programming languages. This paper develops the basic ideas involved in giving a coherent semantic account of these languages. Our first
Automatic verification of finitestate concurrent systems using temporal logic specifications
 ACM Transactions on Programming Languages and Systems
, 1986
"... We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent ..."
Abstract

Cited by 1384 (62 self)
 Add to MetaCart
We give an efficient procedure for verifying that a finitestate concurrent system meets a specification expressed in a (propositional, branchingtime) temporal logic. Our algorithm has complexity linear in both the size of the specification and the size of the global state graph for the concurrent
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract

Cited by 1831 (66 self)
 Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
Results 1  10
of
753,132