{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:45Z","timestamp":1725664665554},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540594871"},{"type":"electronic","value":"9783540492825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59487-6_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:19:20Z","timestamp":1330276760000},"page":"99-112","source":"Crossref","is-referenced-by-count":1,"title":["Game characterizations of logic program properties"],"prefix":"10.1007","author":[{"given":"Howard A.","family":"Blair","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R. \u201cLogic Programming\u201d in Handbook of Theoretical Computer Science, J. van Leeuwen, ed., Elsevier, 1990, pp. 494\u2013574.","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Blair, H. A. \u201cThe Recursion-Theoretic Complexity of the Semantics of Predicate Logic as a Programming Language.\u201d Information and Control, July\u2013August, 1982, pp. 25\u201347.","DOI":"10.1016\/S0019-9958(82)91234-7"},{"key":"8_CR3","unstructured":"Blair, H. A. Decidability in the Herbrand Base. (Manuscript) Workshop on Deductive Databases and Logic Programming, Washington D.C. Aug 18\u201322, 1986. Syracuse University Logic Programming Research Group Technical Report LPRG-TR88-13."},{"key":"8_CR4","unstructured":"Blair, H. A. \u201cCanonical Conservative Extensions of Logic Program Completions\u201d. IEEE Symposium on Logic Programming, San Francisco, August, 1987. pp. 154\u2013161."},{"key":"8_CR5","unstructured":"Blair, H.A., Marek, V.W. and Schlipf, J.S. The Expressiveness of Locally Stratified Programs. Technical Report, Mathematical Sciences Institute, Cornell University. To appear in Fundamenta Informaticae."},{"key":"8_CR6","unstructured":"Cholak, P. and Blair, H.A. \u201cThe Complexity of Local Stratification\u201d, Fundamenta Informaticae. (To appear.)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Gurevich, Yuri & Harrington, Leo, \u201cTrees, Automata and Games\u201d, Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982, pp. 60\u201365.","DOI":"10.1145\/800070.802177"},{"issue":"no.4","key":"8_CR8","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G\u00e9rard. \u201cConfluent Reductions: Abstract Properties and Applications to Term Rewriting Systems\u201d, JACM Vol. 27, no. 4 (October, 1980), pp. 797\u2013821.","journal-title":"JACM"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W. Foundations of Logic Programming, (2nd. ed.) Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Nerode, Anil & Shore, Richard, Logic for Applications, Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4684-0211-7"},{"key":"8_CR11","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"Rogers, H. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York, 1967."},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0168-0072(90)90024-V","volume":"48","author":"A. Yakhnis","year":"1990","unstructured":"Yakhnis, A. & Yakhnis, V. \u201cExtension of Gurevich-Harrington's Restricted Memory Determinacy Theorem; A Criterion for the Winning Player and an Explicit Class of Winning Strategies\u201d, Annals of Pure and Applied Logic, Vol. 48, 1990, pp. 277\u2013297.","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59487-6_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:27:27Z","timestamp":1605648447000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59487-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540594871","9783540492825"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-59487-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}