ML Anthology

Learning a Representation for Optimizable Formulas

Hans Kleine Büning, Theodor Lettmann
ALT 1996 pp. 51-58
doi:10.1007/3-540-61863-5_33 /alt/1996/buning1996alt-learning/

Abstract

Roughly speaking, a class of formulas K is called optimizable, if there is a class K ′, such that for each formula in K there exists a short equivalent formula in K ′, where the deduction problem of K ′ is solvable in polynomial time. We consider the problem, whether for such classes an optimized representation can be learned using membership, equivalence and clause queries.

PDF ALT Semantic Scholar

Cite

Text

Büning and Lettmann. "Learning a Representation for Optimizable Formulas." International Conference on Algorithmic Learning Theory, 1996. doi:10.1007/3-540-61863-5_33

Markdown

[Büning and Lettmann. "Learning a Representation for Optimizable Formulas." International Conference on Algorithmic Learning Theory, 1996.](https://mlanthology.org/alt/1996/buning1996alt-learning/) doi:10.1007/3-540-61863-5_33

BibTeX

@inproceedings{buning1996alt-learning,
  title     = {{Learning a Representation for Optimizable Formulas}},
  author    = {Büning, Hans Kleine and Lettmann, Theodor},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1996},
  pages     = {51-58},
  doi       = {10.1007/3-540-61863-5_33},
  url       = {https://mlanthology.org/alt/1996/buning1996alt-learning/}
}