Paper Info
Title
RCC8 is polynomial on networks of bounded treewidth
Abstract
We construct an homogeneous (and ω-categorical) representation of the relation algebra RCC8, which is one of the fundamental formalisms for spatial reasoning. As a consequence we obtain that the network consistency problem for RCC8 can be solved in polynomial time for networks of bounded treewidth.
Year
DOI
Venue
2011
10.5591/978-1-57735-516-8/IJCAI11-133
IJCAI
Keywords
DocType
Citations 
bounded treewidth,network consistency problem,polynomial time,spatial reasoning,fundamental formalisms,relation algebra rcc8
Conference
12
PageRank 
References 
Authors
0.63
16
2
Name
Order
Citations
PageRank
Manuel Bodirsky164454.63
Stefan Wölfl221315.84