Constraint satisfaction in distributed concurrent logic programming (Q2365137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 968659
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Constraint satisfaction in distributed concurrent logic programming |
scientific article; zbMATH DE number 968659 |
Statements
Constraint satisfaction in distributed concurrent logic programming (English)
0 references
22 January 1997
0 references
The authors consider the algorithms for distributed constraint satisfaction problem in the framework of real numbers and Boolean rings. For this a prototype distributed concurrent constraints logic programming language D/C-Parlog is used. ln case of the network consisting, of one node the presented algorithms reduce to existing centralised constraint satisfaction algorithms, such as in \(\text{CLP}(R)\) and CHIP. The paper contains also implementation issues.
0 references
distributed concurrent constraints logic programming
0 references
D/C-Parlog
0 references
0.8051213026046753
0 references
0.7854298949241638
0 references
0.7843397855758667
0 references
