Other Computer Sciences Commons^™

An Exact Analysis For Efficient Computation Of Random-Pattern Testability In Combinational Circuits, Sharad C. Seth, Bhargab B. Bhattacharya, Vishwani Agrawal

School of Computing: Conference and Workshop Papers

Experimental evidence shows that low testability in a typical circuit is much more likely due to poor observability than poor controllability. Thus, from theoretical and practical standpoints, it is important to develop an accurate model for observability computation. One such model, in terms of supergates, is proposed in the first part of this paper thus complimenting our earlier work. It is now possible to obtain exact random-pattern testability for each line in a circuit.

The second part of the paper analyzes the supegate structure of a circuit from a graph theoretic viewpoint. Finding a supergate is related to determining the …

Computer-Aided Normalizing And Unpacking: Some Interesting Machine-Processable Transformations Of Legal Rules, Layman E. Allen, Charles S. Saxon

Book Chapters

One way of dealing with an important aspect of the natural language barrier that researchers m artificial intelligence have been wrestling with for more than two decades is to normalize the expression of the logical structure of legal rules.

The computer program, NORMALIZER, will enable a legal analyst to automatically generate Normalized Versions of legal rules and Outlines of them from Parenthesized Logical Expressions of their structure and Marked Versions of the Original Text of the rules. In brief:

Parenthesized Logical Expression & Marked Version = = > Outline & Normalized Version.

The Parenthesized Logical Expression of a normalized rule is …