{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:41Z","timestamp":1759637921779},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346101"},{"type":"electronic","value":"9783642346118"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34611-8_25","type":"book-chapter","created":{"date-parts":[[2012,10,22]],"date-time":"2012-10-22T04:42:25Z","timestamp":1350880945000},"page":"237-248","source":"Crossref","is-referenced-by-count":1,"title":["Hydras: Directed Hypergraphs and Horn Formulas"],"prefix":"10.1007","author":[{"given":"Robert H.","family":"Sloan","sequence":"first","affiliation":[]},{"given":"Despina","family":"Stasi","sequence":"additional","affiliation":[]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"25_CR1","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Sacc\u00e0, D.: Minimal representation of directed hypergraphs. SIAM J. Comput.\u00a015(2), 418\u2013431 (1986)","journal-title":"SIAM J. Comput."},{"key":"25_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-642-14165-2_38","volume-title":"Automata, Languages and Programming","author":"A. Bhattacharya","year":"2010","unstructured":"Bhattacharya, A., DasGupta, B., Mubayi, D., Tur\u00e1n, G.: On Approximate Horn Formula Minimization. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol.\u00a06198, pp. 438\u2013450. Springer, Heidelberg (2010)"},{"key":"25_CR3","unstructured":"Boros, E., Gruber, A.: Hardness results for approximate pure Horn CNF formulae minimization. In: International Symposium on AI and Mathematics, ISAIM (2012)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0004-3702(93)90062-G","volume":"46","author":"P.L. Hammer","year":"1993","unstructured":"Hammer, P.L., Kogan, A.: Optimal compression of propositional Horn knowledge bases: complexity and approximation. Artificial Intelligence\u00a046, 131\u2013145 (1993)","journal-title":"Artificial Intelligence"},{"key":"25_CR5","unstructured":"Maier, D.: The Theory of Relational Databases. Computer Science Press (1983)"},{"key":"25_CR6","first-page":"5","volume":"95","author":"J. Guigues","year":"1986","unstructured":"Guigues, J., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9es binaires. Math\u00e9matiques et Sciences Humaines\u00a095, 5\u201318 (1986)","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"25_CR7","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Machine Learning\u00a09, 147\u2013164 (1992)","journal-title":"Machine Learning"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10994-011-5248-5","volume":"85","author":"M. Arias","year":"2011","unstructured":"Arias, M., Balc\u00e1zar, J.L.: Construction and learnability of canonical Horn formulas. Machine Learning\u00a085, 273\u2013297 (2011)","journal-title":"Machine Learning"},{"key":"25_CR9","unstructured":"Stasi, D.: Combinatorial Problems in Graph Drawing and Knowledge Representation. PhD thesis, University of Illinois at Chicago (Forthcoming Summer 2012)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(92)90250-Y","volume":"44","author":"P.L. Hammer","year":"1992","unstructured":"Hammer, P.L., Kogan, A.: Horn functions and their DNFs. Inf. Process. Lett.\u00a044, 23\u201329 (1992)","journal-title":"Inf. Process. Lett."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1112\/S0025579300008494","volume":"18","author":"F. Harary","year":"1971","unstructured":"Harary, F., Schwenk, A.: Trees with hamiltonian squares. Mathematika\u00a018, 138\u2013140 (1971)","journal-title":"Mathematika"},{"key":"25_CR12","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (2001)"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0020-0190(95)00163-8","volume":"56","author":"A. Raychaudhuri","year":"1995","unstructured":"Raychaudhuri, A.: The total interval number of a tree and the Hamiltonian completion number of its line graph. Inf. Process. Lett.\u00a056, 299\u2013306 (1995)","journal-title":"Inf. Process. Lett."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(00)00164-2","volume":"79","author":"A. Agnetis","year":"2001","unstructured":"Agnetis, A., Detti, P., Meloni, C., Pacciarelli, D.: A linear algorithm for the Hamiltonian completion number of the line graph of a tree. Inf. Process. Lett.\u00a079, 17\u201324 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"4\/5","key":"25_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","volume":"13","author":"A.A. Bertossi","year":"1981","unstructured":"Bertossi, A.A.: The Edge Hamiltonian Path Problem is NP-complete. Inf. Process. Lett.\u00a013(4\/5), 157\u2013159 (1981)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34611-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:15:33Z","timestamp":1558300533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34611-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346101","9783642346118"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34611-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}