liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Finite Unary Relations and Qualitative Constraint Satisfaction
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering.
2016 (English)In: ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, IOS PRESS , 2016, Vol. 285, 37-45 p.Conference paper (Refereed)
Abstract [en]

Extending qualitative CSPs with the ability of restricting selected variables to finite sets of possible values has been proposed as an important research direction with important applications. Complexity results for this kind of formalisms have appeared in the literature but they focus on concrete examples and not on general principles. We propose three general methods. The first two methods are based on analysing the given CSP from a model-theoretical perspective, while the third method is based on directly analysing the growth of the representation of solutions. We exemplify our methods on temporal and spatial formalisms including Allens algebra and RCC5.

Place, publisher, year, edition, pages
IOS PRESS , 2016. Vol. 285, 37-45 p.
Frontiers in Artificial Intelligence and Applications, ISSN 0922-6389
National Category
Probability Theory and Statistics
URN: urn:nbn:se:liu:diva-132565DOI: 10.3233/978-1-61499-672-9-37ISI: 000385793700006ISBN: 978-1-61499-672-9; 978-1-61499-671-2 OAI: diva2:1046665
22nd European Conference on Artificial Intelligence (ECAI)
Available from: 2016-11-14 Created: 2016-11-14 Last updated: 2016-11-14

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Jonsson, Peter
By organisation
Software and SystemsFaculty of Science & Engineering
Probability Theory and Statistics

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 9 hits
ReferencesLink to record
Permanent link

Direct link