English
A rule-based system is presented 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 flavor suggestive of the behavior of expert circuit analyzers. This style of circuit analysis is called propagation of constraints. The systems threads deduced facts with justifications which mention the antecedent facts and the rule used. These justifications may be examined by the user to gain insight into the operation of the set of rules as they apply to a problem. The same justifications are used by the system to determine the currently active data-base context for reasoning in hypothetical situations. They are also used by the system in the analysis failures to reduce the search space. This leads to effective control of combinatorial search which is called dependency-directed backtracking.
Sign in with your free account to read, download EPUBs or listen.
Ebook · DTIC ADA035719: Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis, · Defense Technical Information Center · Internet Archive
DTIC Archive · Stallman,Richard M · Sussman,Gerald Jay · MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB · *ARTIFICIAL INTELLIGENCE · *COMPUTER AIDED DIAGNOSIS · *CIRCUIT ANALYSIS · DATA BASES · PROGRAMMING LANGUAGES · PROBLEM SOLVING