The Problem of Simplifying Truth Functions
From MaRDI portal
Publication:5814795
DOI10.2307/2308219zbMath0048.24503OpenAlexW4253456425WikidataQ56225483 ScholiaQ56225483MaRDI QIDQ5814795
Publication date: 1952
Full work available at URL: https://doi.org/10.2307/2308219
Related Items
Projection, consistency, and George Boole, A multiple-valued logic approach to the design and verification of hardware circuits, On finding optimal covers, Quinean Minimization: Some Suggested Modifications, Coincidence between Boolean products and its application to third-order simplification†, The L‐map method for sequential machine state minimization, SAT-Based Formula Simplification, Analysis of Complex and Heterogeneous Data Using FCA and Monadic Predicates, Boolean algebra admits no convergent term rewriting system, Kernelization – Preprocessing with a Guarantee, Automatic search for bit-based division property, Resolution and the integrality of satisfiability problems, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, Generalized resolution for 0--1 linear inequalities, The problem of simplifying logical expressions, The automation of syllogistic. I: Syllogistic normal forms, A model of the loop formation process on knitting machines using finite automata theory, Some Studies on Connected Cover Term Matrices of Switching Functions†, Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form, An SE-tree-based prime implicant generation algorithm, Logic applied to integer programming and integer programming applied to logic, Preprocessing to reduce the search space: antler structures for feedback vertex set, On a Method of Determination of one of the Minimal Solutions of Switching Functions by utilizing their Connected Cover Term Matrices†, Simplest normal truth functions, Sequent-type rejection systems for finite-valued non-deterministic logics, Sequential model-based diagnosis by systematic search, Logic explained networks, Partially unate Boolean functions: properties of their sum-of-products representations, Boolean functions with a simple certificate for CNF complexity, On the (complete) reasons behind decisions, On simplifying truth-functional formulas, General theory for interactions in sufficient cause models with dichotomous exposures, Achieving consistency with cutting planes, An artificial neural network satisfiability tester, Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule, \textsc{NextPriorityConcept}: a new and generic algorithm computing concepts from complex and heterogeneous data, The Lattice Theory of Post Algebras, Projecting systems of linear inequalities with binary variables, Incremental polynomial time dualization of quadratic functions and a subclass of degree-\(k\) functions, Mixed logical-linear programming, Guarantees and limits of preprocessing in constraint satisfaction and reasoning, Algorithms for computing minimal equivalent subformulas, A graph theoretic approach to switching function minimization, A representation of stably compact spaces, and patch topology., Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes, Debugging incoherent terminologies, A new lower bound on the expected size of irredundant forms for Boolean functions, 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, Optimal axiomatizations for multiple-valued operators and quantifiers based on semi-lattices, McColl and Minimization, Linear resolution for consequence finding, A continuous approach to inductive inference, An efficient algorithm for the 3-satisfiability problem, 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, Boolesche Minimalpolynome und Überdeckungsprobleme, An excursion in reaction systems: from computer science to biology, Characteristic measures of switching functions, On the number of prime implicants, О сложности совместной реализации в базисе ДНФ регулярных систем булевых функций, The Decomposition Tree for analyses of Boolean functions, Solution to the realizability problem for irredundant Boolean branch- networks, Combinatorial equivalence of (0,1) circulant matrices, Hardness of approximate two-level logic minimization and PAC learning with membership queries, An application of truth functional logic to concept-attainment experiments, Recognition of interval Boolean functions, Boolean function minimization in the class of disjunctive normal forms, Uncovering deterministic causal structures: a Boolean approach, Length of prime implicants and number of solutions of random CNF formulae, Algebraic Topological Methods for the Synthesis of Switching Systems. I, Rethinking arithmetic for deep neural networks, Hypothesis test for causal explanations in human pathology: Evaluation of pulmonary edema in 181 autopsied patients with leukemia, Revealing the canalizing structure of Boolean functions: algorithms and applications, A syntactical proof of the Marriage Lemma., Optimal axiomatizations of finitely valued logics, Minimization of Boolean functions of any number of variables using decimal labels, Enhancing the Minimization of Boolean and Multivalue Output Functions WitheQMC, A Method of Two-Level Simplification of Boolean Functions, The minimum equivalent DNF problem and shortest implicants, Optimizing the clausal normal form transformation
