Concurrent constraint logic programming

Concurrent constraint logic programming is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a concurrent process is therefore programmed as the evaluation of a goal by the interpreter. Constraint handling rules can be seen as a form of concurrent constraint logic programming, but are used for programming a constraint simplifier or solver rather than concurrent processes.

Comment
enConcurrent constraint logic programming is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a concurrent process is therefore programmed as the evaluation of a goal by the interpreter. Constraint handling rules can be seen as a form of concurrent constraint logic programming, but are used for programming a constraint simplifier or solver rather than concurrent processes.
Has abstract
enConcurrent constraint logic programming is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a concurrent process is therefore programmed as the evaluation of a goal by the interpreter. Syntactically, concurrent constraints logic programs are similar to non-concurrent programs, the only exception being that clauses include guards, which are constraints that may block the applicability of the clause under some conditions. Semantically, concurrent constraint logic programming differs from its non-concurrent versions because a goal evaluation is intended to realize a concurrent process rather than finding a solution to a problem. Most notably, this difference affects how the interpreter behaves when more than one clause is applicable: non-concurrent constraint logic programming recursively tries all clauses; concurrent constraint logic programming chooses only one. This is the most evident effect of an intended directionality of the interpreter, which never revise a choice it has previously taken. Other effects of this are the semantical possibility of having a goal that cannot be proved while the whole evaluation does not fail, and a particular way for equating a goal and a clause head. Constraint handling rules can be seen as a form of concurrent constraint logic programming, but are used for programming a constraint simplifier or solver rather than concurrent processes.
Hypernym
Version
Is primary topic of
Concurrent constraint logic programming
Label
enConcurrent constraint logic programming
Link from a Wikipage to an external page
www.informatik.uni-kiel.de/~curry/examples/%23residuation
Link from a Wikipage to another Wikipage
Alice (programming language)
Category:Concurrent computing
Category:Constraint logic programming
Category:Logic programming
Category:Programming paradigms
Concurrent logic programming
Concurrent process
Constraint handling rules
Constraint logic programming
Constraint satisfaction problem
Curry (programming language)
Deadlock
Entailment
Guard (computing)
Interpreter (computing)
Janus (concurrent constraint programming language)
LIFO (computing)
Michael J. Maher
Parallel computing
Recursion
ToonTalk
SameAs
4iBi1
Concurrent constraint logic programming
m.0c420w
Q5159106
Упоредно принудно логичко програмирање
並行制約プログラミング
Subject
Category:Concurrent computing
Category:Constraint logic programming
Category:Logic programming
Category:Programming paradigms
WasDerivedFrom
Concurrent constraint logic programming?oldid=965297810&ns=0
WikiPageLength
10807
Wikipage page ID
4467477
Wikipage revision ID
965297810
WikiPageUsesTemplate
Template:Cite book
Template:Cite journal
Template:ISBN