{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:14:36Z","timestamp":1754194476422,"version":"3.40.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,11,1]],"date-time":"1998-11-01T00:00:00Z","timestamp":909878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Mathematics and Artificial Intelligence"],"published-print":{"date-parts":[[1998,11]]},"DOI":"10.1023\/a:1018932728409","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"321-343","source":"Crossref","is-referenced-by-count":14,"title":["Horn minimization by iterative decomposition"],"prefix":"10.1007","volume":"23","author":[{"given":"Endre","family":"Boros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Kogan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"325502_CR1","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"G. Ausiello, A. D\u2019Atri and D. Sacca, Minimal representation of directed hypergraphs, SIAM Journal on Computing 15 (1986) 418\u2013431.","journal-title":"SIAM Journal on Computing"},{"key":"325502_CR2","series-title":"RUTCOR Research Report","volume-title":"On the complexity of Horn minimization","author":"E. Boros","year":"1994","unstructured":"E. Boros and O. \u010cepek, On the complexity of Horn minimization, RUTCOR Research Report RRR 1-94, Rutgers University, New Brunswick, NJ (January 1994)."},{"key":"325502_CR3","volume-title":"Structural properties and minimization of Horn Boolean functions","author":"O. \u010cepek","year":"1995","unstructured":"O. \u010cepek, Structural properties and minimization of Horn Boolean functions, Doctoral dissertation, Rutgers University, New Brunswick, NJ (October 1995)."},{"key":"325502_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","volume":"58","author":"R. Dechter","year":"1992","unstructured":"R. Dechter and J. Pearl, Structure identification in relational data, Artificial Intelligence 58 (1992) 237\u2013270.","journal-title":"Artificial Intelligence"},{"key":"325502_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1147\/rd.175.0374","volume":"17","author":"C. Delobel","year":"1973","unstructured":"C. Delobel and R.G. Casey, Decomposition of a data base and the theory of Boolean switching functions, IBM Journal of Research and Development 17 (1973) 374\u2013386.","journal-title":"IBM Journal of Research and Development"},{"key":"325502_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"3","author":"W.F. Dowling","year":"1984","unstructured":"W.F. Dowling and J.H. Gallier, Linear time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 3 (1984) 267\u2013284.","journal-title":"Journal of Logic Programming"},{"key":"325502_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979)."},{"key":"325502_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0020-0190(92)90250-Y","volume":"44","author":"P.L. Hammer","year":"1992","unstructured":"P.L. Hammer and A. Kogan, Horn functions and their DNFs, Information Processing Letters 44 (1992) 23\u201329.","journal-title":"Information Processing Letters"},{"key":"325502_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0004-3702(93)90062-G","volume":"64","author":"P.L. Hammer","year":"1993","unstructured":"P.L. Hammer and A. Kogan, Optimal compression of propositional Horn knowledge bases: Complexity and approximation, Artificial Intelligence 64 (1993) 131\u2013145.","journal-title":"Artificial Intelligence"},{"key":"325502_CR10","first-page":"306","volume-title":"Computers as Our Better Partners, Proceedings of the IISF\/ACM Japan International Symposium","author":"P.L. Hammer","year":"1994","unstructured":"P.L. Hammer and A. Kogan, Knowledge compression\u2013logic minimization for expert systems, in: Computers as Our Better Partners, Proceedings of the IISF\/ACM Japan International Symposium (World Scientific, Singapore, 1994) pp. 306\u2013312."},{"issue":"5","key":"325502_CR11","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1109\/69.469822","volume":"7","author":"P.L. Hammer","year":"1995","unstructured":"P.L. Hammer and A. Kogan, Quasi-acyclic propositional Horn knowledge bases: Optimal compression, IEEE Transactions on Knowledge and Data Engineering 7(5) (1995) 751\u2013762.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"325502_CR12","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/0743-1066(87)90014-8","volume":"4","author":"A. Itai","year":"1987","unstructured":"A. Itai and J.A. Makowsky, Unification as a complexity measure for logic programming, Journal of Logic Programming 4 (1987) 105\u2013117.","journal-title":"Journal of Logic Programming"},{"key":"325502_CR13","volume-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"D.E. Knuth","year":"1968","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 1, Fundamental Algorithms(Addison-Wesley, Reading, MA, 1968) (second edition 1973).","edition":"second edition"},{"key":"325502_CR14","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D. Maier","year":"1980","unstructured":"D. Maier, Minimal covers in the relational database model, Journal of the ACM 27 (1980) 664\u2013674.","journal-title":"Journal of the ACM"},{"key":"325502_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(88)90124-X","volume":"29","author":"M. Minoux","year":"1988","unstructured":"M. Minoux, LTUR: A simplified linear time unit resolution algorithm for Horn formulae and computer implementation, Information Processing Letters 29 (1988) 1\u201312.","journal-title":"Information Processing Letters"},{"key":"325502_CR16","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"2","author":"R.E. Tarjan","year":"1972","unstructured":"R.E. Tarjan, Depth first search and linear graph algorithms, SIAM Journal on Computing 2 (1972) 146\u2013160.","journal-title":"SIAM Journal on Computing"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018932728409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018932728409\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018932728409.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:30:53Z","timestamp":1747546253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018932728409"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":16,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["325502"],"URL":"https:\/\/doi.org\/10.1023\/a:1018932728409","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}