{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:18Z","timestamp":1725455838883},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051659X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026300","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:35:17Z","timestamp":1132396517000},"page":"148-165","source":"Crossref","is-referenced-by-count":0,"title":["Loop detection in propositional Prolog programs"],"prefix":"10.1007","author":[{"given":"Hans Kleine","family":"B\u00fcning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulrich","family":"L\u00f6wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmitgen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-87777-2","volume-title":"Berechenbarkeit, Komplexit\u00e4t, Logik","author":"E. B\u00f6rger","year":"1985","unstructured":"E. B\u00f6rger: Berechenbarkeit, Komplexit\u00e4t, Logik, Vieweg-Verlag, Braunschweig 1985"},{"key":"9_CR2","unstructured":"E. B\u00f6rger: Logic as machine: Complexity relations between programs and formulae. Technical Report\n213 (1985), Universit\u00e4t Dortmund, Abteilung Informatik"},{"key":"9_CR3","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":"9_CR4","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":"9_CR5","unstructured":"H. Kleine B\u00fcning, U. L\u00f6wen, S. Schmitgen: Inconsistency of Production Systems, to appear in Data & Knowledge Engineering, North-Holland, Amsterdam"},{"key":"9_CR6","unstructured":"H. Kleine B\u00fcning, U. L\u00f6wen, S. Schmitgen: Equivalence of Propositional Logic Programs, to appear in Journal of Automated Reasoning"},{"key":"9_CR7","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":"9_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09438-9","volume-title":"Principles of Artificial Intelligence","author":"N. J. Nilsson","year":"1982","unstructured":"N. J. Nilsson: Principles of Artificial Intelligence, Springer-Verlag, Berlin 1982"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"T. J. Schaefer: The Complexity of Satisfiability Problems, Proc. 10th ACM Symp. on Thoery of Computing (1978), pp. 216\u2013226","DOI":"10.1145\/800133.804350"},{"key":"9_CR10","volume-title":"Mathematical Logic","author":"J. R. Shoenfield","year":"1967","unstructured":"J. R. Shoenfield: Mathematical Logic, Addison-Wesley, London 1967"}],"container-title":["Lecture Notes in Computer Science","CSL '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026300.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:56:00Z","timestamp":1607550960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051659X"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0026300","relation":{},"subject":[]}}