{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T04:51:30Z","timestamp":1655009490784},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1007\/bf01531067","type":"journal-article","created":{"date-parts":[[2005,4,18]],"date-time":"2005-04-18T20:09:06Z","timestamp":1113854946000},"page":"1-19","source":"Crossref","is-referenced-by-count":3,"title":["Definite clause programs are canonical (over a suitable domain)"],"prefix":"10.1007","volume":"1","author":[{"given":"Howard A.","family":"Blair","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Allen L.","family":"Brown","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1990,9,1]]},"reference":[{"key":"BF01531067_CR1","first-page":"3","volume":"4","author":"H. Andreka","year":"1978","unstructured":"H. Andreka and I. Nemeti, The generalized completeness of Horn predicate logic as a programming language, Acta Cybernetica 4 (1978) 3\u201310.","journal-title":"Acta Cybernetica"},{"key":"BF01531067_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/322326.322339","volume":"29","author":"K.R. Apt","year":"1982","unstructured":"K.R. Apt and M.H. van Enden, Contributions to the theory of logic programming, J. ACM 29 (1982) 25\u201347.","journal-title":"J. ACM"},{"key":"BF01531067_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0019-9958(82)91234-7","volume":"54","author":"H.A. Blair","year":"1982","unstructured":"H.A. Blair, The recursion-theoretic complexity of the semantics of predicate logic as a programming language, Information and Control 54 (1982) 25\u201347.","journal-title":"Information and Control"},{"key":"BF01531067_CR4","unstructured":"H.A. Blair, Canonical conservative extensions of logic program completions,IEEE Symp. on Logic Programming (August, 1987) pp. 154\u2013161."},{"key":"BF01531067_CR5","unstructured":"K.L. Clark, Negation as failure,Logic and Databases, H. Gallaire and J. Minker (eds.) (1978) pp. 293\u2013324."},{"key":"BF01531067_CR6","first-page":"143","volume":"2","author":"M. Fitting","year":"1985","unstructured":"M. Fitting, A Kripke-Kleene semantics for logic programs, J. Logic Programming 2 (1985) 143\u2013155.","journal-title":"J. Logic Programming"},{"key":"BF01531067_CR7","unstructured":"J. Jaffar, J-L. Lassez and J.W. Lloyd, Completeness of the negation as failure rule,IJCAI-83 Proc., Karlsruhe (1983) pp. 500\u2013506."},{"key":"BF01531067_CR8","doi-asserted-by":"crossref","unstructured":"J. Jaffar, J-L. Lassez and M.J. Maher, Some issues and trends in the semantics of logic programming,Proc. 3rd Int. Conf. on Logic Programming, K.A. Bowen and E. Shapiro (eds.), London (July 1986) pp. 223\u2013241, Lecture Notes in Computer Science, no. 225 (Springer, 1986).","DOI":"10.1007\/3-540-16492-8_78"},{"key":"BF01531067_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0743-1066(86)90020-8","volume":"3","author":"J. Jaffar","year":"1986","unstructured":"J. Jaffar and P.J. Stuckey, Canonical logic programs, J. Logic Programming 3 (1986), 143\u2013155.","journal-title":"J. Logic Programming"},{"key":"BF01531067_CR10","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen, Negation in logic programming, J. Logic Programming 4 (1987) 289\u2013308.","journal-title":"J. Logic Programming"},{"key":"BF01531067_CR11","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd,Foundations of Logic Programming, 2nd ed. (Springer, 1987).","DOI":"10.1007\/978-3-642-83189-8"},{"key":"BF01531067_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0304-3975(84)90017-3","volume":"29","author":"J-L. Lassez","year":"1984","unstructured":"J-L. Lassez and M.J. Maher, Closures and fairness in the semantics of programming logic, Theoretical Science 29 (1984) 167\u2013184.","journal-title":"Theoretical Science"},{"key":"BF01531067_CR13","unstructured":"M.J. Maher, Complete axiomatizations of the algebras of finite, rational and infinite trees,3rd Logic in Computer Science Conf., Edinburgh (1988)."},{"issue":"no. 2","key":"BF01531067_CR14","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari, An efficient unification algorithm, ACM TOPLAS 4, no. 2 (1982) 258\u2013282.","journal-title":"ACM TOPLAS"},{"key":"BF01531067_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"J.A. Robinson, A machine-oriented logic based on the resolution principle, J. ACM 12 (1965) 23\u201341.","journal-title":"J. ACM"},{"key":"BF01531067_CR16","volume-title":"Mathematical Logic","author":"J. Shoenfield","year":"1967","unstructured":"J. Shoenfield,Mathematical Logic (Addison-Wesley, Reading, Mass., 1967)."},{"key":"BF01531067_CR17","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0743-1066(89)90017-4","volume":"6","author":"M. Wallace","year":"1989","unstructured":"M. Wallace, A computable semantics for general logic programs, J. Logic Programming 6 (1989) 269\u2013297.","journal-title":"J. Logic Programming"},{"key":"BF01531067_CR18","unstructured":"D.A. Wolfram, M.J. Maher and J.-L. Lassez, A unified treatment of resolution strategies for logic programs,Proc. 2nd Int. Logic Programming Conf., Uppsala, Sweden (1984) pp. 286\u2013276."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531067\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531067.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01531067\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01531067.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T18:27:06Z","timestamp":1581964026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01531067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":18,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["BF01531067"],"URL":"https:\/\/doi.org\/10.1007\/bf01531067","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}