A proof theoretic study of soft concurrent constraint programming
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...
Autor principal: | |
---|---|
Outros Autores: | , |
Formato: | article |
Idioma: | eng |
Publicado em: |
2020
|
Assuntos: | |
Texto completo: | https://doi.org/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 https://doi.org/10.1017/S147106841400026X |
País: | Brasil |
Oai: | oai:https://repositorio.ufrn.br:123456789/29779 |
Texto Completo
https://doi.org/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/s147106841400026xhttps://doi.org/10.1017/S147106841400026X