{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:38Z","timestamp":1725664418384},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540618638"},{"type":"electronic","value":"9783540707196"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61863-5_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:29:33Z","timestamp":1330277373000},"page":"51-58","source":"Crossref","is-referenced-by-count":0,"title":["Learning a representation for optimizable formulas"],"prefix":"10.1007","author":[{"given":"Hans Kleine","family":"B\u00fcning","sequence":"first","affiliation":[]},{"given":"Theodor","family":"Lettmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"H. Aizenstein, L. Hellerstein, L. Pitt: Read-Thrice DNF is Haxd to Learn with Membership and Equivalence Queries, Proc. 31rd Ann. IEEE Symp. on Foundations of Computer Science (1992), 523\u2013532","key":"5_CR1","DOI":"10.1109\/SFCS.1992.267799"},{"key":"5_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin: Queries and Concept Learning, Machine Learning 2 (1988), 319\u2013342","journal-title":"Machine Learning"},{"doi-asserted-by":"crossref","unstructured":"D. Angluin, M. Frazier, L. Pitt: Learning Conjunctions of Horn Clauses, Proc. 31st Ann. IEEE Symp. on Foundations of Computer Science (1990), 186\u2013192","key":"5_CR3","DOI":"10.1109\/FSCS.1990.89537"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0196-6774(80)90007-3","volume":"1","author":"B. Aspvall","year":"1980","unstructured":"B. Aspvall: Recognizing Disguised NR(1) Instances of the Satisfiability Problem, Journal of Algorithms 1 (1980), 97\u2013103","journal-title":"Journal of Algorithms"},{"key":"5_CR5","volume-title":"Technical Report TR 90-1124","author":"R. Chang","year":"1990","unstructured":"R. Chang, J. Kadin: On the Structure of Uniquely Satisfiable Formulas, Technical Report TR 90-1124, Dep. of Comp. Sci., Cornell University, Ithaca, N. Y. (1990)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0019-9958(84)80056-X","volume":"61","author":"S. Even","year":"1984","unstructured":"S. Even, A. Selman, Y. Yacobi: The Complexity of Promise Problems with Applications to Public-Key Cryptography, Information and Control 61 (1984), 114\u2013133","journal-title":"Information and Control"},{"unstructured":"M. Frazier, L. Pitt: Some New Directions in Computational Learning Theory, Proc. 1st European Conf. on Computational Learning Theory (1993), 19\u201332","key":"5_CR7"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(90)90069-A","volume":"36","author":"H. K. B\u00fcning","year":"1990","unstructured":"H. Kleine B\u00fcning: Existence of Simple Propositional Formulas, Information Processing Letters 36 (1990), 177\u2013182","journal-title":"Information Processing Letters"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0890-5401(89)90021-7","volume":"80","author":"H. K. B\u00fcning","year":"1989","unstructured":"H. Kleine B\u00fcning, U. L\u00f6wen: Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility, Information & Computation 80 (1989), 18\u201343","journal-title":"Information & Computation"},{"doi-asserted-by":"crossref","unstructured":"K. Pillaipakkamnatt, V. Raghavan: On the Limits of Proper Learnability of Subclasses of DNF Formulas, Proc. 7th Workshop on Computational Learning Theory (1994), 118\u2013129","key":"5_CR10","DOI":"10.1145\/180139.181063"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61863-5_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:11:11Z","timestamp":1605629471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61863-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618638","9783540707196"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-61863-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}