### Abstract

In the PAC-learning, or the query learning model, it has been an important open problem to decide whether the class of DNF and CNF formulas is learnable. Recently, it was pointed out that the problem of PAC-learning for these classes with membership queries can be reduced to that of query learning for the class of A:-quasi Horn formulas with membership and equivalence queries. A k-quasi Horn formula is a CNF formula with each clause containing at most k unnegated literals. In this paper, notions of .F-Horn formulas and l-F-Horn formulas, which are extensions of k-quasi formulas, are introduced, and it is shown that the problem of PAC-learning for DNF and CNF formulas with membership queries can be reduced to that of query learning for l-F-Horn formulas with membership and equivalence queries for an appropriate choice of P. It is shown that under some condition, the class of orthogonal F-Horn formulas is learnable with membership, equivalence and subset queries. Moreover, it is shown that under some condition the class of orthogonal l-F-Horn formulas is learnable with membership and equivalence queries.

Original language | English |
---|---|

Title of host publication | Algorithmic Learning Theory - 6th International Workshop, ALT 1995, Proceedings |

Editors | Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann |

Publisher | Springer Verlag |

Pages | 110-122 |

Number of pages | 13 |

ISBN (Print) | 3540604545, 9783540604549 |

DOIs | |

Publication status | Published - 1995 |

Externally published | Yes |

Event | 6th International Workshop on Algorithmic Learning Theory, ALT 1995 - Fukuoka, Japan Duration: 1995 Oct 18 → 1995 Oct 20 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 997 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 6th International Workshop on Algorithmic Learning Theory, ALT 1995 |
---|---|

Country | Japan |

City | Fukuoka |

Period | 95/10/18 → 95/10/20 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Learning orthogonal F-Horn formulas'. Together they form a unique fingerprint.

## Cite this

*Algorithmic Learning Theory - 6th International Workshop, ALT 1995, Proceedings*(pp. 110-122). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 997). Springer Verlag. https://doi.org/10.1007/3-540-60454-5_32