Friday, November 5, 2010

2010-11-05 Learning Horn Formulas, continued

In this class we reviewed some important aspects of Horn formulas, introduced the algorithm by Angluin, Frazier and Pitt that learns Horn formulas, and proved its correctness. The original article can be found here.

Exercise 13: Simulate the AFP algorithm that learns Horn formulas,
assuming n=5, and the counterexamples you receive are:
01011,11100,00001,00011,01011,00011,00110,00011,01110,10010,00011,
01110,01010,00011,01110,01111,00011,01110,01111,00011,01110,11111.
For answering membership queries, assume that 00000, 01000, 00100,
00010, 10000 are positive, and 00001, 01010, 01100 are negative.

No comments:

Post a Comment