𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Using Constraint Satisfaction for View Update

✍ Scribed by Hua Shu


Book ID
110266851
Publisher
Springer US
Year
2000
Tongue
English
Weight
152 KB
Volume
15
Category
Article
ISSN
0925-9902

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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

Geometric constraint satisfaction using
✍ Jian-Xin Ge; Shang-Ching Chou; Xiao-Shan Gao πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 337 KB

The numerical approach to solving geometric constraint problems is indispensable for building a practical CAD system. The most commonly-used numerical method is the Newton-Raphson method. It is fast, but has the instability problem: the method requires good initial values. To overcome this problem,