Everything about Conjunctive normal form

🧭 Start here: a 6-step reading path

1. Read the overview: Conjunctive normal formA 5-minute orientation
2. Skim a recent paper: DADCNF: Diagnoser design for Duplicate Address Detection threat using Conjunctive Normal FormInfluential work since 2022
3. Pick up a classic book: Discrete and combinatorial mathematicsThe most-reprinted book on the subject
4. Read the landmark paper: A linear-time transformation of linear inequalities into conjunctive normal formCited 83 times
5. Go sideways: Disjunctive normal formA closely related topic
6. Go sideways: Boolean satisfiability problemA closely related topic

🏆 Landmark papers (most cited)

• A linear-time transformation of linear inequalities into conjunctive normal form

  Joost P. Warners · 1998 · Information Processing Letters · 83 citations

• Short Conjunctive Normal Forms in Finitely Valued Logics

  REINER HÄHNLE · 1994 · Journal of Logic and Computation · 59 citations

• An algorithm for the satisfiability problem of formulas in conjunctive normal form

  Rainer Schuler · 2005 · Journal of Algorithms · 53 citations

• Learning consistent, complete and compact sets of fuzzy rules in conjunctive normal form for regression problems

  Jorge Casillas, Pedro Martínez, Alicia D. Benítez · 2008 · Soft Computing · 35 citations

• The decision problem for formulas in prenex conjunctive normal form with binary disjunctions

  M. R. Krom · 1970 · Journal of Symbolic Logic · 15 citations

• Integrating Boolean queries in conjunctive normal form with probabilistic retrieval models

  Robert M. Losee, Abraham Bookstein · 1988 · Information Processing & Management · 13 citations

• Disjunctive and conjunctive normal forms of pseudo-Boolean functions

  Stephan Foldes, Peter L. Hammer · 2000 · Discrete Applied Mathematics · 12 citations

• Homomorphisms of conjunctive normal forms

  Stefan Szeider · 2003 · Discrete Applied Mathematics · 10 citations

🆕 Influential since 2022

• DADCNF: Diagnoser design for Duplicate Address Detection threat using Conjunctive Normal Form

  Abhay Deep Seth, Santosh Biswas, Amit Kumar Dhar · 2023 · Computer Networks · 6 citations

• LitANFIS: Literal-aware Adaptive Neuro-Fuzzy Inference System to learn Conjunctive Normal Form

  Mohammad Mahdi Parchamijalal, Armin Salimi-Badr · 2025 · Neurocomputing · 5 citations

• A Low-Load Distributed Stream Processing System for Continuous Conjunctive Normal Form Queries

  Tomoki Yoshihisa, Takahiro Hara · 2022 · IEEE Transactions on Cloud Computing · 2 citations

• A Confound-Annotated Course-Catalog Dataset with Parsed Conjunctive-Normal-Form Prerequisites for Twenty-Two Universities of the United Arab Emirates

  Sherzod Turaev, Saja Al-Dabet, Mary John · 2026 · F1000Research · 0 citations

📚 Books worth reading

• Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
• Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
• The Conspirators HierarchyJohn Coleman · 1992
• Logic in Computer ScienceMark Ryan · 1999
• Mathematical logic for computer scienceChung-wan Lu · 1989
• Discrete mathematics for computer scienceGary Haggard · 2006
• The bacteriology of the eyeTh Axenfeld · 1908
• Incomplete data and data dependencies in relational databasesSergio Greco · 2012

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Disjunctive normal form In boolean logic, a disjunctive normal form (DNF) is a normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described…
• Boolean satisfiability problem In logic and computer science, the Boolean satisfiability problem (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY…
• Tseytin transformation The Tseytin transformation, alternatively written Tseitin transformation, takes as input an arbitrary combinatorial logic circuit and produces an equisatisfiabl…
• Negation normal form In mathematical logic, a formula is in negation normal form (NNF) if the negation operator ( ¬ {\displaystyle \lnot } , not) is only applied to variables…
• Horn clause In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form that gives it useful properties for use…
• Equisatisfiability In mathematical logic (a subtopic within the field of formal logic), two formulae are equisatisfiable if the first formula is satisfiable whenever the…
• Method of analytic tableaux In proof theory, the semantic tableau (/tæˈbloʊ, ˈtæbloʊ/; plural: tableaux), also called an analytic tableau, truth tree, or simply tree, is a decision…
• MAXEkSAT MAXEkSAT is a problem in computational complexity theory that is a maximization version of the Boolean satisfiability problem 3SAT. In MAXEkSAT, each clause…