LiU Electronic Press
Full-text not available in DiVA
Author:
Bjäreland, Marcus (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab)
Jonsson, Peter (Linköping University, The Institute of Technology) (Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory)
Title:
Exploiting bipartiteness to identify yet another tractable subclass of CSP
Department:
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, Department of Computer and Information Science, TCSLAB - Theoretical Computer Science Laboratory
Linköping University, The Institute of Technology
Publication type:
Conference paper (Refereed)
Language:
English
In:
Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP)
Publisher: Springer
Series:
Lecture Notes in Computer Science, ISSN 0302-9743; 1713
Volume:
1713
Pages:
118-128
Year of publ.:
1999
URI:
urn:nbn:se:liu:diva-49636
Permanent link:
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-49636
Subject category:
Engineering and Technology
SVEP category:
TECHNOLOGY
Abstract(en) :

The class of constraint satisfaction problems (CSPs) over finite domains has been shown to be NP-complete, but many tractable subclasses have been identified in the literature. In this paper we are interested in restrictions on the types of constraint relations in CSP instances. By a result of Jeavons et al. we know that a key to the complexity of classes arising from such restrictions is the closure properties of the sets of relations. It has been shown that sets of relations that are closed under constant, majority, affine, or associative, commutative, and idempotent (ACI) functions yield tractable subclasses of CSP. However, it has been unknown whether other closure properties may generate tractable subclasses. In this paper we introduce a class of tractable (in fact, SL-complete) CSPs based on bipartite graphs. We show that there are members of this class that are not closed under constant, majority, affine, or ACI functions, and that it, therefore, is incomparable with previously identified classes.

Available from:
2009-10-11
Created:
2009-10-11
Last updated:
2011-02-27
Statistics:
0 hits