On Cores and Prime Implicants of Truth Functions

DOI10.2307/2310460zbMath0201.32203OpenAlexW4236842166MaRDI QIDQ5599129

W. V. Quine

Publication date: 1959

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2310460

Related Items

A generalization of Nelson's algorithm for obtaining prime implicants ⋮ On finding optimal covers ⋮ Quinean Minimization: Some Suggested Modifications ⋮ Abductive network action inference for targeted therapy discovery ⋮ On the Algebraic Structure of Conditional Events ⋮ Boolean algebra admits no convergent term rewriting system ⋮ Embedding complex decision procedures inside an interactive theorem prover. ⋮ Polynomial-time inference of all valid implications for Horn and related formulae ⋮ Relevant Minimal Change in Belief Update ⋮ Redundancy in logic. II: 2CNF and Horn propositional formulae ⋮ What makes propositional abduction tractable ⋮ Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form ⋮ Merging operators on stratified belief bases equipped with argumentative inference ⋮ On the (complete) reasons behind decisions ⋮ Prioritized and non-prioritized multiple change on belief bases ⋮ ABox abduction in the description logic \(\mathcal{ALC}\) ⋮ Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes ⋮ A regularity theoretic approach to actual causation ⋮ Polynomial-time algorithms for generation of prime implicants ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Prominent classes of the most general subsumptive solutions of Boolean equations ⋮ Building a consensus: A rectangle covering problem ⋮ Counterfactuals ⋮ A many-valued semantics for category mistakes ⋮ Investigations into quantified modal logic. I ⋮ Unnamed Item ⋮ A semantic analysis of addition and subtraction word problems in arithmetic ⋮ On the relation between resolution based and completion based theorem proving ⋮ Unnamed Item ⋮ Boolean function minimization in the class of disjunctive normal forms ⋮ Uncovering deterministic causal structures: a Boolean approach ⋮ Length of prime implicants and number of solutions of random CNF formulae ⋮ An algorithm to generate prime implicants and its application to the selection problem ⋮ A simpler method for minimization of switching functions ⋮ On converting CNF to DNF ⋮ Optimizing the clausal normal form transformation