{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:57Z","timestamp":1725663177941},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167808"},{"type":"electronic","value":"9783540398615"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16780-3_119","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:00:28Z","timestamp":1330178428000},"page":"553-563","source":"Crossref","is-referenced-by-count":0,"title":["Classes of first order formulas under various satisfiability definitions"],"prefix":"10.1007","author":[{"given":"H.","family":"Kleine B\u00fcning","sequence":"first","affiliation":[]},{"given":"Th.","family":"Lettmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger: Berechenbarkeit, Komplexit\u00e4t, Logik, Vieweg, 1985","DOI":"10.1007\/978-3-322-87777-2"},{"key":"45_CR2","unstructured":"M. Garey, D.S. Johnson: Computers and Intractability, Freeman and Company, 1979"},{"key":"45_CR3","unstructured":"H. Kleine B\u00fcning: Complexity Results for Classes of First-Order Formulas with Identity and Conjunctive Quantificational Form, Forschungsberichte der Universit\u00e4t Karlsruhe, 1985"},{"key":"45_CR4","unstructured":"H. Kleine B\u00fcning, Th. Lettmann: First-Order Formulas in Conjunctive Quantificational Form, Forschungsberichte der Universit\u00e4t Karlsruhe, 1985"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"A.R. Meyer, L.J. Stockmeyer: Word Problems Requiring Exponential Time, Proc. 5th Ann. ACM Symp. on Theory of Computing, 1973","DOI":"10.1145\/800125.804029"},{"key":"45_CR6","doi-asserted-by":"crossref","unstructured":"D.A. Plaisted: Complete Problems in the First-Order Predicate Calculus, Journal of Computer and System Sciences, 1984","DOI":"10.1016\/0022-0000(84)90010-2"},{"key":"45_CR7","unstructured":"R. Reiter: Towards a Logical Reconstrustion of Relational Database Theory, in On Conceptual Modelling, Ed. Brodie, Mylopoulos, Schmidt Springer Verlag"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"T. J. Sch\u00e4fer: The Complexity of Satisfiability Problems, Proc. 10th Ann. ACM Symp. on Theory of Computing, 1978","DOI":"10.1145\/800133.804350"}],"container-title":["Lecture Notes in Computer Science","8th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16780-3_119.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:33Z","timestamp":1605625893000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16780-3_119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167808","9783540398615"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-16780-3_119","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}