{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:01:16Z","timestamp":1747627276304,"version":"3.40.5"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"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":[[2003,3]]},"DOI":"10.1023\/a:1021243928374","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:56:49Z","timestamp":1048208209000},"page":"251-272","source":"Crossref","is-referenced-by-count":0,"title":["Recognition of Simple Enlarged Horn Formulas and Simple Extended Horn Formulas"],"prefix":"10.1007","volume":"37","author":[{"given":"Emmanuel","family":"Benoist","sequence":"first","affiliation":[]},{"given":"Jean-Jacques","family":"H\u00e9brard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5098001_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"K.S. Booth and G.S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using P-Q tree algorithms, Journal of Computer and System Sciences 13 (1976) 335\u2013379.","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"5098001_CR2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/102782.102789","volume":"38","author":"V. Chandru","year":"1991","unstructured":"V. Chandru and J.N. Hooker, Extended Horn sets in propositional logic, Journal of the ACM 38(1) (1991) 205\u2013221.","journal-title":"Journal of the ACM"},{"issue":"6","key":"5098001_CR3","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1051\/ita\/1997310604991","volume":"31","author":"N. Creignou","year":"1997","unstructured":"N. Creignou and J.-J. H\u00e9brard, On generating all solutions of generalized satisfiability problems, Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications 31(6) (1997) 499\u2013511.","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"issue":"4","key":"5098001_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(92)90081-6","volume":"44","author":"M. Dalal","year":"1992","unstructured":"M. Dalal and D.W. Etherington, A hierarchy of tractable satisfiability problems, Information Processing Letters 44(4) (1992) 173\u2013180.","journal-title":"Information Processing Letters"},{"key":"5098001_CR5","series-title":"Technical report","volume-title":"A linear time algorithm for the generalized consecutive retrieval problem","author":"P. Dietz","year":"1979","unstructured":"P. Dietz, M. Furst and J. Hopcroft, A linear time algorithm for the generalized consecutive retrieval problem, Technical report TR-79-386, Department of Computer Science, Cornell University, Ithaca, NY (1979)."},{"issue":"3","key":"5098001_CR6","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","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, Logic Programming 1(3) (1984) 267\u2013284.","journal-title":"Logic Programming"},{"issue":"1-2","key":"5098001_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"M. Habib, R. McConnell, C. Paul and L. Viennot, Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing, Theoretical Computer Science 234(1-2) (2000) 59\u201384.","journal-title":"Theoretical Computer Science"},{"key":"5098001_CR8","doi-asserted-by":"crossref","unstructured":"M. Habib, C. Paul and L. Viennot, A synthesis on partition refinement: a useful routine for strings, graphs, Boolean matrices and automata, in: Proc. STACS'98 (1998) pp. 25\u201338.","DOI":"10.1007\/BFb0028546"},{"issue":"3","key":"5098001_CR9","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"D.S. Johnson, M. Yannakakis and C.H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters 27(3) (1988) 119\u2013123.","journal-title":"Information Processing Letters"},{"issue":"3","key":"5098001_CR10","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(95)00019-9","volume":"54","author":"J.S. Schlipf","year":"1995","unstructured":"J.S. Schlipf, F.S. Annexstein, J.V. Franco and R.P. Swaminathan, On finding solutions for extended Horn formulas, Information Processing Letters 54(3) (1995) 133\u2013137.","journal-title":"Information Processing Letters"},{"key":"5098001_CR11","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0166-218X(95)80005-O","volume":"59","author":"R.P. Swaminathan","year":"1995","unstructured":"R.P. Swaminathan and D.K. Wagner, The arborescence-realization problem, Discrete Applied Mathematics 59 (1995) 267\u2013283.","journal-title":"Discrete Applied Mathematics"},{"key":"5098001_CR12","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44 (SIAM, 1983).","DOI":"10.1137\/1.9781611970265"},{"issue":"3","key":"5098001_CR13","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"L.G. Valiant, The complexity of enumeration and reliability problems, SIAM Journal on Computing 8(3) (1979) 410\u2013421.","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:1021243928374.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021243928374\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021243928374.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:45:17Z","timestamp":1747547117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021243928374"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5098001"],"URL":"https:\/\/doi.org\/10.1023\/a:1021243928374","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}