On generalized constraints and certificates

Discrete Mathematics

Volumn 226, Issue 1-3, 2001, Pages 211-232

  Hellerstein, Lisa ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Boolean functions; Certificates of non membership; Constraints; Galois theory; Minors

Indexed keywords

EID: 3142610318     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00166-7     Document Type: Article

References (26)

1. V.G. Bodnarchuk, L.A. Kaluzhinin, V.N. Kotov, B.A. Romov, Galois theory for Post algebras. I, II Cybernetics 5 (1969) 243-252, 531-539.
2. O. Ekin, S. Foldes, P.L. Hammer, L. Hellerstein, Equational theories of Boolean functions, Discrete Math. 211 (2000) 27-51.
3. C.C. Elgot, Truth functions realizable by single threshold organs, AIEE Conference Paper 60-1311, October 1960, Revised November 1960.
4. C.J. Everett, Closure operations and Galois theory in lattices, Trans. AMS 55 (1944) 514-525.
5. A. Feigelson, On Boolean functions and their orientations: learning, monotone dimension, and certificates, Ph.D. Thesis, Department of Electrical and Computer Engineering, Northwestern University, 1998.
6. A. Feigelson, L. Hellerstein, The forbidden projections of unate functions, Discrete Appl. Math. 77 (1997) 221-236.
7. A. Feigelson, L. Hellerstein, Conjunctions of unate DNF formulas, Inform, and Comput. 140 (2) (1998) 203-228.
8. S. Foldes, Fundamental Structures of Algebra and Discrete Mathematics, Wiley, New York, 1994.
9. D. Geiger, Closed systems of functions and predicates, Pacific J. Math. 27 (1968) 95-100.
10. T. Hegedüs, Generalized teaching dimensions and the query complexity of learning, Proceedings of the Eighth Annual Conference on Computational Learning Theory, ACM Press, New York, 1995, pp. 108-117.
11. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, D. Wilkins, How many queries are needed to learn? J. Assoc. Comput. Mach. 43 (5) (1996) 840-862.
12. G. Higman, Ordering by divisibility in abstract algebras, Proc. London Math. Soc. 2 (3) (1956) 326-336.
13. S.T. Hu, Threshold Logic, Univ. of California Press, Berkeley, CA, 1965.
14. P. Kirchberger, Über Tschebyecheffsche Annaherungsmethoden, Math. Ann. 57 (1903) 509-540.
15. S. Lay, Convex Sets and their Applications, Wiley, New York, 1982.
16. W. Maass, G. Turan, On the complexity of learning from counterexamples (Extended Abstract), Proceedings of the 30th Annual Symposium on Foundations of Computer Science, ACM Press, New York, 1989, pp. 262-267.
17. C.St.J.A. Nash-Williams, On well-quasi-ordering finite trees, Proc. Cambridge Philos. Soc. 59 (1963) 833-835.
18. Ø. Ore, Galois Connexions, Trans. AMS 55 (1944) 493-513.
19. N. Pippenger, Theories of Computability, Cambridge University Press, Cambridge, 1997.
20. N. Pippenger, Galois theory for minors of finite functions, UBC Computer Science Department Technical Report 98-08.
21. C. Wang, Boolean minors, Discrete Math. 141 (1995) 237-258.
22. C. Wang, A.C. Williams, The threshold order of a Boolean function, Discrete Appl. Math. 31 (1991) 51-69.
23. M. Ward, The closure operators of a lattice, Ann. Math. 43 (1942) 191-196.
24. R.O. Winder, More about threshold logic, Switching Circuit Theory and Logical Design, 1961, pp. 55-64.
25. R.O. Winder, Fundamentals of threshold logic, in: J.T. Tou (Ed.), Applied Automata Theory, Academic Press, New York, 1968, pp. 235-318.
26. R.O. Winder, Threshold Logic, Doctoral dissertation, Mathematics Department, Princeton University, May, 1962.