SNARK uses term rewriting based on a recursive path ordering:

• Replace abstract, non-computable terms with concrete, computable ones.

(all (onid dnid eta)
  (= (a-sent (abs naif-id-to-body onid)
             (abs naif-id-to-body dnid)
             (abs ephemeris-time-to-time eta))
    (abs ephemeris-time-to-time
         (sent onid dnid eta))))

SNARK uses an agenda for ordering formulas to be proved. Agenda-ordering strategy: give priority to lightlike?(c,v) involving a constant c and variable v.

Contents    Page-10    Prev    Next    Page+10    Index