Timed soft concurrent constraint programs: an interleaved and a parallel approach

DOI10.1017/S1471068414000106MaRDI QIDQ4593013zbMATH OpenFDO

Authors Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo, Francesco Santini

Publication date 9 November 2017

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

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

zbMATH Keywords

interleavingparallelismsoft concurrent constraint programmingtimed concurrent constraint programming

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Abstract: We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded period of time and is measured by a discrete global clock. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tell and ask agents are now equipped with a preference (or consistency) threshold which is used to determine their success or suspension. In the paper we provide a language to describe the agents behavior, together with its operational and denotational semantics, for which we also prove the compositionality and correctness properties. After presenting a semantics using maximal parallelism of actions, we also describe a version for their interleaving on a single processor (with maximal parallelism for time elapsing). Coordinating agents that need to take decisions both on preference values and time events may benefit from this language. To appear in Theory and Practice of Logic Programming (TPLP).

Recommendations

• A timed concurrent constraint language.
• Soft concurrent constraint programming
• Lectures on Concurrency and Petri Nets
• Logic Programming
• scientific article; zbMATH DE number 2087537

Cites work

• A timed concurrent constraint language.
• Coordination models and languages. 10th international conference, COORDINATION 2008, Oslo, Norway, June 4--6, 2008. Proceedings
• Formal and natural computing. Essays dedicated to Grzegorz Rozenberg
• scientific article; zbMATH DE number 1638652 (Why is no real title available?)
• scientific article; zbMATH DE number 1696890 (Why is no real title available?)
• scientific article; zbMATH DE number 6017835 (Why is no real title available?)
• scientific article; zbMATH DE number 2084713 (Why is no real title available?)
• scientific article; zbMATH DE number 2182596 (Why is no real title available?)
• Logic Programming
• Semiring-based constraint satisfaction and optimization
• Semirings for constraint solving and programming.
• Soft concurrent constraint programming
• Statecharts: a visual formalism for complex systems
• Temporary and permanent buyout prices in online auctions
• The Esterel synchronous programming language: Design, semantics, implementation
• Timed default concurrent constraint programming

Cited in

(5)

• Models and emerging trends of concurrent constraint programming
• Observational and behavioural equivalences for soft concurrent constraint programming
• Semiring-Based Soft Constraints
• scientific article; zbMATH DE number 2087537 (Why is no real title available?)
• Soft concurrent constraint programming

Describes a project that uses

Uses Software

• LUSTRE
• KLAIM
• Esterel

This page was built for publication: Timed soft concurrent constraint programs: an interleaved and a parallel approach

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