Functional completeness

Known as: Adequacy, Complete set of Boolean operators, Sole sufficient operator 
In logic, a functionally complete set of logical connectives or Boolean operators is one which can be used to express all possible truth tables by… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1954-2017
02040608019542016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
This paper describes Meteor 1.3, our submission to the 2011 EMNLP Workshop on Statistical Machine Translation automatic… (More)
  • table 1
  • table 2
  • table 3
  • table 5
  • table 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Automatic Machine Translation (MT) evaluation metrics have traditionally been evaluated by the correlation of the scores they… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Wind energy is considered to be a very promising alternative for power generation because of its tremendous environmental, social… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • table II
Is this relevant?
2007
2007
Consider a partially ordered set(T <,=), where T is non-empty,< is an irreflexive and transitive relation on T and = is equality… (More)
Is this relevant?
2001
2001
The main goal of the work presented in this paper is to find an inexpensive and automatable way of predicting rankings of MT… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
This technical report presents the main features of Proteum (Program Testing Using Mutants), a testing tool that supports… (More)
  • figure 3.2
  • figure 3.3
  • figure 3.4
  • figure 3.5
  • figure 3.6
Is this relevant?
1995
1995
In this paper functional completeness results are obtained for certain positive and constructive propositional logics associated… (More)
Is this relevant?
1992
1992
A definition of completeness in the context of Object Oriented Databases (OODBs) is proposed in this paper. It takes into account… (More)
Is this relevant?
1990
1990
The paper provides a new proof, in a style accessible to modern logicians and teachers of elementary logic, of Post's Functional… (More)
Is this relevant?
1990
1990
Functional languages are based on the notion of application: programs may be applied to data or programs. By application one may… (More)
Is this relevant?