Using artificial neural networks for con
β
IliΓ© Popescu
π
Article
π
1997
π
Elsevier Science
π
English
β 471 KB
We address the problem of solving a constraint satisfaction problem (CSP) by treating a constraint logic program (CLP) as a network of constraints. We attempt to show that each computation in a CLP becomes a sequence of linear steps, since the check satisfiability of the system of constraints is app