Constraint Satisfaction in Distributed Concurrent Logic Programming
In constraint logic programming, unification is replaced by more general constraint satisfaction. To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the ‘ask’-constraints with respect to the current c...
Saved in:
| Published in: | Journal of symbolic computation Vol. 21; no. 4; pp. 699 - 714 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.04.1996
|
| ISSN: | 0747-7171, 1095-855X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!