Subexponential concurrent constraint programming

Pimentel, Elaine Gouvea; Nigam, Vivek; Vega, Carlos Alberto Olarte

Subexponential concurrent constraint programming

Página do item simplificado Estatísticas

dc.contributor.author	Pimentel, Elaine Gouvea
dc.contributor.author	Nigam, Vivek
dc.contributor.author	Vega, Carlos Alberto Olarte
dc.date.accessioned	2020-08-03T19:51:41Z
dc.date.available	2020-08-03T19:51:41Z
dc.date.issued	2015
dc.description.resumo	In previous works we have shown that linear logic with subexponentials (SELL), a refinement of linear logic, can be used to specify emergent features of concurrent constraint programming (CCP) languages, such as preferences and spatial, epistemic and temporal modalities. In order to do so, we introduced a number of extensions to SELL, such as subexponential quantifiers for the specification of modalities, and more elaborated subexponential structures for the specification of preferences. These results provided clear proof theoretic foundations to existing systems. This paper goes in the opposite direction, answering positively the question: can the proof theory of linear logic with subexponentials contribute to the development of new CCP languages? We propose a CCP language with the following powerful features: 1) computational spaces where agents can tell and ask preferences (soft-constraints); 2) systems where spatial and temporal modalities can be combined; 3) shared spaces for communication that can be dynamically established; and 4) systems that can dynamically create nested spaces. In order to provide the proof theoretic foundations for such a language, we propose a unified logical framework (SELLS) combining the extensions of linear logic with subexponentials mentioned above, and showing that this new framework has interesting proof theoretical properties such as cut-elimination and a sound and complete focused proof system	pt_BR
dc.identifier.citation	OLARTE, Carlos; PIMENTEL, Elaine; NIGAM, Vivek. Subexponential concurrent constraint programming. Theoretical Computer Science, [s.l.], v. 606, p. 98-120, nov. 2015.. Disponível em: https://www.sciencedirect.com/science/article/pii/S0304397515005411?via%3Dihub. Acesso em: 30 jul. 2020. https://doi.org/10.1016/j.tcs.2015.06.031	pt_BR
dc.identifier.doi	10.1016/j.tcs.2015.06.031
dc.identifier.issn	0304-3975
dc.identifier.uri	https://repositorio.ufrn.br/jspui/handle/123456789/29776
dc.language	en	pt_BR
dc.publisher	Elsevier	pt_BR
dc.subject	Linear logic	pt_BR
dc.subject	Concurrent constraint programming	pt_BR
dc.subject	Proof systems	pt_BR
dc.title	Subexponential concurrent constraint programming	pt_BR
dc.type	article	pt_BR