RST Flip-Flop Input Equations

DOI10.1109/PGEC.1967.264647MaRDI QIDQ5540882zbMATH OpenFDO

Authors Pierre I. Tison

Publication date 1967

Published in IEEE Transactions on Electronic Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/PGEC.1967.264647

zbMATH Keywords

numerical analysis

Cited in

(19)

• A graph theoretic approach to switching function minimization
• Polynomial-time algorithms for generation of prime implicants
• Characterizing diagnoses and systems
• Linear resolution for consequence finding
• An SE-tree-based prime implicant generation algorithm
• A superposition calculus for abductive reasoning
• On propositional definability
• Implicates and prime implicates in random 3-SAT
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• Quantifier-free equational logic and prime implicate generation
• Useless prime implicants of incompletely specified multiple-output switching functions
• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• Boolean algebra admits no convergent term rewriting system
• Prominent classes of the most general subsumptive solutions of Boolean equations
• On strongest necessary and weakest sufficient conditions
• Belief revision with satisfaction measure
• Optimizing the clausal normal form transformation
• A generic approach to planning in the presence of incomplete information: theory and implementation
• An incremental method for generating prime implicants/implicates

This page was built for publication: RST Flip-Flop Input Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5540882)