Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
conjunctive normal form
Description:
A representation of a Boolean formula as a conjunction of clauses, each clause consisting of disjunctive literals.
Related topics:
Constraint Satisfaction and Optimization (16%),
Logic, Reasoning, and Knowledge (10%),
Formal Methods in Verification (9%),
Advanced Graph Theory Research (9%),
Complexity and Algorithms in Graphs (7%)
Wikidata ID:
wiki/Q846564
OpenAlex ID:
keywords/conjunctive-normal-form
The complexity of satisfiability problems
1978
·
Thomas J. Schaefer
·
ACM Symposium on Theory of Computing (STOC)
·
2,441
PDF
A linear-time algorithm for testing the truth of certain quantified boolean formulas
1979
·
Bengt Aspvall
, Michael F. Plass
, et al.
·
Information Processing Letters
·
1,087
Boolean Functions: Theory, Algorithms, and Applications
2011
·
Yves Crama
, Peter L. Hammer
·
Cambridge University Press eBooks
·
630
PDF
On probabilistic inference by weighted model counting
2007
·
Mark Chavira
, Adnan Darwiche
·
Artificial Intelligence
·
535
PDF
Recent Advances in AI Planning
1999
·
Daniel S. Weld
·
AI Magazine
·
532
Feedback control of petri nets based on place invariants
1996
·
Katerina Yamalidou
, John Moody
, et al.
·
Automatica
·
493
PDF
Applying SAT Methods in Unbounded Symbolic Model Checking
2002
·
Ken L. McMillan
·
Lecture notes in computer science
·
398
PDF
Mick gets some (the odds are on his side) (satisfiability)
1992
·
V. Chvatal
, B. Reed
·
Annual Symposium on Foundations of Computer Science
·
350
Logic-based MINLP algorithms for the optimal synthesis of process networks
1996
·
Metin Türkay
, Ignacio E. Grossmann
·
Computers & Chemical Engineering
·
341
Solving satisfiability in less than 2n steps
1985
·
B. Monien
, E. Speckenmeyer
·
Discrete Applied Mathematics
·
291
On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
2001
·
Adnan Darwiche
·
Journal of Applied Non-Classical Logics
·
273
Negative Results for Equivalence Queries
1990
·
Dana Angluin
·
Machine Learning
·
259
PDF
Mick Gets Some (the Odds Are on His Side)
1992
·
Vašek Chvátal
, Bruce A. Reed
·
OpenGrey (Institut de l'Information Scientifique et Technique)
·
246
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
1996
·
Alan Frieze
, Stephen Suen
·
Journal of Algorithms
·
241
Mechanical Theorem-Proving by Model Elimination
1968
·
Donald W. Loveland
·
Journal of the ACM
·
215
PDF
Computational aspects of monotone dualization: A brief survey
2007
·
Thomas Eiter
, Kazuhisa Makino
, et al.
·
Discrete Applied Mathematics
·
198
PDF
Search rearrangement backtracking and polynomial average time
1983
·
Paul Walton Purdom
·
Artificial Intelligence
·
179
Boolean Decision Rules via Column Generation
2018
·
Dash, Sanjeeb
, Günlük, Oktay
, et al.
·
arXiv (Cornell University)
·
175
PDF
Exact Learning Boolean Functions via the Monotone Theory
1995
·
N.H. Bshouty
·
Information and Computation
·
174
A linear-time transformation of linear inequalities into conjunctive normal form
1998
·
Joost P. Warners
·
Information Processing Letters
·
173
Sudoku as a SAT Problem.
2006
·
Inês Lynce
, Joël Ouaknine
·
ISAIM
·
160
Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
2018
·
Arturs Backurs
, Piotr Indyk
·
SIAM Journal on Computing
·
157
PDF
Hex ist PSPACE-vollst�ndig
1981
·
Stefan Reisch
·
Acta Informatica
·
153
Efficient symmetry breaking for Boolean satisfiability
2006
·
F.A. Aloul
, K.A. Sakallah
, et al.
·
IEEE Transactions on Computers
·
142
On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing
2021
·
Stuart Hadfield
·
ACM Transactions on Quantum Computing
·
139
PDF
Show more works
View as search
Works count:
1,091
Citation count:
17,170
Year
Topic
Type