On the space-time trade-off in solving constraint satisfaction problems

  • Authors:

  • Roberto J. Bayardo;Daniel P. Miranker

  • Affiliations:

  • Department of Computer Sciences and Applied Research Laboratories, The University of Texas at Austin, Austin, Texas;Department of Computer Sciences and Applied Research Laboratories, The University of Texas at Austin, Austin, Texas

  • Venue:
  • IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

A common technique for bounding the runtime required to solve a constraint satisfaction problem is to exploit the structure of the problem's constraint graph [Dechter, 92]. We show that a simple structure-based technique with a minimal space requirement, pseudo-tree search [Freuder & Quinn, 85], is capable of bounding runtime almost as effectively as the best exponential space-consuming schemes. Specifically, if we let n denote the number of variables in the problem, w* denote the exponent in the complexity function of the best structure-based techniques, and h denote the exponent from pseudotree search, we show h w* + 1) (lg(n) + 1). The result should allow reductions in the amount of real-time accessible memory required for predicting runtime when solving CSP equivalent problems.