{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:39Z","timestamp":1725663339224},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528852"},{"type":"electronic","value":"9783540471714"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52885-7_81","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:47:01Z","timestamp":1330206421000},"page":"87-101","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Case-free programs: An abstraction of definite horn programs"],"prefix":"10.1007","author":[{"given":"Toshiro","family":"Wakayama","sequence":"first","affiliation":[]},{"given":"T. H.","family":"Payne","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"7_CR1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"K.R. Apt","year":"1987","unstructured":"Apt, K.R., Blair, H.A., and Walker, A., Towards a Theory of Declarative Knowledge, in Foundations of Deductive Databases and Logic Programming, J. Minker (ed.), Morgan Kaufman, Los Altos, 1987."},{"key":"7_CR2","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/3-540-18625-5_59","volume":"287","author":"H.A. Blair","year":"1987","unstructured":"Blair, H.A., and Subrahmanian, V.S., Paraconsistent Logic Programming, Lecture Notes in Computer Science, vol. 287, pp.340\u2013360, Springer-Verlag, 1987.","journal-title":"Lecture Notes in Computer Science"},{"key":"7_CR3","unstructured":"Kunen, K., Signed Data Dependencies in Logic Programs. Computer Science Technical Report #719, University of Wisconsin-Madison, 1987."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Lloyd,J.W., Foundations of Logic Programming, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Loveland,D.W., Mechanical Theorem Proving by Model Elimination. J. ACM, 1968.","DOI":"10.1007\/978-3-642-81955-1_8"},{"key":"7_CR6","volume-title":"Automated Theorem Proving: A Logical Basis","author":"D.W. Loveland","year":"1978","unstructured":"Loveland, D.W., Automated Theorem Proving: A Logical Basis, North-Holland, Amsterdam, 1978."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Loveland,D.W., Near Horn Prolog, 4th International Conference in Logic Programming, Melbourne, 1987.","DOI":"10.21236\/ADA185172"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Loveland, D.W., Near-Horn Prolog and Beyond, Technical Report CS-1988-25, Dept. of Computer Science, Duke University, 1988.","DOI":"10.21236\/ADA185172"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Plaisted,D., Non-Horn Clause Logic Programming without Contrapositives, Journal of Automated Reasoning, 1988, in press.","DOI":"10.1007\/BF00244944"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Shepherdson, J.C., Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption, J. Logic Programming, 1984, pp. 51\u201379.","DOI":"10.1016\/0743-1066(84)90023-2"},{"key":"7_CR11","volume-title":"Mathematical Logic","author":"J. Shoenfield","year":"1967","unstructured":"Shoenfield, J., Mathematical Logic. Addison-Wesley, Reading, Mass. 1967."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/3-540-16780-3_122","volume-title":"A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler","author":"M.E. Stickel","year":"1986","unstructured":"Stickel, M.E., A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. Lecture Notes in Computer Science, No. 230, pp.573\u2013587, Springer-Verlag, New York, 1986."},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Case Inference in Resolution-Based languages","author":"T. Wakayama","year":"1988","unstructured":"Wakayama, T., and Payne, T.H., Case Inference in Resolution-Based languages. Lecture Notes in Computer Science, No 310, Springer-Verlag, New York, 1988."}],"container-title":["Lecture Notes in Computer Science","10th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52885-7_81","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:41:20Z","timestamp":1558269680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52885-7_81"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528852","9783540471714"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-52885-7_81","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}