Paper Info
Title
Partial Order and SOS Semantics for Linear Constraint Programs
Abstract
In this paper we consider linear constraint programming (Icp), a non-monotonic extension of concurrent constraint programming (ccp) which allows to remove information. The entailment relation of a linear constraint system, in terms of which linear constraint programs are defined, is based on the main underlying idea of linear logic: hypotheses in a logical derivation represent physical resources which are consumed, once used in the entailment relation.
Year
DOI
Venue
1997
10.1007/3-540-63383-9_85
COORDINATION
Keywords
Field
DocType
partial order,sos semantics,linear constraint programs,linear logic
Discrete mathematics,Operational semantics,Logical consequence,Computer science,Constraint programming,Theoretical computer science,Concurrent constraint logic programming,Linear programming,Linear logic,Constraint logic programming,Semantics
Conference
ISBN
Citations 
PageRank 
3-540-63383-9
19
0.95
References 
Authors
12
3
Name
Order
Citations
PageRank
Eike Best127456.26
Frank S. de Boer22013159.02
Catuscia Palamidessi32876184.08