On Cores and Prime Implicants of Truth Functions

DOI10.2307/2310460zbMATH Open0201.32203OpenAlexW4236842166MaRDI QIDQ5599129FDOQ5599129

Authors: 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

Cited In (38)

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

This page was built for publication: On Cores and Prime Implicants of Truth Functions

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