Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.lao-star

The Applied Higher-Order Functions cataloguesrc/rainbow/algorithms/proofs/ahof/lao_star.clj2 definitions, 3 theorems

AHoF D38 Labeled Heuristic Search (LAO*): expand the best (lowest f-cost) node on the frontier of the explicit AND/OR graph; between two f-costs it keeps the smaller value: prefers-lower-f? a b = decide ('a 'b) expand-value a b = if ('a 'b) then 'a else 'b over exact rationals. Proved native and axiom-free: the preference decision, the selected value, and the switch. Requires audit/decide-nnrat-at-most, logic/if-data (both in the D63 checkpoint). Scope (measured by the kernel): this module has 3 worked instances (statements about specific values). None of its theorems is a guarantee about the algorithm for all inputs; `lein verify rainbow.algorithms.proofs.ahof.lao-star` prints this classification.

lao/prefers-lower-f? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

lao/expand-value :
  (x₁ x₂ : ℚ≥0)
  → ℚ≥0

lao/prefers-example :
  → ce-is/elite? 1/2 3/4 = data/true

lao/selected-value :
  → lao/expand-value 1/2 3/4 = 1/2

lao/switches :
  → ce-is/elite? 3/4 1/2 = data/false