Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Decomposition and tractability in qualitative spatial and temporal reasoning

Date

Authors

Huang, Jinbo

Li, Jingshi (Jason)

Renz, Jochen

Publisher

Elsevier

Abstract

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

Keywords

Keywords: Bench-mark problems; Constraint networks; Network consistencies; Network structures; Qualitative spatial and temporal reasoning; SAT; Theory and practice; Tree-width; Algorithms; Biomineralization; Decomposition; Encoding (symbols); Polynomial approximati Decomposition; Qualitative spatial and temporal reasoning; SAT; Treewidth

URI

http://hdl.handle.net/1885/28137

Collections

ANU Research Publications

Source

Artificial Intelligence

Type

Journal article

DOI

10.1016/j.artint.2012.09.009

Restricted until

2037-12-31

Downloads

File

Description

01_Huang_Decomposition_and_tractability_2012.pdf (1.17 MB)