Reasoning about betweenness and RCC8 constraints in qualitative conceptual spaces

Schockaert, S; Li, S

Reasoning about betweenness and RCC8 constraints in qualitative conceptual spaces

Schockaert, S Li, S

Permalink

Publication Type:: Conference Proceeding
Citation:: IJCAI International Joint Conference on Artificial Intelligence, 2018, 2018-July pp. 1963 - 1969
Issue Date:: 2018-01-01

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Published versionAdobe PDF (195.22 kB)

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Schockaert, S	en_US
dc.contributor.author	Li, S https://orcid.org/0000-0002-3332-2546	en_US
dc.date.issued	2018-01-01	en_US
dc.identifier.citation	IJCAI International Joint Conference on Artificial Intelligence, 2018, 2018-July pp. 1963 - 1969	en_US
dc.identifier.isbn	9780999241127	en_US
dc.identifier.issn	1045-0823	en_US
dc.identifier.uri	http://hdl.handle.net/10453/133841
dc.description.abstract	© 2018 International Joint Conferences on Artificial Intelligence. All right reserved. Conceptual spaces are a knowledge representation framework in which concepts are represented geometrically, using convex regions. Motivated by the fact that exact conceptual spaces are usually difficult to obtain, we study the problem of spatial reasoning about qualitative abstractions of such representations. In particular, we consider the problem of deciding whether an RCC8 network extended with constraints about betweenness can be realized using bounded and convex regions in a high-dimensional Euclidean space. After showing that this decision problem is PSPACE-hard in general, we introduce an important fragment for which deciding realizability is NP-complete.	en_US
dc.relation.ispartof	IJCAI International Joint Conference on Artificial Intelligence	en_US
dc.title	Reasoning about betweenness and RCC8 constraints in qualitative conceptual spaces	en_US
dc.type	Conference Proceeding
utslib.citation.volume	2018-July	en_US
utslib.for	0802 Computation Theory and Mathematics	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	open_access
pubs.publication-status	Published	en_US
pubs.volume	2018-July	en_US

Abstract:

© 2018 International Joint Conferences on Artificial Intelligence. All right reserved. Conceptual spaces are a knowledge representation framework in which concepts are represented geometrically, using convex regions. Motivated by the fact that exact conceptual spaces are usually difficult to obtain, we study the problem of spatial reasoning about qualitative abstractions of such representations. In particular, we consider the problem of deciding whether an RCC8 network extended with constraints about betweenness can be realized using bounded and convex regions in a high-dimensional Euclidean space. After showing that this decision problem is PSPACE-hard in general, we introduce an important fragment for which deciding realizability is NP-complete.

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

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