Skip navigation
Skip navigation

A divide-and-conquer approach for solving interval algebra networks

Li, Jason; Huang, Jinbo; Renz, Jochen

Description

Deciding consistency of constraint networks is a fundamental problem in qualitative spatial and temporal reasoning. In this paper we introduce a divide-and-conquer method that recursively partitions a given problem into smaller sub-problems in deciding consistency. We identify a key theoretical property of a qualitative calculus that ensures the soundness and completeness of this method, and show that it is satisfied by the Interval Algebra (IA) and the Point Algebra (PA). We develop a new...[Show more]

CollectionsANU Research Publications
Date published: 2009
Type: Conference paper
URI: http://hdl.handle.net/1885/57552
Source: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2009)

Download

File Description SizeFormat Image
01_Li_A_divide-and-conquer_approach_2009.pdf194.65 kBAdobe PDF    Request a copy
02_Li_A_divide-and-conquer_approach_2009.pdf43.9 kBAdobe PDF    Request a copy
03_Li_A_divide-and-conquer_approach_2009.pdf201.18 kBAdobe PDF    Request a copy
04_Li_A_divide-and-conquer_approach_2009.pdf47.88 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator