On minimal models of the Region Connection Calculus

Xia, L; Li, S

On minimal models of the Region Connection Calculus

Xia, L Li, S

Permalink

Publication Type:: Journal Article
Citation:: Fundamenta Informaticae, 2006, 69 (4), pp. 427 - 446
Issue Date:: 2006-03-08

Closed Access

	Filename	Description	Size
	2008004812OK.pdf		228 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Xia, L	en_US
dc.contributor.author	Li, S https://orcid.org/0000-0002-3332-2546	en_US
dc.date.issued	2006-03-08	en_US
dc.identifier.citation	Fundamenta Informaticae, 2006, 69 (4), pp. 427 - 446	en_US
dc.identifier.issn	0169-2968	en_US
dc.identifier.uri	http://hdl.handle.net/10453/9008
dc.description.abstract	Region Connection Calculus (RCC) is one primary formalism of qualitative spatial reasoning. Standard RCC models are continuous ones where each region is infinitely divisible. This contrasts sharply with the predominant use of finite, discrete models in applications. In a recent paper, Li et al. (2004) initiate a study of countable models that can be constructed step by step from finite models. Of course, some basic problems are left unsolved, for example, how many non-isomorphic countable RCC models are there? This paper investigates these problems and obtains the following results: (i) the exotic RCC model described by Gotts (1996) is isomorphic to the minimal model given by Li and Ying (2004); (ii) there are continuum many non-isomorphic minimal RCC models, where a model is minimal if it can be isomorphically embedded in each RCC model.	en_US
dc.relation.ispartof	Fundamenta Informaticae	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	On minimal models of the Region Connection Calculus	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	69	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	69	en_US

Abstract:

Region Connection Calculus (RCC) is one primary formalism of qualitative spatial reasoning. Standard RCC models are continuous ones where each region is infinitely divisible. This contrasts sharply with the predominant use of finite, discrete models in applications. In a recent paper, Li et al. (2004) initiate a study of countable models that can be constructed step by step from finite models. Of course, some basic problems are left unsolved, for example, how many non-isomorphic countable RCC models are there? This paper investigates these problems and obtains the following results: (i) the exotic RCC model described by Gotts (1996) is isomorphic to the minimal model given by Li and Ying (2004); (ii) there are continuum many non-isomorphic minimal RCC models, where a model is minimal if it can be isomorphically embedded in each RCC model.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/9008