{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:49Z","timestamp":1742617129820,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562870"},{"type":"electronic","value":"9783540475071"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56287-7_104","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:00:44Z","timestamp":1330254044000},"page":"176-190","source":"Crossref","is-referenced-by-count":1,"title":["Superfiniteness of query answers in deductive databases: An automata-theoretic approach"],"prefix":"10.1007","author":[{"given":"Laks V. S.","family":"Lakshmanan","sequence":"first","affiliation":[]},{"given":"Daniel A.","family":"Nonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Brodsky A. and Y. Sagiv, \u201cInference of monotonicity constraints in datalog programs,\u201d in Proc. ACM PODS, 1989, pp. 190\u2013199.","DOI":"10.1145\/73721.73741"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Brodsky, A. and Y. Sagiv, \u201cInference of inequality constraints in logic programs,\u201d in Proc. ACM PODS, 1991, pp. 227\u2013240.","DOI":"10.1145\/113413.113434"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Chomicki, J. and T. Imielinski, \u201cTemporal deductive databases and infinite objects,\u201d ACM PODS, 1988.","DOI":"10.1145\/308386.308416"},{"issue":"No.1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/69.50907","volume":"2","author":"D. Chimenti","year":"1989","unstructured":"Chimenti, D. et al., \u201cThe LDL system prototype\u201d in IEEE Trans. on Knowledge and Data Eng., Vol. 2. No. 1, 1989, pp. 76\u201390.","journal-title":"IEEE Trans. on Knowledge and Data Eng."},{"issue":"No.7","key":"13_CR5","doi-asserted-by":"publisher","first-page":"922","DOI":"10.1109\/32.42735","volume":"14","author":"M. Kifer","year":"1988","unstructured":"Kifer, M., and E.L. Lozinskii, \u201cSYGRAF: Implementing logic programs in a datalog style,\u201d in IEEE Transactions on Software Engineering, Vol. 14 No.7, 1988, pp. 922\u2013934.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"13_CR6","volume-title":"Proc. ACM PODS, 1988","author":"M. Kifer","year":"1991","unstructured":"Kifer, M., R. Ramakrishnan and A. Silberschatz, \u201cAn axiomatic approach to deciding finiteness of queries in deductive databases,\u201d in Proc. ACM PODS, 1988. (Extended version available as as Tech. Report, Department of Comp. Sci., SUNY, Stony Brook, NY, 1991.)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, R., R. Ramakrishnan, and O. Skmueli, \u201cA framework for testing safety and effective computability,\u201d in Proc. ACM SIGMOD Conf., 1988, pp. 154\u2013163.","DOI":"10.1145\/971701.50219"},{"key":"13_CR8","unstructured":"Lakshmanan V.S., and D. Nonen, \u201cOn Superfiniteness of Query Answers in Deductive Databases: An Automata-Theoretic Approach,\u201d Tech. Report, Dept. of Computer Science, Concordia University, in preparation."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Ramakrishnan, R., F. Bancilhon, and A. Silberschatz, \u201cSafety of recursive Horn clauses with infinite relations,\u201d ACM PODS, 1987.","DOI":"10.1145\/28659.28694"},{"key":"13_CR10","unstructured":"Ramakrishanan, R., personal communication, 1991."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Sohn, K. and A. Van Gelder, \u201cTermination in logic programs using argument size,\u201d in Proc. ACM PODS, 1991, pp. 216\u2013226","DOI":"10.1145\/113413.113433"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Sagiv, Y. and M. Vardi, \u201cSafety of datalog queries over infinite databases,\u201d in Proc. ACM PODS, 1989, pp. 160\u2013171.","DOI":"10.1145\/73721.73738"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Sagiv, Y., \u201cOn testing effective computability of magic programs,\u201d in Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, Dec. 1991.","DOI":"10.1007\/3-540-55015-1_13"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Skmueli, O., \u201cDecidability and expressiveness aspects of logic queries,\u201d ACM PODS, 1987, pp. 237\u2013249.","DOI":"10.1145\/28659.28685"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Tsur S., \u201cDeductive databases in action\u201d in Proc. ACM PODS, 1991, pp. 142\u2013153.","DOI":"10.1145\/113413.113426"},{"key":"13_CR16","unstructured":"Ullman, J.D., Principles of Database and Knowledge-Base Systems, Vol. I & II, Computer Science Press, 1989."},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Vardi, M., \u201cAutomata Theory for Database Theoreticians,\u201d Proc. ACM PODS, 1989.","DOI":"10.1145\/73721.73729"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56287-7_104.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:46:52Z","timestamp":1742593612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56287-7_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562870","9783540475071"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56287-7_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}