Skip navigation
Skip navigation

Decomposition and tractability in qualitative spatial and temporal reasoning

Huang, Jinbo; Li, Jingshi (Jason); Renz, Jochen


Constraint networks in qualitative spatial and temporal reasoning (QSTR) typically feature variables defined on infinite domains. Mainstream algorithms for deciding network consistency are based on searching for network refinements whose consistency is kn

CollectionsANU Research Publications
Date published: 2012
Type: Journal article
Source: Artificial Intelligence
DOI: 10.1016/j.artint.2012.09.009


File Description SizeFormat Image
01_Huang_Decomposition_and_tractability_2012.pdf1.2 MBAdobe PDF    Request a copy

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

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator