The Problem of Simplifying Truth Functions

Cited in

(94)

Recognition of interval Boolean functions
Uncovering deterministic causal structures: a Boolean approach
Minimization of Boolean functions of any number of variables using decimal labels
The automation of syllogistic. I: Syllogistic normal forms
Logic applied to integer programming and integer programming applied to logic
A graph theoretic approach to switching function minimization
Polynomial-time algorithms for generation of prime implicants
Linear resolution for consequence finding
An efficient algorithm for the 3-satisfiability problem
Axiomatization of certain problems of minimization
Boolesche Minimalpolynome und Überdeckungsprobleme
Characteristic measures of switching functions
On the number of prime implicants
Length of prime implicants and number of solutions of random CNF formulae
Resolution and the integrality of satisfiability problems
Generalized resolution for 0--1 linear inequalities
A model of the loop formation process on knitting machines using finite automata theory
A representation of stably compact spaces, and patch topology.
The minimum equivalent DNF problem and shortest implicants
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
A syntactical proof of the Marriage Lemma.
Optimal axiomatizations of finitely valued logics
An SE-tree-based prime implicant generation algorithm
General theory for interactions in sufficient cause models with dichotomous exposures
Mixed logical-linear programming
Revealing the canalizing structure of Boolean functions: algorithms and applications
Automatic search for bit-based division property
\textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data
Debugging incoherent terminologies
Solution to the realizability problem for irredundant Boolean branch- networks
Combinatorial equivalence of (0,1) circulant matrices
An application of truth functional logic to concept-attainment experiments
Projection, consistency, and George Boole
A multiple-valued logic approach to the design and verification of hardware circuits
Preprocessing to reduce the search space: antler structures for feedback vertex set
Logic explained networks
Achieving consistency with cutting planes
Kernelization -- preprocessing with a guarantee
Enumerating prime implicants of propositional formulae in conjunctive normal form
McColl and minimization
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
Simplest normal truth functions
On simplifying truth-functional formulas
Algebraic Topological Methods for the Synthesis of Switching Systems. I
SAT-Based Formula Simplification
Quinean Minimization: Some Suggested Modifications
Boolean functions with a simple certificate for CNF complexity
The L‐map method for sequential machine state minimization
An artificial neural network satisfiability tester
Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
Guarantees and limits of preprocessing in constraint satisfaction and reasoning
Algorithms for computing minimal equivalent subformulas
Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices
On the complexity of joint realization of Boolean functions regular systems in the DNF basis
Rethinking arithmetic for deep neural networks
Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates
Boolean algebra admits no convergent term rewriting system
Prominent classes of the most general subsumptive solutions of Boolean equations
Enhancing the minimization of Boolean and multivalue output functions with \(e\)QMC
The Decomposition Tree for analyses of Boolean functions
A Method of Two-Level Simplification of Boolean Functions
On finding optimal covers
Coincidence between Boolean products and its application to third-order simplification†
The problem of simplifying logical expressions
The Lattice Theory of Post Algebras
Some Studies on Connected Cover Term Matrices of Switching Functions†
On a Method of Determination of one of the Minimal Solutions of Switching Functions by utilizing their Connected Cover Term Matrices†
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Sequent-type rejection systems for finite-valued non-deterministic logics
Sequential model-based diagnosis by systematic search
Partially unate Boolean functions: properties of their sum-of-products representations
On the (complete) reasons behind decisions
Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule
Projecting systems of linear inequalities with binary variables
Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions
Computing prime implicants
Preprocessing to reduce the search space: antler structures for feedback vertex set
On the failings of Shapley values for explainability
Breaking the size barrier: universal circuits meet lookup tables
On prime scenarios in qualitative spatial and temporal reasoning
A new lower bound on the expected size of irredundant forms for Boolean functions
A novel graphical technique for combinational logic representation and optimization
Entailing generalization boosts enumeration
A continuous approach to inductive inference
Gröbner bases for Boolean function minimization
A subclass of Horn CNFs optimally compressible in polynomial time
Cnf characterization of sets over \(\mathbb{Z}_2^n\) and its applications in cryptography
Compact solution representation in qualitative constraint-based reasoning
Equivalence checking of quantum circuits by model counting
An excursion in reaction systems: from computer science to biology
Efficient algorithm for generating optimal inequality candidates for MILP modeling of Boolean functions
Optimizing the clausal normal form transformation
Exclusive and essential sets of implicates of Boolean functions

This page was built for publication: The Problem of Simplifying Truth Functions

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