The following pages link to A Way to Simplify Truth Functions (Q3230352):
Displaying 50 items.
- Projection, consistency, and George Boole (Q265702) (← links)
- Boolean functions with a simple certificate for CNF complexity (Q412324) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Prominent classes of the most general subsumptive solutions of Boolean equations (Q507645) (← links)
- Genuine coherence as mutual confirmation between content elements (Q526734) (← links)
- A novel graphical technique for combinational logic representation and optimization (Q680814) (← links)
- A continuous approach to inductive inference (Q687090) (← links)
- A subclass of Horn CNFs optimally compressible in polynomial time (Q693287) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Disjoint essential sets of implicates of a CQ Horn function (Q766268) (← links)
- A note on the complexity of Boolean concepts (Q856652) (← links)
- Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules (Q882294) (← links)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
- Exclusive and essential sets of implicates of Boolean functions (Q968115) (← links)
- Logic applied to integer programming and integer programming applied to logic (Q1130078) (← links)
- A switching algorithm for the solution of quadratic Boolean equations (Q1153123) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Polynomial-time algorithms for generation of prime implicants (Q1190532) (← links)
- Horn functions and their DNFs (Q1195858) (← links)
- Axiomatization of certain problems of minimization (Q1212444) (← links)
- Characteristic measures of switching functions (Q1243267) (← links)
- Structural pattern recognition, homomorphisms, and arrangements (Q1247176) (← links)
- On the complexity of regular resolution and the Davis-Putnam procedure (Q1249435) (← links)
- Double Horn functions (Q1271644) (← links)
- Length of prime implicants and number of solutions of random CNF formulae (Q1285568) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- Resolution and the integrality of satisfiability problems (Q1352293) (← links)
- Generalized resolution for 0--1 linear inequalities (Q1354004) (← links)
- Polynomial-time inference of all valid implications for Horn and related formulae (Q1356205) (← links)
- A model of the loop formation process on knitting machines using finite automata theory (Q1367455) (← links)
- Horn functions and submodular Boolean functions (Q1392203) (← links)
- Convexity and logical analysis of data (Q1575707) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Explanatory relations in arbitrary logics based on satisfaction systems, cutting and retraction (Q1726251) (← links)
- Boolean function minimization in the class of disjunctive normal forms (Q1825217) (← links)
- Hypothesis test for causal explanations in human pathology: Evaluation of pulmonary edema in 181 autopsied patients with leukemia (Q1836258) (← links)
- Special issue: Boolean functions and related problems (Q1841878) (← links)
- Disjunctive and conjunctive normal forms of pseudo-Boolean functions (Q1841879) (← links)
- Properties of quasi-Boolean function on quasi-Boolean algebra (Q1937909) (← links)
- General theory for interactions in sufficient cause models with dichotomous exposures (Q1940768) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- On connected Boolean functions (Q1961460) (← links)
- Mixed logical-linear programming (Q1961464) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- Computing AES related-key differential characteristics with constraint programming (Q2289026) (← links)
- Logic diagrams, sacred geometry and neural networks (Q2297964) (← links)
- Logical analysis of data -- the vision of Peter L. Hammer (Q2385443) (← links)
