{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:04Z","timestamp":1725663484078},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540550150"},{"type":"electronic","value":"9783540466468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-55015-1_13","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:23:11Z","timestamp":1330212191000},"page":"244-262","source":"Crossref","is-referenced-by-count":5,"title":["On testing effective computability of magic programs"],"prefix":"10.1007","author":[{"given":"Yehoshua","family":"Sagiv","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"No.2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0022-0000(89)90006-8","volume":"38","author":"F. Afrati","year":"1989","unstructured":"Afrati, F., Papadimitriou, C.H., Papageorgiou, G., Roussou, A., Sagiv, Y., Ullman, J.D.: On the convergence of query evaluation. J. of Computer and System Sciences, Vol. 38, No. 2 (April 1989), pp. 341\u2013359.","journal-title":"J. of Computer and System Sciences"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Sagiv, Y.: Inference of monotonicity constraints in datalog programs. Proc. ACM SIGACT-SIGART-SIGMOD Symp. on Principles of Database Systems, Philadelphia, 1989, pp. 190\u2013199.","DOI":"10.1145\/73721.73741"},{"key":"13_CR3","unstructured":"Brodsky, A., Sagiv, Y.: On termination of datalog programs. Proc. 1st International Conference on Deductive and Object-Oriented Databases, Kyoto, Japan, 1989, pp. 95\u2013112."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Brodsky, A., Sagiv, Y.: Inference of Inequality Constraints in Logic Programs. Proc. 10th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Denver, 1991.","DOI":"10.1145\/113413.113434"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Kifer, M., Lozinski, E.L.: SYGRAF-Implementing logic programs in a database style. IEEE Trans. on Software Eng., July 1988, pp. 922\u2013935.","DOI":"10.1109\/32.42735"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Kifer, M., Ramakrishnan, R., Silberschatz, A.: An axiomatic approach to deciding query safety in deductive databases. Proc. 7th ACM Symp. on Principles of Database Systems, Austin, 1988, pp. 52\u201360.","DOI":"10.1145\/308386.308412"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, R., Ramakrishnan, R., Shmueli, O.: A framework for testing safety and effective computability of extended datalog. Proc. ACM Symp. on Management of Data, Chicago, 1988, pp. 154\u2013163.","DOI":"10.1145\/50202.50219"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Morris, K., Ullman, J.D., Van Gelder, A.: Design overview of the NAIL! system. Proc. Third Int. Conf. on Logic Programming, 1986, pp. 554\u2013568.","DOI":"10.1007\/3-540-16492-8_104"},{"key":"13_CR9","unstructured":"Morris, K., Naughton, J.F., Saraiya, Y., Ullman, J.D., Van Gelder, A.: YAWN! (yet another window on NAIL!). Data Engineering, (C. Zaniolo, ed.), 10:4(1987), pp. 28\u201343."},{"key":"13_CR10","volume-title":"A Logical Language for Data and Knowledge Bases","author":"S. Naqvi","year":"1988","unstructured":"Naqvi, S., Tsur, S.: A Logical Language for Data and Knowledge Bases. Computer Science Press, Rockville, Md., 1988."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer, L.: Termination proofs for logic programs based on predicate inequalities. Proc. 7th International Conference on Logic Programming, Jerusalem, 1990, pp. 634\u2013648.","DOI":"10.1007\/3-540-52837-7"},{"key":"13_CR12","volume-title":"Lecture Notes in Artificial Intelligence 446","author":"L. Pl\u00fcmer","year":"1990","unstructured":"Pl\u00fcmer, L.: Termination Proofs for Logic Programs. Lecture Notes in Artificial Intelligence 446, Springer-Verlag, Berlin, 1990."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., Bancilhon, F., Silberschatz, A.: Safety of recursive Horn clauses with infinite relations. Proc. 6th ACM Symp. on Principles of Database Systems, San Diego, 1987, pp. 328\u2013339.","DOI":"10.1145\/28659.28694"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Sagiv, Y., Vardi, M.Y.: Safety of datalog queries over infinite databases. Proc. ACM SIGACT-SIGART-SIGMOD Symp. on Principles of Database Systems, Philadelphia, 1989, pp. 160\u2013171.","DOI":"10.1145\/73721.73738"},{"key":"13_CR15","unstructured":"Sagiv, Y.: A termination test for logic programs. To appear in Int. Logic Programming Symp., San Diego, 1991."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Shmueli, O.: Decidability and expressiveness aspects of logic queries. Proc. 6th ACM Symp. on Principles of Database Systems, San Diego, pp. 237\u2013249.","DOI":"10.1145\/28659.28685"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Sohn, K., Van Gelder, A.: Termination detection in logic programs using argument sizes. Proc. 10th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Denver, 1991.","DOI":"10.1145\/113413.113433"},{"key":"13_CR18","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-Base System. Volume 2. Computer Science Press, 1989."},{"issue":"2","key":"13_CR19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J.D. Ullman","year":"1988","unstructured":"Ullman, J.D., Van Gelder, A.: Efficient tests for top-down termination of logical rules. JACM 35:2(1988), pp. 345\u2013373.","journal-title":"JACM"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Van Gelder, A.: Deriving constraints among argument sizes in logic programs. Proc. 9th ACM SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems, Nashville, 1990, pp. 47\u201360.","DOI":"10.1145\/298514.298541"},{"key":"13_CR21","unstructured":"Zaniolo, C.: Design and implementation of a logic based language for data intensive applications. Proc. Fifth Intl. Symp. on Logic Programming, 1988, pp. 1666\u20131687."}],"container-title":["Lecture Notes in Computer Science","Deductive and Object-Oriented Databases"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55015-1_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:57:07Z","timestamp":1605646627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55015-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540550150","9783540466468"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-55015-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}