R. McNaughton, Unate truth functions, IRE Transactions on Electronic Computers (March 1961) 1--6. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lower Bounds on Identification Criteria for Perceptron-like.. - Schmitt (1996) (1 citation) (Correct)
....function is unate has been given by [ Paull and McCluskey, Jr. 1960 ] For non degenerate threshold functions they have also established a relationship between the property of being positive, resp. negative, in x i and the sign of weight w i . We quote the result, which can also be found in [ McNaughton, 1961, Theorem 3.2 ] without proof. Lemma 2 [ Paull and McCluskey, Jr. 1960, Theorem 1 ] Every Boolean threshold function is unate. Let f : f0; 1g f0; 1g be non degenerate and represented by (w 1 ; wn 1 ) Then f is positive (negative) in x i iff w i 0 (w i 0) Unateness implies ....
Robert McNaughton. Unate truth functions. IRE Transactions on Electronic Computers, 10:1--6, 1961.
The Forbidden Projections of Unate Functions - Feigelson, Hellerstein (1997) (Correct)
....= 1 ) f(a x 0 ) 1. The function f is unate in x if it is either monotone or anti monotone in x. A Boolean function is monotone if it is monotone in all its input variables. It is unate if it is unate in all its input variables. Unate functions have been studied extensively in switching theory [6, 7]. More recently, they have been exploited in the development of algorithms in computational learning theory [1, 3] The class of monotone Boolean functions has a simple characterization in terms of forbidden projections. The class consists of exactly those functions that do not have any ....
R. McNaughton, Unate truth functions, IRE Transactions on Electronic Computers (March 1961) 1--6.
The Forbidden Projections of Unate Functions - Aaron Feigelson Lisa (1997) Self-citation (Functions) (Correct)
....= 1 ) f(a x 0 ) 1. The function f is unate in x if it is either monotone or anti monotone in x. A Boolean function is monotone if it is monotone in all its input variables. It is unate if it is unate in all its input variables. Unate functions have been studied extensively in switching theory [6, 7]. More recently, they have been exploited in the development of algorithms in computational learning theory [1, 3] The class of monotone Boolean functions has a simple characterization in terms of forbidden projections. The class consists of exactly those functions that do not have any ....
R. McNaughton, Unate truth functions, IRE Transactions on Electronic Computers (March 1961) 1--6.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC