Name
Abstract | ||
|---|---|---|
This work presents a constraint solver for the domain of ra- tional trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in polynomial time, the size of the con- straints using a rewriting system before applying a complete algorithm. This rewriting system works essentially by rewriting constraints using the information in a partial model. An ecient C implementation of the rewriting system is described and an algorithm for factoring complex constraints is also presented. |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1007/3-540-57287-2_38 | EPIA '89 |
Keywords | Field | DocType |
rational trees,polynomial time | Data mining,Computer science,Constraint satisfaction problem,Theoretical computer science,Rewriting,Solver,Time complexity,Factoring | Conference |
ISBN | Citations | PageRank |
3-540-57287-2 | 1 | 0.34 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Luís Damas | 1 | 128 | 22.34 |
| Nelma Moreira | 2 | 180 | 33.98 |
| Sabine Broda | 3 | 64 | 13.83 |