An exercise in transformational programming: Backtracking and Branch-and- Bound

DOI10.1016/0167-6423(91)90022-PMaRDI QIDQ808723zbMATH OpenOpenAlexFDO

Authors Maarten M. Fokkinga

Publication date 1991

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-6423(91)90022-p

zbMATH Keywords

transformational programmingalgebraic manipulations

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Transformational programming and the derivation of algorithms
• Toward a model for backtracking and dynamic programming
• Transformational programming and the paragraph problem
• Deciding full branching time logic by program transformation
• Toward the concept of backtracking computation
• An overview of backtrack search satisfiability algorithms
• scientific article; zbMATH DE number 4041248
• scientific article; zbMATH DE number 4129962
• Backjump-based backtracking for constraint satisfaction problems
• Logic Based Program Synthesis and Transformation

Cited in

(5)

• Deriving backtracking monad transformers
• A problem reduction based approach to discrete optimization algorithm design
• Parallelization of divide-and-conquer in the Bird-Meertens formalism
• Backtrack Programming with SIMULA
• Categories, relations and dynamic programming

This page was built for publication: An exercise in transformational programming: Backtracking and Branch-and- Bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808723)