Home | Downloads | Documentation | Screenshots | News

libfsqca Screenshots

Reducing a truth table to Boolean equations produces a sufficiency consistency/coverage (concov) table. Each recipe of the solution is listed along with its consistency, raw coverage, and unique coverage scores. Corresponding observations are also presented, and the table indicates whether each observation is consistent or inconsistent with the outcome. Consistency and coverage scores for the entire solution are also presented.

(Tip: The simplification level for the analysis is incorporated as part of the session entry: the name "concov_suf_2" indicates that this sufficiency concov table was constructed by reducing the prime implicants of the corresponding truth table ("gtt_suf_2"). Four simplification levels are possible: 0 - reduce to primitive expressions, 1 - reduce to prime implicants, 2 - reduce prime implicants, 3 - reduce prime implicants using remainders as simplifying assumptions.)

Prev | Up | Next


Claude Rubinson <cjr@grundrisse.org>
Last modified: Wed Mar 7 18:12:21 CST 2012