Skip to search formSkip to main contentSkip to account menu

Skolem normal form

Known as: Skolem prenex form, Skolem Standard Form, Skolemization 
In mathematical logic, reduction to Skolem normal form (SNF) is a method for removing existential quantifiers from formal logic statements, often… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Automated theorem provingClause (logic)Conjunctive normal formDrinker paradox

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
A PROTOCLUSTER AT z = 2.45
We present the spectroscopic confirmation of a z = 2.45 protocluster. Its member galaxies lie within a radius of 1.4 Mpc… 
2013
2013
PHYSIOCHEMICAL CHARACTERISTICS OF VARIOUS RAW MILK SAMPLES IN A SELECTED DAIRY PLANT OF BANGLADESH
The study was conducted to evaluate physiochemical quality of raw milk sample in selected dairy plant of Bangladesh. Various… 
2012
2012
What good are strong specifications?
Experience with lightweight formal methods suggests that programmers are willing to write specification if it brings tangible… 
Highly Cited
2010
Highly Cited
2010
Tumor and Stem Cell Biology Cancer Research BRD 7 , a Subunit of SWI / SNF Complexes , Binds Directly to BRCA 1 and Regulates BRCA 1-Dependent Transcription
Authors' A Queens Un Correspon cer Resea Road, Belf 44-28-909 and d.hark 
Highly Cited
2010
Highly Cited
2010
First operation of a double phase LAr Large Electron Multiplier Time Projection Chamber with a 2D projective readout anode
2006
2006
Measurements from an 802.11b mobile ad hoc network
This paper analyzes the characteristics of a multi-hop 802.11b mobile ad hoc network. We present data gathered from a mobile… 
Highly Cited
2006
Highly Cited
2006
Cyclic strain hardening of nanocrystalline nickel
2003
2003
The split naming/forwarding network architecture
The evolution of the Internet is inhibited by the routing system's lack of ability to provide instant routes at host granularity… 
Highly Cited
1993
Highly Cited
1993
The Even More Liberalized delta-Rule in Free Variable Semantic Tableaux
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… 
Highly Cited
1990
Highly Cited
1990
A Semi-Functional Implementation of a Higher-Order Logic Programming Language
In this chapter we develop an interpreter of a higher-order constraint logic programming language in Standard ML (SML). The logic… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)