Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
We present a survey of the literature on indexing and retrieval of mathematical knowledge, with pointers to 77 papers and… 
Highly Cited
2015
Highly Cited
2015
Algorithms based on the enumeration of implicit hitting sets find a growing number of applications, which include maximum… 
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… 
Highly Cited
2005
Highly Cited
2005
We propose a novel method to detect events involving multiple agents in a video and to learn their structure in terms of… 
Highly Cited
2000
Highly Cited
2000
Highly Cited
1998
Highly Cited
1998
In this paper we develop a representation for the temporal structure inherent in human actions and demonstrate an effective… 
Highly Cited
1996
Highly Cited
1996
We describe the proper name recognition and classification facility ("PNV') of the SPARSER natural language understanding system… 
Highly Cited
1993
Highly Cited
1993
In this paper we have a closer look at one of the rules of the tableau calculus presented in [3], called the δ-rule, and the… 
Review
1985
Review
1985
PART ONE: HISTORY AND THEORY FOR THE TREATMENT OF PHYSICAL DYSFUNCTION Occupational performance and models for practice for… 
Highly Cited
1979
Highly Cited
1979
Solvable Classes of Quantificational Formulas Burton Dreben and Warren D. Goldfarb, Harvard Univ. Skolem and Herbrand addressed…