{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:48Z","timestamp":1742617128887,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540502418"},{"type":"electronic","value":"9783540459606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50241-6_34","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:18:35Z","timestamp":1330201115000},"page":"129-137","source":"Crossref","is-referenced-by-count":7,"title":["On the computational complexity of quantified Horn clauses"],"prefix":"10.1007","author":[{"given":"Marek","family":"Karpinski","sequence":"first","affiliation":[]},{"given":"Hans Kleine","family":"B\u00fcning","sequence":"additional","affiliation":[]},{"given":"Peter H.","family":"Schmitt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. van Emden, Contributions to the Theory of Logic Programming, J. ACM vol. 29, 1982, pp. 841\u2013862.","journal-title":"J. ACM"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"B. Aspvall, M. F. Plass, R. E. Tarjan, A linear-time algorithm for testing the truth of certain quantified boolean formulas, Inf. Processing Letters, Vol. 8, 1979, pp. 121\u2013123.","journal-title":"Inf. Processing Letters"},{"key":"10_CR3","doi-asserted-by":"crossref","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, J Logic Programming, vol. 3, 1984, pp. 267\u2013284.","journal-title":"J Logic Programming"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0743-1066(87)90015-X","volume":"4","author":"J.H. Gallier","year":"1987","unstructured":"J.H. Gallier and S. Raatz, HORNLOG: A Graph-Based Interpreter for General Horn Clauses, J. of Logic Programming vol 4, 1987, pp. 119\u2013155.","journal-title":"J. of Logic Programming"},{"key":"10_CR5","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. Johnston, Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Fransicao, 1979."},{"key":"10_CR6","doi-asserted-by":"crossref","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, J. Logic Programming, vol. 4, 1987, pp. 105\u2013117.","journal-title":"J. Logic Programming"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Th. J. Sch\u00e4fer, The Complexity of Satisfiability Problems. Proc. 10 th. Ann. ACM STOCS 1978, pp. 216\u2013226","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","CSL '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50241-6_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T20:45:29Z","timestamp":1742589929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50241-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540502418","9783540459606"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-50241-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}