Skip to main content
SpringerLink
Log in

Inference of Monotone Boolean Functions

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Inference of Monotone Boolean Functions

The Shannon Function and the Hansel Theorem

Hansel Chains

Devising a Smart Question-Asking Strategy

Conclusions

See also

References

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alekseev DVB (1988) Monotone Boolean functions. Encycl. Math., vol 6. Kluwer, Dordrecht, 306–307

    Google Scholar 

  2. Bioch JC, Ibaraki T (1995) Complexity of identifixation and dualization of positive Boolean functions. Inform and Comput 123:50–63

    Article  MathSciNet  MATH  Google Scholar 

  3. Boros E, Hammer PL, Ibaraki T, Kawakami K (1997) Polynomial-time recognition of 2-monotonic positive Boolean functions given by an oracle. SIAM J Comput 26(1):93–109

    Article  MathSciNet  MATH  Google Scholar 

  4. Church R (1940) Numerical analysis of certain free distributive structures. J Duke Math 9:732–734

    Article  MathSciNet  Google Scholar 

  5. Church R (1965) Enumeration by rank of the elements of the free distributive lattice with 7 generators. Notices Amer Math Soc 12:724

    Google Scholar 

  6. Dedekind R (1897) Ueber Zerlegungen von Zahlen durch ihre grössten gemeinsamen Teiler. Festchrift Hoch Braunschweig u Ges Werke, II:103–148

    Google Scholar 

  7. Eiter T, Gottlob G (1995) Identifying the minimal transversals of a hybergraph and related problems. SIAM J Comput 24(6):1278–1304

    Article  MathSciNet  Google Scholar 

  8. Fredman ML, Khachiyan L (1996) On the complexity of dualization of monotone disjunctive normal forms. J Algorithms 21:618–628

    Article  MathSciNet  MATH  Google Scholar 

  9. Gainanov DN (1984) On one criterion of the optimality of an algorithm for evaluating monotonic Boolean functions. USSR Comput Math Math Phys 24(4):176– 181

    Article  MathSciNet  Google Scholar 

  10. Gorbunov Y, Kovalerchuk B (1982) An interactive method of monotone Boolean function restoration. J Acad Sci USSR Eng 2:3–6 (in Russian.)

    Google Scholar 

  11. Hansel G (1966) Sur le nombre des fonctions Boolenes monotones den variables. CR Acad Sci Paris 262(20):1088–1090

    MathSciNet  Google Scholar 

  12. Kleitman D (1969) On Dedekind's problem: The number of monotone Boolean functions. Proc Amer Math Soc 21(3):677–682

    Article  MathSciNet  MATH  Google Scholar 

  13. Kleitman D, Markowsky G (1975) On Dedekind's problem: The number of isotone Boolean functions. II. Trans Amer Math Soc 213:373–390

    Article  MathSciNet  MATH  Google Scholar 

  14. Korobkov VK (1965) On monotone functions of the algebra of logic. Probl Kibernet 13:5–28 (in Russian.)

    MathSciNet  Google Scholar 

  15. Korshunov AD (1981) On the number of monotone Boolean functions. Probl Kibernet 38:5–108 (in Russian.)

    MathSciNet  Google Scholar 

  16. Kovalerchuk B, Triantaphyllou E, Deshpande AS, Vityaev E (1996) Interactive learning of monotone Boolean functions. Inform Sci 94(1–4):87–118

    Article  Google Scholar 

  17. Kovalerchuk B, Triantaphyllou E, Vityaev E (1995) Monotone Boolean functions learning techniques integrated with user interaction. Proc Workshop Learning from Examples vs Programming by Demonstrations: Tahoe City, pp 41–48

    Google Scholar 

  18. Makino K, Ibaraki T (1997) The maximum latency and identification of positive Boolean functions. SIAM J Comput 26(5):1363–1383

    Article  MathSciNet  MATH  Google Scholar 

  19. Neapolitan R, Naimipour K (1996) Foundations of algorithms. D.C. Heath, Lexington, MA

    Google Scholar 

  20. Peysakh J (1987) A fast algorithm to convert Boolean expressions into CNF. Techn Report IBM Comput Sci RC 12913(57971)

    Google Scholar 

  21. Rudeanu S (1974) Boolean functions and equations. North-Holland, Amsterdam

    MATH  Google Scholar 

  22. Schneeweiss WG (1989) Boolean functions: With engineering applications and computer applications. Springer, Berlin

    MATH  Google Scholar 

  23. Schneeweiss WG (1996) A necessary and sufficient criterion for the monotonicity of Boolean functions with deterministic and stochastic applications. IEEE Trans Comput 45(11):1300–1302

    Article  MathSciNet  MATH  Google Scholar 

  24. Shmulevich I (1997) Properties and applications of monotone Boolean functions and stack filters. PhD Thesis, Dept. Electrical Engin. Purdue Univ. http://shay.ecn.purdue.edu/~shmulevi/

  25. Sokolov NA (1982) On the optimal evaluation of monotonic Boolean functions. USSR Comput Math Math Phys 22(2):207–220

    Article  MATH  Google Scholar 

  26. Torvik VI, Triantaphyllou E (2000) Minimizing the average query complexity of learning monotone Boolean functions. Working Paper Dept Industrial and Manuf Syst Engin, Louisiana State Univ

    Google Scholar 

  27. Triantaphyllou E, Lu J (1998) The knowledge acquisition problem in monotone Boolean systems. Encycl. Computer Sci. and Techn. In: Kent A, Williams JG (eds) MD

    Google Scholar 

  28. Ward M (1946) Note on the order of free distributive lattices. Bull Amer Math Soc no. Abstract 135 52:423

    MathSciNet  Google Scholar 

  29. Wiedemann D (1991) A computation of the eight Dedekind number. Order 8:5–6

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Industrial and Manufacturing Systems Engineering, Louisiana State University, Baton Rouge, USA

    Vetle I. Torvik & Evangelos Triantaphyllou

Authors
  1. Vetle I. Torvik
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Evangelos Triantaphyllou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Torvik, V.I., Triantaphyllou, E. (2008). Inference of Monotone Boolean Functions . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_279

Download citation

Publish with us

Policies and ethics

Search

Navigation