{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:51:31Z","timestamp":1693849891346},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf00881898","type":"journal-article","created":{"date-parts":[[2004,12,25]],"date-time":"2004-12-25T19:18:27Z","timestamp":1104002307000},"page":"1-22","source":"Crossref","is-referenced-by-count":3,"title":["Backchain iteration: Towards a practical inference method that is simple enough to be proved terminating, sound, and complete"],"prefix":"10.1007","volume":"11","author":[{"given":"Adrian","family":"Walker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R., Blair, H. and Walker, A., ?Towards a theory of declarative knowledge?, inFoundations of Deductive Databases and Logic Programming (ed. J. Minker), Morgan Kaufman, pp. 89?148 (1988).","DOI":"10.1016\/B978-0-934613-40-8.50006-3"},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/322326.322339","volume":"29","author":"K. R. Apt","year":"1982","unstructured":"Apt, K. R. and van Emden, M. H., ?Contributions to the theory of logic programming?,Journal of the Association for Computing Machinery 29(3), 841?862 (1982).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Bancilhon, F. and Ramakrishnan, R., ?Performance evaluation of data intensive logic programs?, inFoundations of Deductive Databases and Logic Programming (ed. J. Minker), Morgan Kaufman, pp. 439?517 (1988).","DOI":"10.1016\/B978-0-934613-40-8.50016-6"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"Bancilhon, F., Maier, D., Sagiv, Y. and Ullman, J., ?Magic sets and other strange ways to implement logic programs?,Proceedings of the 5th ACM Symposium on Principles of Database Systems, Cambridge, Massachusetts, pp. 1?15 (1986).","DOI":"10.1145\/6012.15399"},{"key":"CR5","first-page":"711","volume-title":"Proceedings of the International Conference on Fifth Generation Computer Systems","author":"I. Balbin","year":"1988","unstructured":"Balbin, I., Meenakshi, K. and Ramamohanarao, K, ?A query independent method for magic set computation on stratified databases?,Proceedings of the International Conference on Fifth Generation Computer Systems, ICOT, Tokyo, Japan, pp. 711?718 (1988)."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Beeri, C. and Ramakrishnan, R., ?On the power of magic?Proceedings of the 6th ACM Symposium on Principles of Database Systems, San Diego, California, pp. 269?283 (1987).","DOI":"10.1145\/28659.28689"},{"issue":"4","key":"CR7","first-page":"312","volume":"5","author":"F. Bry","year":"1990","unstructured":"Bry, F., ?Query evaluation in recursive databases: bottom-up and top-down reconciled?,Data and Knowledge Engineering 5(4), 312?332 (1990).","journal-title":"Data and Knowledge Engineering"},{"key":"CR8","first-page":"293","volume-title":"Logic and Databases","author":"K. Clark","year":"1978","unstructured":"Clark, K., ?Negation as failure?, inLogic and Databases (eds. H. Gallaire and J. Minker), Plenum, New York, pp. 293?322 (1978)."},{"key":"CR9","unstructured":"Foo, N., Rao, A., Taylor, A. and Walker, A., ?Deduced relevant types and constructive negation?,Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pp. 126?139 (1988). Also Report RC 13407, IBM T.J. Watson Research Center."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0304-3975(89)90009-1","volume":"63","author":"G. Gardarin","year":"1989","unstructured":"Gardarin, G., Guessarian, I. and de Maindreville, C., ?Translation of logic programs into functional fixpoint equations?,Theoretical Computer Science 63, 253?274 (1989).","journal-title":"Theoretical Computer Science"},{"key":"CR11","unstructured":"Gelfond, M., ?The stable model semantics for logic programming?,Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pp. 1070?1080 (1988)."},{"key":"CR12","unstructured":"IBM Prolog for 370, Programmer's Guide, IBM document SH21-1002 (1989)."},{"key":"CR13","unstructured":"Kemp, D. and Topor, R., ?Completeness of a top down query evaluation procedure for stratified databases?,Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pp. 178?194 (1988)."},{"issue":"4","key":"CR14","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1145\/321906.321919","volume":"22","author":"R. A. Kowalski","year":"1975","unstructured":"Kowalski, R. A., ?A proof procedure using connection graphs?,Journal of the Association for Computing Machinery 22(4), 572?595 (1975).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR15","volume-title":"On Deductive Query Evaluation in the DedGin* System","author":"A. Lefebvre","year":"1989","unstructured":"Lefebvre, A. and Vielle, L.,On Deductive Query Evaluation in the DedGin* System, report, E.C.R.C., Munich, Germany (1989)."},{"key":"CR16","volume-title":"Proceedings of the DEXA 91 International Conference on Database and Expert Systems Applications","author":"C. Lell","year":"1991","unstructured":"Lell, C., ?Using a meta-knowledge method for developing an educational knowledge-based application?,Proceedings of the DEXA 91 International Conference on Database and Expert Systems Applications, Berlin, (ed. D. Karagiannis), Springer Verlag, New York (1991). Also, Diskussionspapier No. 8 (in English), Wirtschaftsuniversit\u00e4t Wien, Abteilung f\u00fcr Wirtschaftsinformatik, Augasse 6?8, A1090 Wien, Austria (1991)."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"Naughton, J., Ramakrishnan, R., Sagiv, Y. and Ullman, J., ?Efficient evaluation of right-, left- and multilinear rules?,Proceedings of the ACM SIGMOD International Conference on Management of Data, Portland, Oregon, pp. 235?242 (1989).","DOI":"10.1145\/66926.66948"},{"key":"CR18","unstructured":"Neumann, G.,Meta-Programmierung und Prolog, Addison-Wesley (1988). AlsoMeta-Interpreter Directed Compilation of Logic Programs into Prolog, Report RC 12113, IBM T.J. Watson Research Center (1986)."},{"key":"CR19","doi-asserted-by":"crossref","unstructured":"Pereira, F. and Warren, D. H. D., ?Parsing as deduction?,Proceedings of the Association for Computational Linguistics, pp. 137?144 (1983).","DOI":"10.3115\/981311.981338"},{"key":"CR20","unstructured":"Przymusinski, T., ?Perfect model semantics?,Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pp. 1081?1096 (1988)."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"Ross, K. A., ?Modular stratification and magic sets for DATALOG programs with negation?,Proceedings of the 9th ACM Symposium on Principles of Database Systems, Nashville, Tennessee, pp. 161?171 (1990).","DOI":"10.1145\/298514.298558"},{"key":"CR22","doi-asserted-by":"crossref","unstructured":"Ross, K. A., ?Modular stratification and magic sets for datalog programs with negation?, manuscript (1991).","DOI":"10.1145\/298514.298558"},{"key":"CR23","unstructured":"Seki, H. and Itoh, H., ?A query evaluation method for stratified programs under the extended cwa?,Proceedings of the Fifth International Conference and Symposium on Logic Programming, Seattle, pp. 195?211 (1988)."},{"key":"CR24","unstructured":"Sheridan, P., ?On reordering conjunctions of literals: A simple, fast algorithm?,1991 Symposium on Applied Computing, April 3?5 (1991), Kansas City, Missouri. Also: Report RC 16079, IBM T.J. Watson Research Center (1990)."},{"key":"CR25","unstructured":"Thorvaldson, J. and Walker, A., ?VLSI physical design planning using the Syllog expert database system?, Report RC 14362, IBM T.J. Watson Research Center (1989)."},{"key":"CR26","unstructured":"Tzoar, D. and Walker, A., ?The Syllog expert database system: notes for users?, Report, IBM T.J. Watson Research Center (1990)."},{"key":"CR27","volume-title":"Principles of Database and Knowledge-Base Systems. Volume II:The New Technologies","author":"J. D. Ullman","year":"1989","unstructured":"Ullman, J. D.,Principles of Database and Knowledge-Base Systems. Volume II:The New Technologies, Computer Science Press, Rockville, Maryland (1989)."},{"issue":"4","key":"CR28","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"23","author":"M. Emden van","year":"1976","unstructured":"van Emden, M. and Kowalski, R., ?The semantics of predicate logic as a programming language?,Journal of the Association for Computing Machinery 23(4), 733?742 (1976).","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vieille","year":"1989","unstructured":"Vieille, L., ?Recursive query processing: The power of logic?,Theoretical Computer Science 69, 1?53 (1989).","journal-title":"Theoretical Computer Science"},{"key":"CR30","series-title":"Technical Note","volume-title":"Proving properties of rule based systems","author":"R. Waldinger","year":"1990","unstructured":"Waldinger, R. and Stickel, M., ?Proving properties of rule based systems?, Technical Note 494, SRI International, Menlo Park, Calif. (1990)."},{"key":"CR31","series-title":"Report No.","volume-title":"Syllog: A knowledge based data management system","author":"A. Walker","year":"1981","unstructured":"Walker, A., ?Syllog: A knowledge based data management system?, Report No. 34, Department of Computer Science, New York University, New York (1981)."},{"key":"CR32","unstructured":"Walker, A., ?Backchain iteration: towards a practical inference method that is simple enough to be proved terminating, sound and complete?, Report RC 16849, IBM T.J. Watson Research Center (1991)."},{"key":"CR33","unstructured":"Walker, A., McCord, M., Sowa, J. and Wilson, W.,Knowledge Systems and Prolog: Developing Expert, Database, and Natural Language Systems, 2nd Ed., Addison-Wesley (1990)."},{"key":"CR34","unstructured":"Wallace, M., ?Unrestricted logic programs, or: If stratification is the cure, what is the malady??Proc. 9th ECAI, pp. 682?687 (1990)."}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881898\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:29:59Z","timestamp":1586042999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00881898"],"URL":"https:\/\/doi.org\/10.1007\/bf00881898","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}