A Proof Theoretic Study of Soft Concurrent Constraint Programming

DOI10.1017/S147106841400026XzbMath1309.68034arXiv1405.2329WikidataQ57850758 ScholiaQ57850758MaRDI QIDQ2931271

Vivek Nigam, Elaine Pimentel, Carlos Olarte

Publication date: 25 November 2014

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2329

zbMATH Keywords

linear logicconcurrent constraint programmingsoft constraints

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37) Logic in computer science (03B70) Logic programming (68N17)

Related Items

A proof theoretic view of spatial and temporal dependencies in biochemical systems, On subexponentials, focusing and modalities in concurrent systems, Subexponential concurrent constraint programming, Hybrid and subexponential linear logics, Hybrid linear logic, revisited

Cites Work

• Unnamed Item
• Linear logic
• Nondeterminism and infinite computations in constraint programming
• Timed default concurrent constraint programming
• Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison
• A timed concurrent constraint language.
• Linear concurrent constraint programming: Operational and phase semantics
• Models and emerging trends of concurrent constraint programming
• A logic of soft constraints based on partially ordered preferences
• Logic Programming with Focusing Proofs in Linear Logic
• Semiring-based constraint satisfaction and optimization
• Soft concurrent constraint programming