RST Flip-Flop Input Equations
From MaRDI portal
Publication:5540882
DOI10.1109/PGEC.1967.264647zbMath0158.16102MaRDI QIDQ5540882
Publication date: 1967
Published in: IEEE Transactions on Electronic Computers (Search for Journal in Brave)
Related Items
Quantifier-Free Equational Logic and Prime Implicate Generation ⋮ Boolean algebra admits no convergent term rewriting system ⋮ On propositional definability ⋮ Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form ⋮ An SE-tree-based prime implicant generation algorithm ⋮ Implicates and prime implicates in random 3-SAT ⋮ A generic approach to planning in the presence of incomplete information: theory and implementation ⋮ An incremental method for generating prime implicants/implicates ⋮ A graph theoretic approach to switching function minimization ⋮ Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes ⋮ Polynomial-time algorithms for generation of prime implicants ⋮ Prominent classes of the most general subsumptive solutions of Boolean equations ⋮ Characterizing diagnoses and systems ⋮ Linear resolution for consequence finding ⋮ A superposition calculus for abductive reasoning ⋮ On strongest necessary and weakest sufficient conditions ⋮ Useless prime implicants of incompletely specified multiple-output switching functions ⋮ Optimizing the clausal normal form transformation
