{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:50:16Z","timestamp":1648795816103},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008,1]]},"DOI":"10.1007\/s10472-008-9094-5","type":"journal-article","created":{"date-parts":[[2008,5,14]],"date-time":"2008-05-14T12:16:58Z","timestamp":1210767418000},"page":"1-24","source":"Crossref","is-referenced-by-count":2,"title":["Recognition of interval Boolean functions"],"prefix":"10.1007","volume":"52","author":[{"given":"Ond\u0159ej","family":"\u010cepek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Kronus","sequence":"additional","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":[[2008,5,15]]},"reference":[{"key":"9094_CR1","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1006\/inco.1997.2687","volume":"140","author":"E. Boros","year":"1998","unstructured":"Boros, E., Ibaraki, T., Makino, K.: Error-free and best-fit extensions of partially defined Boolean functions. Inf. Comput. 140, 254\u2013283 (1998)","journal-title":"Inf. Comput."},{"key":"9094_CR2","unstructured":"Boros, E., Ibaraki, T., Makino, K.: Extensions of partially defined boolean functions with missing data. Technical Report 6-96, RUTCOR Research Report\u00a0RRR, Rutgers University, New Brunswick, NJ (1996)"},{"key":"9094_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H.\u00a0Freeman, San Francisco (1979)"},{"key":"9094_CR4","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":"9094_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0020-0190(92)90250-Y","volume":"44","author":"P. Hammer","year":"1992","unstructured":"Hammer, P., Kogan, A.: Horn functions and their dnfs. Inf. Process. Lett. 44, 23\u201329 (1992)","journal-title":"Inf. Process. Lett."},{"key":"9094_CR6","volume-title":"Proceedings of the IEEE International High Level Design Validation and Test Workshop","author":"C.Y. Huang","year":"1999","unstructured":"Huang, C.Y., Cheng, K.T.: Solving constraint satisfiability problem for automatic generation of design verification vectors. In: Proceedings of the IEEE International High Level Design Validation and Test Workshop. IEEE, Piscataway (1999)"},{"key":"9094_CR7","unstructured":"Lewin, D., Fournier, L., Levinger, M., Roytman, E., Shurek, G.: Constraint satisfaction for test program generation. http:\/\/citeseer.ist.psu.edu\/lewin95constraint.html (1995)"},{"key":"9094_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1080\/00029890.1952.11988183","volume":"59","author":"W. Quine","year":"1952","unstructured":"Quine, W.: The problem of simplifying the truth functions. Am. Math. Mon. 59, 521\u2013531 (1952)","journal-title":"Am. Math. Mon."},{"key":"9094_CR9","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.dam.2004.08.009","volume":"149","author":"B. Schieber","year":"2005","unstructured":"Schieber, B., Geist, D., Ayal, Z.: Computing the minimum dnf representation of Boolean functions defined by intervals. Discrete Appl. Math. 149, 154\u2013173 (2005)","journal-title":"Discrete Appl. Math."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-008-9094-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-008-9094-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-008-9094-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T17:51:51Z","timestamp":1559152311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-008-9094-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9094"],"URL":"https:\/\/doi.org\/10.1007\/s10472-008-9094-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}