Probabilistic Approximate Identification

  • Philip D. Laird
Part of the The Kluwer International Series in Engineering and Computer Sciences book series (SECS, volume 47)


In this chapter and the next, we shall adopt a different model of identification in order to focus on two of the weaknesses of the preceding theory: the lack of robustness, and the lack of a complexity measure.


Conjunctive Normal Form Infinite Process Optimal Decision Tree Algorithm Halt Satisfying Truth Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1988

Authors and Affiliations

  • Philip D. Laird
    • 1
  1. 1.NASA Ames Research CenterUSA

Personalised recommendations