A secure non-monotonic soft concurrent constraint language

DOI10.3233/FI-2014-1102zbMATH Open1315.68037OpenAlexW1185784861MaRDI QIDQ5259265FDOQ5259265

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

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

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)

Cited In (6)

• Title not available (Why is that?)
• Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming
• Title not available (Why is that?)
• 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)