Name
Abstract | ||
|---|---|---|
In this paper we propose a novel computational model for constraint logic programming (CLP)languages. The model provides an efficient mechanism for executing CLP programs by exploitingconstraint satisfaction as a means for both solving constraints and controlling the whole computation.In the model, we separate constraint solving from the deduction procedure. Deductions over constraintsare extracted from the source program and represented as a context-free grammar that encodes the wayin... |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/978-1-4471-3546-3_4 | ALPUK |
Keywords | Field | DocType |
computer model,context free grammar | Constraint satisfaction,Mathematical optimization,Computer science,Constraint programming,Constraint graph,Theoretical computer science,Concurrent constraint logic programming,Logic programming,Constraint logic programming,Binary constraint,Hybrid algorithm (constraint satisfaction) | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John Darlington | 1 | 191 | 27.97 |
| Yike Guo | 2 | 1319 | 165.32 |
| Qian Wu | 3 | 15 | 4.38 |