A Way to Simplify Truth Functions

Cited in

(87)

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

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)