Publications (2)0 Total impact
ABSTRACT: In this paper we present and compare several techniques for addressing circuit diagnosis problems. We start with a generate and test algorithm, then we proceed with a simple Prolog backtracking search.
ABSTRACT: In this paper we present an efficient deductive method for addressing combinational circuit diagnosis problems. The method
resorts to bottom-up dependencies propagation, where truth-values are annotated with sets of faults. We compare it with several
other logic programming techniques, starting with a naíve generate-and-test algorithm, and proceeding with a simple Prolog
backtracking search. An approach using tabling is also studied, based on an abductive approach. For the sake of completeness,
we also address the same problem with Answer Set Programming. Our tests recur to the ISCAS85 circuit benchmarks suite, although
the technique is generalized to systems modelled by a set of propositional rules. The dependency-directed method outperforms
others by orders of magnitude.
01/1970: pages 155-165;
Stony Brook University
Department of Computer Science