A Way to Simplify Truth Functions

Related Items

Projection, consistency, and George Boole, On finding optimal covers, Quinean Minimization: Some Suggested Modifications, A surrogate heuristic for set covering problems, What we can learn from conflicts in propositional satisfiability, SAT-Based Formula Simplification, Resolution and the integrality of satisfiability problems, Generalized resolution for 0--1 linear inequalities, Polynomial-time inference of all valid implications for Horn and related formulae, Logical analysis of data -- the vision of Peter L. Hammer, A note on the complexity of Boolean concepts, A model of the loop formation process on knitting machines using finite automata theory, Minimal sets on propositional formulae. Problems and reductions, Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules, Logic design of decoded-programmable logic arrays, Logic applied to integer programming and integer programming applied to logic, Horn functions and submodular Boolean functions, Sequent-type rejection systems for finite-valued non-deterministic logics, Properties of quasi-Boolean function on quasi-Boolean algebra, A logic of ``black box classifier systems, Boolean functions with a simple certificate for CNF complexity, On simplifying truth-functional formulas, General theory for interactions in sufficient cause models with dichotomous exposures, Probabilistic truthlikeness, content elements, and meta-inductive probability optimization, Convexity of division property transitions: theory, algorithms and compact models, Achieving consistency with cutting planes, An artificial neural network satisfiability tester, Learning from conflicts in propositional satisfiability, A switching algorithm for the solution of quadratic Boolean equations, A logic for binary classifiers and their explanation, Bidual Horn functions and extensions, On connected Boolean functions, Mixed logical-linear programming, Boolean functions with long prime implicants, Algorithms for computing minimal equivalent subformulas, Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction, Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes, An analytical approach to global optimization, Polynomial-time algorithms for generation of prime implicants, Prominent classes of the most general subsumptive solutions of Boolean equations, A novel graphical technique for combinational logic representation and optimization, Horn functions and their DNFs, A pseudo-Boolean consensus approach to nonlinear 0-1 optimization, McColl and Minimization, A continuous approach to inductive inference, Genuine coherence as mutual confirmation between content elements, Comprehensive vs. comprehensible classifiers in logical analysis of data, A subclass of Horn CNFs optimally compressible in polynomial time, Exclusive and essential sets of implicates of Boolean functions, Axiomatization of certain problems of minimization, Spanned patterns for the logical analysis of data, Consensus algorithms for the generation of all maximal bicliques, A method for reducing coefficients in zero‐one linear inequalities, A 2-phase method for the minimisation of boolean polynomials, Comparative study of serial and parallel heuristics used to design combinational logic circuits, Characteristic measures of switching functions, Structural pattern recognition, homomorphisms, and arrangements, On the complexity of regular resolution and the Davis-Putnam procedure, Computing AES related-key differential characteristics with constraint programming, Logic diagrams, sacred geometry and neural networks, Solution to the realizability problem for irredundant Boolean branch- networks, Hardness of approximate two-level logic minimization and PAC learning with membership queries, Double Horn functions, An application of truth functional logic to concept-attainment experiments, A Novel Crossover Operator in Evolutionary Algorithm for Logic Circuit Design, Disjoint essential sets of implicates of a CQ Horn function, Boolean function minimization in the class of disjunctive normal forms, Notes on Hazard-Free Circuits, Length of prime implicants and number of solutions of random CNF formulae, Algebraic Topological Methods for the Synthesis of Switching Systems. I, A simpler method for minimization of switching functions, Convexity and logical analysis of data, 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, Disjunctive and conjunctive normal forms of pseudo-Boolean functions, A linear and discrete programming framework for representing qualitative knowledge, Set of support, demodulation, paramodulation: a historical perspective, Optimal compression of propositional Horn knowledge bases: Complexity and approximation, A compact method for the minimisation of boolean polynomials, A Method of Two-Level Simplification of Boolean Functions, On Quantifying Literals in Boolean Logic and its Applications to Explainable AI