The Design of Backtrack Algorithms.

Abstract

The backtrack control structures is a well known combinatorial problem solving approach in computer science. The strategy can be abstracted into a program schema with slots for lower level functions which is suitable for the automated synthesis of backtrack programs. Employing a known model of program synthesis based on a problem reduction problem representation, two reduction rules are developed for transforming a problem specification into a backtrack control structure with specifications for lower level functions. We illustrate these rules with sample problems. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1983
Accession Number
ADA132299

Entities

People

  • Gary Loberg

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Efficiency
  • Engineering
  • Identification
  • Language
  • New Jersey
  • Programming Languages
  • Schools
  • Software Development
  • Specifications
  • Standards
  • United States

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Operations Research