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

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 that...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 15; no. 6; pp. 743 - 782
Main Authors: BISTARELLI, STEFANO, GABBRIELLI, MAURIZIO, MEO, MARIA CHIARA, SANTINI, FRANCESCO
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.11.2015
Subjects:
Clocks
Consistency
Crisps
Logic programming
Markers
Microprocessors
Programming
Regular Papers
Semantics
Timed Concurrent Constraint Programming
Soft Concurrent Constraint Programming
parallelism
interleaving
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 that 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 this 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 on both preference values and time events may benefit from this language.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1471-0684
1475-3081
DOI:10.1017/S1471068414000106