A secure non-monotonic soft concurrent constraint language

DOI10.3233/FI-2014-1102MaRDI QIDQ5259265zbMATH OpenOpenAlexFDO

Authors Stefano Bistarelli, Francesco Santini

Publication date 26 June 2015

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2014-1102

Mathematics Subject Classification ID

Theory of programming languages (68N15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• A proof theoretic study of soft concurrent constraint programming
• Dynamic spaces in concurrent constraint programming
• Soft concurrent constraint programming
• scientific article; zbMATH DE number 2087537
• Observational and behavioural equivalences for soft concurrent constraint programming

Cited in

(8)

• scientific article; zbMATH DE number 6017835 (Why is no real title available?)
• Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
• Soft concurrent constraint programming
• Probabilistic confinement in a declarative framework
• scientific article; zbMATH DE number 2087537 (Why is no real title available?)
• Belief, knowledge, lies and other utterances in an algebra for space and extrusion
• Observational and behavioural equivalences for soft concurrent constraint programming
• Semiring-Based Soft Constraints

This page was built for publication: A secure non-monotonic soft concurrent constraint language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259265)