Skip to main content
padlock icon - secure page this page is secure

Unifying and extending hybrid tractable classes of CSPs

Buy Article:

$60.00 + tax (Refund Policy)

Finding a solution to a constraint satisfaction problem (CSP) is known to be an NP-complete task. Many works have been concerned with identifying tractable classes of CSPs. Tractability is obtained by imposing specific problem structures, specific constraint relations or both. A tractable CSP class whose tractability is due to both structural and relational properties is said to be hybrid. In this article, we present a hybrid tractable CSP class that brings together and generalises many known hybrid tractable CSPs. The proposed class is characterised by means of simple but powerful notions from set theory.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: constraint satisfaction; ranked CSP; set theory; tractable CSP

Document Type: Research Article

Affiliations: Department of Computer Science, Faculty of Sciences, University of Monastir, Monastir 5000, Tunisia

Publication date: December 1, 2013

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
X
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more