# Prenex normal form

## Papers overview

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

2016

2016

- SAT
- 2016

In a recent work, we introduced an abstraction based algorithm for solving quantified Boolean formulas (QBF) in prenex negationâ€¦Â (More)

Is this relevant?

2014

2014

- 2014

The method of structured prograrnming or program development using top-down, stepwise refinement technique, provides a systematicâ€¦Â (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- SAT
- 2010

We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make twoâ€¦Â (More)

Is this relevant?

2010

2010

- CSL
- 2010

First order GÃ¶del logic Gâˆž, enriched with the projection operator 4â€”in contrast to other important t-norm based fuzzy logicsâ€¦Â (More)

Is this relevant?

2008

2008

- Fuzzy Sets and Systems
- 2008

In this paper, Yingâ€™s prenex normal form theorem for linguistic quantifiers is strengthened so that it behaves like the one inâ€¦Â (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?

2008

2008

- Constraints
- 2008

Various problems in artificial intelligence can be solved by translating them into a quantified boolean formula (QBF) andâ€¦Â (More)

Is this relevant?

2003

2003

- Foundations of Computational Mathematics
- 2003

Elimination theory was at the origin of algebraic geometry in the nineteenth century and now deals with the algorithmic solvingâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- CVPR
- 1998

In this paper we develop a representation for the temporal structure inherent in human actions and demonstrate an eeective methodâ€¦Â (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- Arch. Math. Log.
- 1980

We consider the decision problem for sets of sentences of first-order logic when instead of interpreting function symbols asâ€¦Â (More)

Is this relevant?