by Jochen Renz, Bernhard Nebel
In Proceedings of the 13th European Conference on Arti Intelligence
http://www.cs.washington.edu/research/jair/volume15/renz01a.ps
Add To MetaCart
Abstract:
The theoretical properties of qualitative spatial reasoning in the RCC-8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the adaption of the algorithms used for qualitative temporal reasoning can solve large RCC-8 instances, even if they are in the phase transition region { provided that one uses the maximal tractable subsets of RCC-8 that have been identied by us. In particular, we demonstrate that the orthogonal combination of heuristic methods is successful in solving almost all apparently hard instances in the phase transition region up to a certain size in reasonable time. 1.
Citations
|
1705
|
Maintaining knowledge about temporal intervals
– Allen
- 1983
|
|
877
|
Consistency in networks of relations
– Mackworth
- 1977
|
|
468
|
Where the really hard problems are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
368
|
A spatial logic based on regions and connection
– Randell, Cui, et al.
- 1992
|
|
354
|
Networks of constraints: Fundamental properties and applications to picture processing
– Montanari
- 1974
|
|
260
|
The complexity of some polynomial networkconsistency algorithms for constraint-satisfaction problems
– Mackworth, Freuder
- 1985
|
|
101
|
The constrainedness of search
– Gent, MacIntyre, et al.
- 1979
|
|
88
|
Spatial reasoning with propositional logics
– Bennett
- 1994
|
|
87
|
On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus
– Renz, Nebel
- 1999
|
|
76
|
Complexity and algorithms for reasoning about time: a graphic-theoretic approach
– Golumbic, Shamir
- 1993
|
|
65
|
Topological inference
– Grigni, Papadias, et al.
- 1995
|
|
63
|
An economics approach to hard computational problems
– Huberman, Lukose, et al.
|
|
54
|
Random constraint satisfaction: flaws and structure
– Gent, MacIntyre, et al.
|
|
44
|
A new method for solving hard satis ability problems
– Selman, Levesque, et al.
- 1992
|
|
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
|
|
38
|
Effective Solution of Qualitative Interval Constraint Problems
– Ladkin, Reinefeld
- 1992
|
|
37
|
Computational properties of qualitative spatial reasoning: First results
– Nebel
- 1995
|
|
31
|
The Design and Experimental Analysis of Algorithms for Temporal Reasoning
– Beek, Manchak
- 1996
|
|
25
|
Logical Representations for Automated Reasoning about Spatial Relationships
– Bennett
- 1997
|
|
25
|
Maximal tractable fragments of the region connection calculus: A complete analysis
– Renz
- 1999
|
|
16
|
Fast algebraic methods for interval constraint problems
– Ladkin, Reinefeld
- 1997
|
|
14
|
Spatial reasoning with topological information
– Renz
- 1998
|
|
1
|
Efficient Methods for Qualitative Spatial Reasoning
– Haralick
- 1980
|
