     :dir       Factor sequences into pairs using :left or :right recursion
     :prop      Automatically propagate subsumption from parents to matching children?"
   [henv & {gather :gather d :d  s :s   choice-fn :choice-fn
-           local? :local?  dir :dir   prop :prop dijkstra :dijkstra :as m
+           local? :local?  dir :dir   prop :prop :as m
       :or {gather true   d true s true choice-fn last
-           local? true     dir :right prop true dijkstra #{}}}]
-  (assert (every? #{:gather :d :s :choice-fn :local? :dir :prop :dijkstra} (keys m)))
+           local? true     dir :right prop true}}]
+  (assert (every? #{:gather :d :s :choice-fn :local? :dir :prop} (keys m)))
   (when s (assert d))
   (when d (assert gather))
   (binding [*collect-equal-outputs* gather
             *decompose-cache*       (when d (HashMap.))
             *state-abstraction*     s
             *left-recursive*        (case dir :left true :right false)
-            *propagate-subsumption* prop
-            *dijkstra-actions*      dijkstra]
+            *propagate-subsumption* prop]
     (def *root* (sp-ts (apply make-atomic-subproblem (reverse (fs/make-init-pair henv)))))
     (summary/solve
      #(sg/summary *root*)

(declare *decompose-cache*       ) ;; Cache subproblems? Requires *collect-equal-outputs*
(declare *state-abstraction*     ) ;; Use state abstraction?  Requires *decompose-cache*
(declare *propagate-subsumption* ) ;; Automatically propagate subsumption links to corresponding children
(declare *dijkstra-actions*      ) ;; Use dijkstra for these action types (set).


;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;





;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;      Pair      ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
;; Pair subproblems represent sequntial composition of two subproblems.
