A confluent calculus for concurrent constraint programming with guarded choice | Zendy

Kim Marriott | Zendy; Martin Odersky | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A confluent calculus for concurrent constraint programming with guarded choice

Author(s) -

Kim Marriott,

Martin Odersky

Publication year - 1995

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-60299-2

DOI - 10.1007/3-540-60299-2_19

Subject(s) - computer science , confluence , constraint (computer aided design) , constraint programming , operational semantics , programming language , concurrency , constraint satisfaction , concurrent constraint logic programming , semantics (computer science) , operator (biology) , domain (mathematical analysis) , process calculus , scheduling (production processes) , constraint satisfaction problem , property (philosophy) , constraint logic programming , theoretical computer science , algorithm , mathematical optimization , mathematics , artificial intelligence , philosophy , repressor , mathematical analysis , chemistry , biochemistry , geometry , epistemology , stochastic programming , transcription factor , probabilistic logic , gene

. Confluence is an important and desirable property as it allowsthe program to be understood by considering any desired schedulingrule, rather than having to consider all possible schedulings. Unfortunately,the usual operational semantics for concurrent constraint programs isnot confluent as different process schedulings give rise to different sets ofpossible outcomes. We show that it is possible to give a natural confluentcalculus for concurrent constraint programs, if the syntactic...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research