𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Learning conjunctions of Horn clauses

✍ Scribed by Angluin, Dana; Frazier, Michael; Pitt, Leonard

Book ID
118772092
Publisher
Springer
Year
1992
Tongue
English
Weight
1018 KB
Volume
9
Category
Article
ISSN
0885-6125

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The horn basis of a set of clauses
The horn basis of a set of clauses
✍ Jean-Jacques HΓ©brard; Philippe Luquet πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 425 KB

We formalize the idea that a set of propositional clauses that is not Horn-renamable can still be partially so. We show that for any finite set of clauses S defined on a set of variables V, there exists a largest subset U of V, with regard to inclusion, such that S is Horn-renamable with respect to

Learning of Short Boolean Conjunctions f
Learning of Short Boolean Conjunctions from Negative Examples
✍ Tatsuie Tsukiji; Takashi Tokutani πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 164 KB

## Abstract Learning from examples in the presence of overwhelmingly many irrelevant variables has been studied in the field of machine learning theory, where the learner is required to derive as succinct hypotheses as possible. In this paper, we consider the following computational learning proble