{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:14Z","timestamp":1725456194238},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019343X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0012837","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:12:39Z","timestamp":1132726359000},"page":"278-293","source":"Crossref","is-referenced-by-count":13,"title":["Procedural interpretation of non-horn logic programs"],"prefix":"10.1007","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arcot","family":"Rajasekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. van Emden. Contributions to the Theory of Logic Programming. J.ACM, 29(3):841\u2013862, 1982.","journal-title":"J.ACM"},{"key":"18_CR2","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. L. Chang","year":"1973","unstructured":"C. L. Chang and R. C. T. Lee. Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York, 1973."},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-1-4684-3384-5_11","volume-title":"Logic and Data Bases","author":"K. L. Clark","year":"1978","unstructured":"K. L. Clark. Negation as Failure. In H. Gallaire J. Minker, editor, Logic and Data Bases, pages 293\u2013322, Plenum Press, New York, 1978."},{"key":"18_CR4","unstructured":"R. Hill. LUSH Resolution and its Completeness. Technical Report, University of Edinburgh School of Artificial Intelligence, August 1974."},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R. A. Kowalski","year":"1971","unstructured":"R. A. Kowalski and D. Kuehner. Linear Resolution with Selection Function. Artificial Intelligence, 2:227\u2013260, 1971.","journal-title":"Artificial Intelligence"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"18_CR7","unstructured":"D.W. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland Publishing Co., 1978."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"J. Minker. On Indefinite Databases and the Closed World Assumption. Springer-Verlag, 1982.","DOI":"10.1007\/BFb0000066"},{"key":"18_CR9","unstructured":"J. Minker and A. Rajasekar. A Fixpoint Semantics for Non-Horn Logic Programs. July 1987. Submitted to Journal of Logic Programming."},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"J. Minker and G. Zanon. An extension to linear resolution with selection function. In Information Processing Letters, pages 191\u2013194, June 1982.","DOI":"10.1016\/0020-0190(82)90035-7"},{"key":"18_CR11","unstructured":"D.A. Plaisted. An Efficient Bug Location Algorithm. In Proc. Second Int. Conf. on Logic Programming, Uppsala, 1984."},{"key":"18_CR12","unstructured":"T. Przymusinski. Query answering in circumscriptive and closed world theories. Proc. Amer. Assoc. for Artificial Intelligence '86, 186\u2013190, August 1986."},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4684-3384-5_3","volume-title":"Logic and Data Bases","author":"R. Reiter","year":"1978","unstructured":"R. Reiter. On closed world data bases. In H. Gallaire J. Minker, editor, Logic and Data Bases, pages 55\u201376, Plenum Press, New York, 1978."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"J.C. Shepherdson. Negation in logic programming. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, Morgan-Kaufman Pub., 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"A. Van Gelder. Negation as failure using tight derivations for general logic programs. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, Morgan-Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50007-5"}],"container-title":["Lecture Notes in Computer Science","9th International Conference on Automated Deduction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012837.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T15:06:40Z","timestamp":1607353600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019343X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0012837","relation":{},"subject":[]}}