{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:32:41Z","timestamp":1648690361564},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10472-011-9263-9","type":"journal-article","created":{"date-parts":[[2011,11,11]],"date-time":"2011-11-11T15:12:11Z","timestamp":1321024331000},"page":"231-244","source":"Crossref","is-referenced-by-count":0,"title":["Disjoint essential sets of implicates of a CQ Horn function"],"prefix":"10.1007","volume":"61","author":[{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr","family":"Ku\u010dera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,12]]},"reference":[{"issue":"2","key":"9263_CR1","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Sacca, D.: Minimal representation of directed hypergraphs. SIAM J. Comput. 15(2), 418\u2013431 (1986)","journal-title":"SIAM J. Comput."},{"key":"9263_CR2","unstructured":"Boros, E., \u010cepek, O.: On the complexity of Horn minimization. Tech. Rep. RUTCOR Research Report\u00a0RRR\u00a01-1994, Rutgers University, New Brunswick, NJ (1994)"},{"key":"9263_CR3","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018932728409","volume":"23","author":"E Boros","year":"1998","unstructured":"Boros, E., \u010cepek, O., Kogan, A.: Horn minimization by iterative decomposition. Ann. Math. Artif. Intell. 23, 321\u2013343 (1998)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"2","key":"9263_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.dam.2009.08.012","volume":"158","author":"E Boros","year":"2010","unstructured":"Boros, E., \u010cepek, O., Kogan, A., Ku\u010dera, P.: Exclusive and essential sets of implicates of Boolean functions. Discrete Appl. Math. 158(2), 81\u201396 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"3\u20134","key":"9263_CR5","first-page":"249","volume":"57","author":"E Boros","year":"2010","unstructured":"Boros, E., \u010cepek, O., Kogan, A., Ku\u010dera, P.: A subclass of Horn cnfs optimally compressible in polynomial time. Ann. Math. Artif. Intell. 57(3\u20134), 249\u2013291 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9263_CR6","volume-title":"Propositional Logic: Deduction and Algorithms","author":"HK B\u00fcning","year":"1999","unstructured":"B\u00fcning, H.K., Letterman, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, New York, NY (1999)"},{"key":"9263_CR7","unstructured":"\u010cepek, O.: Structural properties and minimization of Horn Boolean functions. Ph.D. thesis, Rutgers University, New Brunswick, NJ (1995)"},{"key":"9263_CR8","doi-asserted-by":"crossref","unstructured":"\u010cepek, O., Ku\u010dera, P., Savick\u00fd, P.: Boolean functions with a simple certificate for CNF complexity. Discrete Applied Mathematics (2011, in print, available online)","DOI":"10.1016\/j.dam.2011.05.013"},{"key":"9263_CR9","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0004-3702(92)90009-M","volume":"58","author":"R Dechter","year":"1992","unstructured":"Dechter, R., Pearl, J.: Structure identification in relational data. Artif. Intell. 58, 237\u2013270 (1992)","journal-title":"Artif. Intell."},{"key":"9263_CR10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1147\/rd.175.0374","volume":"17","author":"C Delobel","year":"1973","unstructured":"Delobel, C., Casey, R.: Decomposition of a data base and the theory of Boolean switching functions. IBM J. Res. Develop. 17, 374\u2013386 (1973)","journal-title":"IBM J. Res. Develop."},{"key":"9263_CR11","volume-title":"Logical Foundations of Artificial Intelligence","author":"M Genesereth","year":"1987","unstructured":"Genesereth, M., Nilsson, N.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Los Altos, CA (1987)"},{"key":"9263_CR12","first-page":"23","volume":"44","author":"P Hammer","year":"1992","unstructured":"Hammer, P., Kogan, A.: Horn functions and their DNFs. IBM J. Res. Develop. 44, 23\u201329 (1992)","journal-title":"IBM J. Res. Develop."},{"key":"9263_CR13","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(93)90062-G","volume":"64","author":"P Hammer","year":"1993","unstructured":"Hammer, P., Kogan, A.: Optimal compression of propositional Horn knowledge bases: complexity and approximation. Artif. Intell. 64, 131\u2013145 (1993)","journal-title":"Artif. Intell."},{"key":"9263_CR14","unstructured":"Hammer, P., Kogan, A.: Knowledge compression\u2014logic minimization for expert systems. In: Computers as our Better Partners. Proceedings of the IISF\/ACM Japan International Symposium, pp. 306\u2013312. World Scientific, Singapore (1994)"},{"issue":"5","key":"9263_CR15","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1109\/69.469822","volume":"7","author":"P Hammer","year":"1995","unstructured":"Hammer, P., Kogan, A.: Quasi-acyclic propositional Horn knowledge bases: optimal compression. IEEE Trans. Knowl. Data Eng. 7(5), 751\u2013762 (1995)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9263_CR16","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322217.322223","volume":"27","author":"D Maier","year":"1980","unstructured":"Maier, D.: Minimal covers in the relational database model. JACM 27, 664\u2013674 (1980)","journal-title":"JACM"},{"key":"9263_CR17","doi-asserted-by":"crossref","first-page":"627","DOI":"10.2307\/2307285","volume":"62","author":"W Quine","year":"1955","unstructured":"Quine, W.: A way to simplify truth functions. Am. Math. Mon. 62, 627\u2013631 (1955)","journal-title":"Am. Math. Mon."},{"key":"9263_CR18","unstructured":"Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Pearson Education (2003)"},{"key":"9263_CR19","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"2","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth first search and linear graph algorithms. SIAM J. Comput. 2, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9263_CR20","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1006\/jcss.2001.1775","volume":"63","author":"C Umans","year":"2001","unstructured":"Umans, C.: The minimum equivalent DNF problem and shortest implicants. J. Comput. Syst. Sci. 63(4), 597\u2013611 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"9263_CR21","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/TCAD.2005.855944","volume":"25","author":"C Umans","year":"2006","unstructured":"Umans, C., Villa, T., Sangiovanni-Vincentelli, A.L.: Complexity of two-level logic minimization. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 25(7), 1230\u20131246 (2006)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9263-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-011-9263-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-011-9263-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T12:01:22Z","timestamp":1560945682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-011-9263-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9263"],"URL":"https:\/\/doi.org\/10.1007\/s10472-011-9263-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]}}}