Dynamic Spaces in Concurrent Constraint Programming
TL;DR: This paper explores the use of existential (@?) and universal (@?) quantification over subexponentials in SELL^@? in order to endow CCP with the ability to communicate location (space) names and argues that the new CCP language can be used in the specification of service oriented computing systems.
read more
About: This article is published in Electronic Notes in Theoretical Computer Science. The article was published on 01 Jul 2014. and is currently open access. The article focuses on the topics: Constraint programming & Concurrency.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic
Stefan Haar,Salim Perchy,Camilo Rueda,Frank D. Valencia +3 more
- 14 Jul 2015
TL;DR: Spatial constraint systems with extrusion are enriched with operators to specify information and processes moving from a space to another, providing for process/information extrusion, a central concept in formalisms for mobile communication.
Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion
TL;DR: The theory of spatial constraint systems with operators to specify information and processes moving from a space to another and it is shown that spatial constraint can also express the epistemic notion of knowledge by means of a derived spatial operator that specifies global information.
27
On subexponentials, focusing and modalities in concurrent systems
TL;DR: It is shown that the view of subexponentials as specific modalities is general enough to give a modular encoding of different flavors of Concurrent Constraint Programming (CCP), a simple and powerful model of concurrency.
18
A Proof Theoretic Study of Soft Concurrent Constraint Programming
TL;DR: In this paper, the authors give a proof theoretical interpretation to soft constraints: they can be defined as formulas in a suitable fragment of ILL with subexponentials (SELL) where subexponsentials, ordered in a c-semiring structure, are interpreted as preferences.
2
Local Spaces in Soft Concurrent Constraint Programming Oriented to Security
Stefano Bistarelli,Francesco Santini +1 more
1
References
A calculus of mobile processes, II
TL;DR: The a-calculus is presented, a calculus of communicating systems in which one can naturally express processes which have changing structure, including the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions.
3.4K
Linear logic
TL;DR: This column presents an intuitive overview of linear logic, some recent theoretical results, and summarizes several applications oflinear logic to computer science.
2.6K
Logic programming in a fragment of intuitionistic linear logic
J.S. Hodas,Dale Miller +1 more
- 15 Jul 1991
TL;DR: The intuitionistic notion of context is refined by using a fragment of J.-Y.
•Book
Semantic foundations of concurrent constraint programming
Vijay Saraswat,Martin Rinard,Prakash Panangaden +2 more
- 01 Mar 1995
385