On guaranteeing polynomially bounded search tree size

  • Authors:

  • David A. Cohen;Martin C. Cooper;Martin J. Green;Dániel Marx

  • Affiliations:

  • Dept. of Computer Science, Royal Holloway, University of London, UK;IRIT, University of Toulouse III, Toulouse, France;Dept. of Computer Science, Royal Holloway, University of London, UK;Institut für Informatik, Humboldt-Universität zu Berlin, Germany

  • Venue:
  • CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Much work has been done on describing tractable classes of constraint networks. Most of the known tractable examples are described by either restricting the structure of the networks, or their language. Indeed, for both structural or language restrictions very strong dichotomy results have been proven and in both cases it is likely that all practical examples have already been discovered. As such it is timely to consider tractability which cannot be described by language or structural restrictions. This is the focus of the work here. In this paper we investigate a novel reason for tractability: having at least one variable ordering for which the number of partial solutions to the first n variables is bounded by a polynomial in n. We show that the presence of sufficient functional constraints can guarantee this property and we investigate the complexity of finding good variable orderings based on different notions of functionality. What is more we identify a completely novel reason for tractability based on so called Turan sets.