# Conjunctive normal form

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Encyclopedia of Machine Learning and Data Mining
- 2017

âˆ€x (Â¬P(x) âˆ¨ (âˆ€y (Â¬P(y) âˆ¨ P(f(x,y))) âˆ§ Â¬âˆ€y (Â¬Q(x,y) âˆ¨ P(y)))) 3. Reduce scope of negation âˆ€x (Â¬P(x) âˆ¨ (âˆ€y (Â¬P(y) âˆ¨ P(f(x,y))) âˆ§ âˆƒyâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

The solution to get this book is that we don't over you the free book. But, we offer you the free information about principles ofâ€¦Â (More)

Is this relevant?

2006

2006

- FCS
- 2006

There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paperâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- J. Algorithms
- 2005

We consider the satisfiability problem on Boolean formulas in conjunctive normal form. We that a satisfying assignment of aâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- ECAI
- 2004

We describe a new algorithm for compiling conjunctive normal form (CNF) into Deterministic Decomposable Negation Normal (d-DNNFâ€¦Â (More)

Is this relevant?

2003

2003

- Discrete Applied Mathematics
- 2003

We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If Ï† : H â†’ F is aâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- AAAI/IAAI
- 2002

We present a compiler for converting CNF formulas into deterministic, decomposable negation normal form (d-DNNF). This is aâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- J. ACM
- 2001

Knowledge compilation has been emerging recently as a new direction of research for dealing with the computational intractabilityâ€¦Â (More)

Is this relevant?

2000

2000

- Discrete Applied Mathematics
- 2000

After showing that every pseudo-Boolean function (i.e. real-valued function with binary variables) can be represented by aâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Inf. Process. Lett.
- 1998

REPORTRAPPORT A linear-time transformation of linear inequalities into conjunctive normal form Abstract We present a techniqueâ€¦Â (More)

Is this relevant?