{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:16:24Z","timestamp":1649056584462},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90123-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"113-119","source":"Crossref","is-referenced-by-count":0,"title":["A hierarchy of propositional Horn formulas"],"prefix":"10.1016","volume":"68","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90123-0_BIB1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(89)90123-0_BIB2","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","article-title":"Alternation","volume":"28","author":"Chandra","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(89)90123-0_BIB3","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90123-0_BIB4","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90123-0_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90123-0_BIB6","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"Hastad","year":"1986","journal-title":"Proc. 18th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90123-0_BIB7","series-title":"TR 552","article-title":"Nondeterministic space is closed under complement","author":"Immerman","year":"1987"},{"key":"10.1016\/0304-3975(89)90123-0_BIB8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","article-title":"Complete problems for deterministic polynomial time","volume":"3","author":"Jones","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90123-0_BIB9","series-title":"Machine Intelligence","first-page":"117","article-title":"Some special purpose resolution systems","author":"Kuehner","year":"1972"},{"key":"10.1016\/0304-3975(89)90123-0_BIB10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01744287","article-title":"Satisfiability problems for propositional calculi","volume":"13","author":"Lewis","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(89)90123-0_BIB11","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","year":"1978"},{"key":"10.1016\/0304-3975(89)90123-0_BIB12","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978","journal-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90123-0_BIB13","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90123-0_BIB14","series-title":"Wiley-Teubner Series in Computer Science","article-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:34Z","timestamp":1555127794000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901230"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90123-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}