Name
Abstract | ||
|---|---|---|
We present a fast algorithm for solving qualitative interval constraint problems, which returns solutions of random problems in less than half a second on average, with the hardest problem taking only half a minute on a RISC workstation. This is a surprising result considering the problem is NP-complete. The fast solution time is attributed to the extraordinary pruning power of the path-consistency computation, and to the fact that all our randomly generated interval networks of size greater-than-or-equal-to 14 were found to be inconsistent, which is rapidly detected by a path-consistency computation. While inconsistency is relatively easy to prove, our algorithm also solves large consistent networks with 100 edges. We conclude that our algorithm suffices for solving qualitative interval constraint problems in practice. Other conclusions are that pathconsistency reduces the solution search to an almost linear selection of atomic labels and that path-consistency is by itself an excellent consistency heuristic for random networks with fewer than 6 or more than 15 nodes. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0004-3702(92)90106-8 | Artif. Intell. |
Keywords | Field | DocType |
effective solution,qualitative interval constraint problem | NP-complete,Heuristic,Interval graph,Workstation,Algorithm,Interval arithmetic,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
57 | 1 | 0004-3702 |
Citations | PageRank | References |
71 | 4.46 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter B. Ladkin | 1 | 626 | 90.51 |
| Alexander Reinefeld | 2 | 889 | 126.08 |