Decomposition and tractability in qualitative spatial and temporal reasoning
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
|Collections||ANU Research Publications|
|01_Huang_Decomposition_and_tractability_2012.pdf||1.2 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.