Download:
by Peter B. Ladkin, Technische Fakultat, Alexander Reinefeld
Annals of Mathematics and Artificial Intelligence
http://www.zib.de/reinefeld/bib/97annals.pdf
Add To MetaCart
Abstract:
We describe an effective generic method for solving constraint problems, based on Tarski's relation algebra, using path-consistency as a pruning technique. Weinvestigate the performance of this method on interval constraint problems. Time performance is affected strongly by the path-consistency calculations, whichinvolve the calculation of compositions of relations. Weinvestigate various methods of tuning composition calculations, and also path-consistency computations. Space performance is affected by the branching factor during search. Reducing this branching factor depends on the existence of `nice ' subclasses of the constraint domain. Finally,wesurvey the statistics of consistency properties of interval constraint problems. Problems of up to 500 variables maybesolved in expected cubic time. Evidence is presented that the `phase transition' occurs in the range 6 n:c 15, where n is the numberofvariables, and c is the ratio of non-trivial constraints to possible constraints. 1
Citations
|
1705
|
Maintaining knowledge about temporal intervals
– Allen
- 1983
|
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
739
|
Constraint Networks
– Dechter
- 1992
|
|
468
|
Where the really hard problems are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
354
|
Networks of constraints: Fundamental properties and applications to picture processing
– Montanari
- 1974
|
|
260
|
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems
– Mackworth, Freuder
- 1985
|
|
243
|
Constraint Satisfaction
– Mackworth
- 1987
|
|
160
|
A course in universal algebra
– Burris, Sankappanavar
- 1981
|
|
121
|
Reasoning about temporal relations: a maximal tractable subclasses of Allen’s Interval Algebra
– Nebel, Burckert
- 1994
|
|
107
|
Integrating Metric and Qualitative Temporal Reasoning
– Kautz, Ladkin
- 1991
|
|
88
|
Spatial reasoning with propositional logics
– Bennett
- 1994
|
|
68
|
On binary constraint problems
– Ladkin, Maddux
- 1994
|
|
44
|
Taxonomies of logically defined qualitative spatial relations. International journal of human-computer studies
– Cohn, Randell, et al.
- 1995
|
|
42
|
Computing transitivity tables: A challenge for automated theorem provers
– RANDELL, COHN, et al.
- 1992
|
|
40
|
Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class
– Nebel
- 1997
|
|
39
|
On binary constraint networks
– Ladkin, Maddux
- 1988
|
|
30
|
The timelogic temporal reasoning system
– Koomen
- 1989
|
|
25
|
Temporally distributed symptoms in Technical Diagnosis
– Nokel
- 1991
|
|
17
|
Localizing Temporal Constraint Propagation
– Koomen
- 1989
|
|
12
|
Boolean algebras with operators II
– Jónsson, Tarski
- 1952
|
|
12
|
TPLAN: A Temporal Interval-Based Planner with Novel Extensions
– Hogge
- 1987
|
|
11
|
A Symbolic Approach to Interval Constraint Problems
– Ladkin, Reinefeld
- 1993
|
|
9
|
Ladkin and Alexander Reinefeld. Effective solution of qualitative interval constraint problems
– Peter
- 1992
|
|
7
|
Constraint reasoning with intervals: A tutorial, survey, and bibliography
– Ladkin
- 1990
|
|
5
|
CONSAT: A System for Constraint Satisfaction
– Gusgen
- 1989
|
|
5
|
Relation algebras for reasoning about time and space
– Maddux
- 1993
|
|
2
|
A symbolic approachtointerval constraint problems
– Ladkin, Reinefeld
- 1993
|
|
1
|
Ladkin and Alexander Reinefeld. E#ective solution of qualitativeinterval constraint problems
– B
- 1992
|
|
1
|
Nebel and Hans-J#urgen B#urckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's Interval Algebra
– Bernhard
- 1995
|
|
1
|
Temporally DistributedSymptomsinTechnical Diagnosis,volume 517
– Nokel
- 1991
|
|
1
|
Computing transitivitytables: achallenge for automated theorem provers
– Randell, Cohn, et al.
|
