|
|
|
|
|
|
Help | Seminars List | Add Seminar | Edit Seminars | Tips for organisers | RSS | ics Calendar | Search | Send comments about this website to seminar-master@cecs.anu.edu.au
Contact: Michelle.Moravec@anu.edu.au CS PHD MONITORING
A Divide-and-Conquer Approach for Solving Interval Algebra NetworksMr Jason Li (School of Computer Science, CECS)DATE: 2009-09-25 TIME: 10:00:00 - 10:30:00 LOCATION: RSISE Seminar Room, ground floor, building 115, cnr. North and Daley Roads, ANU ABSTRACT: 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 encoding scheme for IA networks based on a combination of our divide-and-conquer method with an existing encoding of IA networks into SAT. We empirically show that our new encoding scheme scales to much larger problems and exhibits a consistent and significant improvement in efficiency over state-of-the-art solvers on the most difficult instances.
|