Prenex normal form

Known as: Prenex form, PRENEX, Matrix (logic) 
A formula of the predicate calculus is in prenex normal form if it is written as a string of quantifiers (referred to as the prefix) followed by a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In a recent work, we introduced an abstraction based algorithm for solving quantified Boolean formulas (QBF) in prenex negation… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
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
We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2010
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
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
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
Various problems in artificial intelligence can be solved by translating them into a quantified boolean formula (QBF) and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2003
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
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
We consider the decision problem for sets of sentences of first-order logic when instead of interpreting function symbols as… (More)
Is this relevant?