{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:32Z","timestamp":1725663152983},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_37","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:18:28Z","timestamp":1330201108000},"page":"173-187","source":"Crossref","is-referenced-by-count":1,"title":["Optimization aspects of logical formulas"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"L\u00f6wen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"13_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, M. H. van Emden: Contributions to the Theory of Logic Programming, J. of the ACM 29 (1982), pp. 841\u2013862","journal-title":"J. of the ACM"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"E. B\u00f6rger: Berechenbarkeit, Komplexit\u00e4t, Logik, Vieweg-Verlag, Braunschweig 1985 (English translation in preparation)","DOI":"10.1007\/978-3-322-87777-2"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0020-0190(82)90110-7","volume":"15","author":"C. Brown","year":"1982","unstructured":"C. Brown, A. Goldberg, P. Purdom: Average Time Analysis of Simplified Davis-Putnam Procedures, Information Processing Letters 15 (1982), pp. 72\u201375","journal-title":"Information Processing Letters"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0210043","volume":"10","author":"C. A. Brown","year":"1981","unstructured":"C. A. Brown, P. W. Purdom: An Average Time Analysis of Backtracking, SIAM J. Computing 10 (1981), pp. 583\u2013593","journal-title":"SIAM J. Computing"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1137\/0214067","volume":"14","author":"C. A. Brown","year":"1985","unstructured":"C. A. Brown, P. W. Purdom: The pure literal rule and polynomial average time, SIAM J. Computing 14 (1985), pp. 943\u2013953","journal-title":"SIAM J. Computing"},{"key":"13_CR6","volume-title":"Programming in Prolog","author":"W. F. Clocksin","year":"1984","unstructured":"W. F. Clocksin, C. S. Mellish: Programming in Prolog, Springer-Verlag, Berlin 1984"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"S. A. Cook: The Complexity of Theorem-proving Procedures, Proc. Third ACM Symp. on Theory of Computing (1971), pp. 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"13_CR8","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, J. H. Gallier: Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae, J. Logic Programming 1 (1984), pp. 267\u2013284","journal-title":"J. Logic Programming"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0004-3702(85)90028-1","volume":"26","author":"M. R. Genesereth","year":"1985","unstructured":"M. R. Genesereth, D. E. Smith: Ordering Conjunctive queries, Artificial Intelligence 26 (1985), pp. 171\u2013215","journal-title":"Artificial Intelligence"},{"key":"13_CR10","unstructured":"A. Goldberg: Average case complexity of the satisfiability problem, Proc. Fourth Workshop on Automated Deduction (1979), pp. 1\u20136"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321850.321857","volume":"21","author":"L. Henschen","year":"1974","unstructured":"L. Henschen, L. Wos: Unit Refutation and Horn Sets, J. of the ACM 21 (1974), pp. 590\u2013605","journal-title":"J. of the ACM"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(76)90068-2","volume":"3","author":"N. D. Jones","year":"1977","unstructured":"N. D. Jones, W. T. Laaser: Complete Problems for Deterministic Polynomial Time, Theoretical Computer Science 3 (1977), pp. 105\u2013117","journal-title":"Theoretical Computer Science"},{"key":"13_CR13","unstructured":"H. Kleine B\u00fcning, U. L\u00f6wen: Optimizing Propositional Calculus Formulas with Regard to Questions of Deducibility, Technical Report 178 (1987), Universit\u00e4t Karlsruhe, Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren"},{"key":"13_CR14","unstructured":"H. Kleine B\u00fcning, U. L\u00f6wen: Towards Average Complexity of Propositional Binary Prolog Programs, Preprint (1988)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"H. Kleine B\u00fcning, U. L\u00f6wen: Optimization Aspects for Special Prolog Programs, Preprint (1988)","DOI":"10.1007\/978-3-322-89542-4"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"H. Kleine B\u00fcning, S. Schmitgen: Prolog, B. G. Teubner, Stuttgart 1986","DOI":"10.1007\/978-3-322-92747-7"},{"key":"13_CR17","first-page":"556","volume-title":"Information Processing 74","author":"R. Kowalski","year":"1974","unstructured":"R. Kowalski: Predicate Logic as Programming Language, Information Processing 74, J. Rosenfeld (ed.), North-Holland, Amsterdam 1974, pp. 556\u2013574"},{"key":"13_CR18","unstructured":"K. S. Natarajan: Optimizing Backtrack Search for all Solutions to Conjunctive Problems, Proc. Tenth Int. Joint Conf. on Artificial Intelligence (1987), pp. 955\u2013958"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"N. J. Nilsson: Principles of Artificial Intelligence, Springer-Verlag, Berlin 1982","DOI":"10.1007\/978-3-662-09438-9"},{"key":"13_CR20","first-page":"107","volume-title":"Logic Programming","author":"L. M. Pereira","year":"1982","unstructured":"L. M. Pereira, A. Porto: Selective Backtracking, Logic Programming, K. Clark and S. T\u00e4rnlund (eds.), Academic Press, New York 1982, pp. 107\u2013114"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"D. Plaisted: The Occur-Check Problem in Prolog, Proc. Int. Symp. on Logic Programming (1984), pp. 272\u2013280","DOI":"10.1007\/BF03037324"},{"key":"13_CR22","volume-title":"Mathematical Logic","author":"J. R. Shoenfield","year":"1967","unstructured":"J. R. Shoenfield: Mathematical Logic, Addison-Wesley, London 1967"},{"key":"13_CR23","unstructured":"E. Speckenmeyer: Classes of CNF-Formulas with Backtracking Trees of Exponential or Linear Average Order for Exact Satisfiability, Technical Report 47 (1987), Universit\u00e4t \u2014 GH \u2014 Paderborn, Fachbereich Mathematik-Informatik"},{"key":"13_CR24","unstructured":"E. Speckenmeyer: On the Average Case Complexity of Backtracking for the Exact Satisfiability Problem, this volume"},{"key":"13_CR25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0743-1066(84)90028-1","volume":"1","author":"P. \u0160t\u011bp\u00e1nek","year":"1984","unstructured":"P. \u0160t\u011bp\u00e1nek, O. \u0160t\u011bp\u00e1nkov\u00e1: Transformations of Logic Programs, J. Logic Programming 1 (1984), pp. 305\u2013318","journal-title":"J. Logic Programming"}],"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_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:43Z","timestamp":1605647863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50241-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540502418","9783540459606"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-50241-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}