A proof theoretic study of soft concurrent constraint programming

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

A proof theoretic study of soft 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-03T20:35:07Z
dc.date.available	2020-08-03T20:35:07Z
dc.date.issued	2014
dc.description.resumo	Concurrent Constraint Programming (CCP) is a simple and powerful model for concurrency where agents interact by telling and asking constraints. Since their inception, CCP-languages have been designed for having a strong connection to logic. In fact, the underlying constraint system can be built from a suitable fragment of intuitionistic (linear) logic -ILL- and processes can be interpreted as formulas in ILL. Constraints as ILL formulas fail to represent accurately situations where “preferences” (called soft constraints) such as probabilities, uncertainty or fuzziness are present. In order to circumvent this problem, c-semirings have been proposed as algebraic structures for defining constraint systems where agents are allowed to tell and ask soft constraints. Nevertheless, in this case, the tight connection to logic and proof theory is lost. In this work, we give a proof theoretical meaning to soft constraints: they can be defined as formulas in a suitable fragment of ILL with subexponentials (SELL) where subexponentials, ordered in a c-semiring structure, are interpreted as preferences. We hence achieve two goals: (1) obtain a CCP language where agents can tell and ask soft constraints and (2) prove that the language in (1) has a strong connection with logic. Hence we keep a declarative reading of processes as formulas while providing a logical framework for soft-CCP based systems. An interesting side effect of (1) is that one is also able to handle probabilities (and other modalities) in SELL, by restricting the use of the promotion rule for non-idempotent c-semirings.This finer way of controlling subexponentials allows for considering more interesting spaces and restrictions, and it opens the possibility of specifying more challenging computational systems	pt_BR
dc.identifier.citation	PIMENTEL, Elaine; OLARTE, Carlos; NIGAM, Vivek. A Proof theoretic study of soft concurrent constraint programming. Theory and Practice of Logic Programming, [S.L.], v. 14, n. 4-5, p. 649-663, jul. 2014. Cambridge University Press (CUP). Disponível em: https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/proof-theoretic-study-of-soft-concurrent-constraint-programming/6F8DFEC730643E6682E8F549AC99927D. Acesso em: 30 jul. 2020. http://dx.doi.org/10.1017/s147106841400026x	pt_BR
dc.identifier.doi	10.1017/S147106841400026X
dc.identifier.issn	1471-0684
dc.identifier.uri	https://repositorio.ufrn.br/jspui/handle/123456789/29779
dc.language	en	pt_BR
dc.publisher	Cambridge University Press	pt_BR
dc.subject	Concurrent Constraint Programming	pt_BR
dc.subject	Linear Logic	pt_BR
dc.subject	Soft Constraints	pt_BR
dc.title	A proof theoretic study of soft concurrent constraint programming	pt_BR
dc.type	article	pt_BR