Skip to search formSkip to main contentSkip to account menu

Well-formed formula

Known as: Layman Allen, Well-formed, Formula (logics) 
In mathematical logic, a well-formed formula, abbreviated wff, often simply formula, is a finite sequence of symbols from a given alphabet that is… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2018
Highly Cited
2018
Inorganic carbonate in soil occurs predominantly as the sparingly soluble alkaline-earth carbonates, calcite (CaCOs) and dolomite… 
Highly Cited
2016
Highly Cited
2016
The standard recurrent neural network language model (RNNLM) generates sentences one word at a time and does not work from an… 
Highly Cited
2016
Highly Cited
2016
This paper presents our recent work on the design and development of a new, large scale dataset, which we name MS MARCO, for… 
Highly Cited
2014
Highly Cited
2014
In this paper, we propose a novel neural network model called RNN Encoder‐ Decoder that consists of two recurrent neural networks… 
Highly Cited
2013
Highly Cited
2013
The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a… 
Highly Cited
2008
Highly Cited
2008
Fuzz testing is an effective technique for finding security vulnerabilities in software. Traditionally, fuzz testing tools apply… 
Highly Cited
1997
Highly Cited
1997
The advent of ever more complex reactive systems in increasingly critical areas calls for the development of automated verication… 
Highly Cited
1984
Highly Cited
1984
  • H. Levesque
  • AAAI Conference on Artificial Intelligence
  • 1984
  • Corpus ID: 2993501
As part of an on-going project to understand the foundations of Knowledge Representation, we are attempting to characterize a… 
Highly Cited
1966
Highly Cited
1966
Highly Cited
1963