A Way to Simplify Truth Functions
From MaRDI portal
Publication:3230352
DOI10.2307/2307285zbMATH Open0068.24209OpenAlexW4231510479WikidataQ56225484 ScholiaQ56225484MaRDI QIDQ3230352FDOQ3230352
Authors: W. V. Quine 
Publication date: 1955
Full work available at URL: https://doi.org/10.2307/2307285
Cited In (85)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
- Spanned patterns for the logical analysis of data
- Algebraic Topological Methods for the Synthesis of Switching Systems. I
- SAT-Based Formula Simplification
- Characteristic measures of switching functions
- Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction
- A switching algorithm for the solution of quadratic Boolean equations
- On the complexity of regular resolution and the Davis-Putnam procedure
- A continuous approach to inductive inference
- Projection, consistency, and George Boole
- A subclass of Horn CNFs optimally compressible in polynomial time
- Structural pattern recognition, homomorphisms, and arrangements
- Boolean functions with a simple certificate for CNF complexity
- Resolution and the integrality of satisfiability problems
- Exclusive and essential sets of implicates of Boolean functions
- Bidual Horn functions and extensions
- Algorithms for computing minimal equivalent subformulas
- Horn functions and their DNFs
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation
- Learning from conflicts in propositional satisfiability
- A note on the complexity of Boolean concepts
- Generalized resolution for 0--1 linear inequalities
- Polynomial-time inference of all valid implications for Horn and related formulae
- A surrogate heuristic for set covering problems
- Minimal sets on propositional formulae. Problems and reductions
- Convexity and logical analysis of data
- Logical analysis of data -- the vision of Peter L. Hammer
- Consensus algorithms for the generation of all maximal bicliques
- Comprehensive vs. comprehensible classifiers in logical analysis of data
- Prominent classes of the most general subsumptive solutions of Boolean equations
- Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules
- A linear and discrete programming framework for representing qualitative knowledge
- An analytical approach to global optimization
- Polynomial-time algorithms for generation of prime implicants
- Length of prime implicants and number of solutions of random CNF formulae
- Horn functions and submodular Boolean functions
- Logic applied to integer programming and integer programming applied to logic
- Hardness of approximate two-level logic minimization and PAC learning with membership queries
- Disjoint essential sets of implicates of a CQ Horn function
- Mixed logical-linear programming
- Logic design of decoded-programmable logic arrays
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions
- Properties of quasi-Boolean function on quasi-Boolean algebra
- On simplifying truth-functional formulas
- General theory for interactions in sufficient cause models with dichotomous exposures
- On connected Boolean functions
- Boolean function minimization in the class of disjunctive normal forms
- Double Horn functions
- A model of the loop formation process on knitting machines using finite automata theory
- Axiomatization of certain problems of minimization
- Hypothesis test for causal explanations in human pathology: Evaluation of pulmonary edema in 181 autopsied patients with leukemia
- Special issue: Boolean functions and related problems
- A novel graphical technique for combinational logic representation and optimization
- Genuine coherence as mutual confirmation between content elements
- Computing AES related-key differential characteristics with constraint programming
- Computing prime implicants
- Set of support, demodulation, paramodulation: a historical perspective
- On the failings of Shapley values for explainability
- Probabilistic truthlikeness, content elements, and meta-inductive probability optimization
- What we can learn from conflicts in propositional satisfiability
- A novel crossover operator in evolutionary algorithm for logic circuit design
- Boolean functions with long prime implicants
- A logic for binary classifiers and their explanation
- On prime scenarios in qualitative spatial and temporal reasoning
- Convexity of division property transitions: theory, algorithms and compact models
- A 2-phase method for the minimisation of boolean polynomials
- CLAASP: a cryptographic library for the automated analysis of symmetric primitives
- An artificial neural network satisfiability tester
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
- McColl and minimization
- Sequent-type rejection systems for finite-valued non-deterministic logics
- A compact method for the minimisation of boolean polynomials
- A simpler method for minimization of switching functions
- Notes on hazard-free circuits
- Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
- A method for reducing coefficients in zero‐one linear inequalities
- Quinean Minimization: Some Suggested Modifications
- Achieving consistency with cutting planes
- A logic of ``black box classifier systems
- Logic diagrams, sacred geometry and neural networks
- Solution to the realizability problem for irredundant Boolean branch- networks
- A Method of Two-Level Simplification of Boolean Functions
- An application of truth functional logic to concept-attainment experiments
- On finding optimal covers
- Comparative study of serial and parallel heuristics used to design combinational logic circuits
This page was built for publication: A Way to Simplify Truth Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3230352)
