Exceptions-based synthesis of Boolean functions as a core mechanism to perform concept learning

  • Giuliano Armano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 992)


In this paper, an alternative approach to the synthesis of Boolean functions is presented. Such an approach can be useful in the field of concept learning as well, provided that the semantics of non-specified instances is changed accordingly (i.e., from a don't-care to an unknown semantics). The underlying framework relies on the concept of exception, an exception being, for example, a 0 grouped together with 1's while performing the synthesis. It is shown that an exceptions-based synthesis can be adopted as a core mechanism to perform concept learning in an n-dimensional Boolean space. A learning system is sketched where the decision of re-calculating classification rules can be arbitrarily delayed, as new examples, not consistent with the current hypothesis, can be integrated within the system by temporarily storing them as exceptions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Akers, S.B., “Binary Decision Diagrams,” IEEE Trans. on Computers, 27 (6), pp. 509–516, Jun 1978.Google Scholar
  2. [2]
    Bryant, R.E., “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. on Computers, 35 (8), pp. 677–691, Aug 1986.Google Scholar
  3. [3]
    Michalski, R.S., “On the quasi-minimal solution of the general covering problem,” Proc. 5th Int. Symposium on Information Processing, Bled, Yugoslavia, pp. 125–128, 1969.Google Scholar
  4. [4]
    Quinlan, J.R., “Discovering rules from large collections of examples: a case study,” in Michie, D. (Ed.) “Expert systems in the microelectronic age,” Edinburgh University Press, 1979.Google Scholar
  5. [5]
    Rivest, R., “Learning Decision Lists,” Machine Learning, 2, pp. 229–246, 1987.Google Scholar
  6. [6]
    Carbonell, J., Michalski, R.S., and Mitchell, T.M., “An overview of machine learning,” in Machine Learning: An Artificial Intelligence Approach, pp. 3–24, Morgan Kaufmann, 1983.Google Scholar
  7. [7]
    Brayton, R.K., Hachtel, G.D., McMullen C.T., and Sangiovanni-Vincentelli, A.L., “Logic Minimization Algorithms for VLSI Synthesis,” Kluwer, 1984.Google Scholar
  8. [8]
    Reiter, R., “A logic for default reasoning,” Artificial Intelligence, 13, pp. 81–132, 1980.Google Scholar
  9. [9]
    Sandewall, E., “An Approach to the Frame Problem and Its Implementation,” in Machine Intelligence, 7, B. Meltzer and D. Michie (eds.), Edinburgh Univ. Press, Edinburgh, 1972.Google Scholar
  10. [10]
    Pagallo, G., and Haussler, D., “Boolean Feature Discovery in Empirical Learning,” Machine Learning, 5, pp. 71–79, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Giuliano Armano
    • 1
  1. 1.Dept. of Electrical and Electronic EngineeringUniversity of CagliariCagliariItaly

Personalised recommendations