forward reasoning and dependency-directed
Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
Stallman, R.M. | Sussman, G. J.
We present a rule-based system for computer-aided circuit analysis. The set of rules, called EL, is written in a rule language called ARS. Rules are implemented by ARS as pattern-directed invocation demons monitoring an associative data base. Deductions are performed in an antecedent manner, giving EL's analysis a catch-as-catch-can flavour suggestive of the behavior of expert circuit analyzers. We call this style of circuit analysis propagation of constraints.