{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:36:57Z","timestamp":1752460617149},"reference-count":44,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,5,1]],"date-time":"2000-05-01T00:00:00Z","timestamp":957139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4825,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1016\/s0304-3975(98)00122-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:56:52Z","timestamp":1027605412000},"page":"131-159","source":"Crossref","is-referenced-by-count":24,"title":["Type dependencies for logic programs using ACI-unification"],"prefix":"10.1016","volume":"238","author":[{"given":"Michael","family":"Codish","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vitaly","family":"Lagoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00122-4_BIB1","first-page":"43","article-title":"Directional type checking of logic programs","volume":"vol. 864","author":"Aiken","year":"1994"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB2","series-title":"Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics","first-page":"495","article-title":"Introduction to logic programming","author":"Apt","year":"1990"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB3","unstructured":"K.R. Apt, Declarative programming in prolog, in: D. Miller, (Ed.), Logic Programming \u2013 Proc. 1993 Internat. Symp., Vancouver, Canada, 1993, MIT Press, Cambridge, MA, pp. 12\u201335."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB4","first-page":"41","article-title":"Unification theory","volume":"vol. 2","author":"Baader","year":"1994"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB5","doi-asserted-by":"crossref","unstructured":"R. Bagnara, R. Giacobazzi, G. Levi, An application of constraint propagation to data-flow analysis, in: Proc 9th IEEE Conf. on AI Applications, Orlando FL, 1993, IEEE Computer Society Press, Silverspring, MD, pp. 270\u2013276.","DOI":"10.1109\/CAIA.1993.366600"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB6","doi-asserted-by":"crossref","unstructured":"F. Bancilhon, D. Maier, Y. Sagiv, J.D. Ullman, Magic sets and other strange ways to implement logic programs, in: Proc. ACM Symp. on Principles of Database Systems, 1986, pp. 1\u201315.","DOI":"10.1145\/6012.15399"},{"issue":"3","key":"10.1016\/S0304-3975(98)00122-4_BIB7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0167-6423(92)90038-D","article-title":"A bottom-up polymorphic type inference in logic programming","volume":"19","author":"Barbuti","year":"1992","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB8","doi-asserted-by":"crossref","unstructured":"A. Bossi, M. Gabbrieli, G. Levi, M. Martelli, The s-semantics approach: Theory and applications, J. Logic Programming, to appear.","DOI":"10.1016\/0743-1066(94)90026-4"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB9","unstructured":"J. Boye, Directional Types In Logic Programming, Ph.D. thesis, Link\u00f6ping University, Sweden, 1996."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB10","doi-asserted-by":"crossref","unstructured":"J. Boye, J. Ma\u0142uszy\u0144ski, Two aspects of directional types, in L. Sterling (Ed.), Proc. 12th Internat. Conf. on Logic Programming, Kanagawa, Japan, MIT Press, Cambridge, MA, 1995.","DOI":"10.7551\/mitpress\/4298.003.0071"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB11","unstructured":"F. Bronsard, T.K. Lakshman, U.S. Reddy, A framework of directionality for proving termination of logic programs, in: Apt (Ed.), Proc. Joint Internat. Conf. and Symp. on Logic Programming, Washington, USA, November 1992, MIT Press, Cambridge, MA, pp. 321\u2013335."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB12","doi-asserted-by":"crossref","unstructured":"M. Codish, Efficient goal directed bottom-up evaluation of logic programs, Technical report, Ben-Gurion University, January 1997. ftp:\/\/ftp.cs.bgu.ac.il\/pub\/people\/codish\/fastmagic.ps.gz.","DOI":"10.7551\/mitpress\/4299.003.0048"},{"issue":"1","key":"10.1016\/S0304-3975(98)00122-4_BIB13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0304-3975(94)90055-8","article-title":"Bottom\u2013up abstract interpretation of logic programs","volume":"124","author":"Codish","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB14","doi-asserted-by":"crossref","unstructured":"M. Codish, B. Demoen, Deriving polymorphic type dependencies for logic programs using multiple incarnation of prop, in: Le Charlier (Ed.), 1st Internet. symp. on Analysis, Namur, Belgium, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 281\u2013296.","DOI":"10.1007\/3-540-58485-4_47"},{"issue":"3","key":"10.1016\/S0304-3975(98)00122-4_BIB15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0743-1066(95)00064-X","article-title":"Analyzing logic programs using \u201cPROP\u201d-ositional logic programs and a magic wand","volume":"25","author":"Codish","year":"1995","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB16","unstructured":"M. Codish, B. Demoen, K. Sagonas, General purpose semantic based analysis using XSB. Technical report, Ben-Gurion University of the Negev, January 1997. ftp:\/\/ftp.cs.bgu.ac.il\/pub\/people\/codish\/absxsb.ps."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB17","series-title":"Proc. 4th Israel Symp. on Theory of Computing and Systems","first-page":"136","article-title":"Type dependencies for logic programs using ACI-unification","author":"Codish","year":"1996"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB18","doi-asserted-by":"crossref","unstructured":"M. Codish, V. Lagoon, F. Bueno, An algebraic approach to sharing analysis of logic programs, in: P. Van Hentenryck (Ed.), Proc. 4th Int. Static Analysis Symp., Lecture Notes in Computer Science, vol. 1302, Springer, Berlin, 1997, 68\u201382.","DOI":"10.1007\/BFb0032734"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB19","doi-asserted-by":"crossref","unstructured":"A.Cortesi, G. Fil\u00e9, Abstract interpretation of logic programs: an abstract domain for groundness, sharing, freeness and compoundness analysis, in: P. Hudak, N.D. Jones (Eds.), Proc. ACM SIGPLAN Symp. on partial evaluation and semantics based program manipulation, PEPM\u201991, Sigplan Notices, vol. 26, Also available as Technical Report 4\/91 of Dip. di Matematica Universit\u00e0 di Padova (Italy), 1991, pp. 52\u201361.","DOI":"10.1145\/115865.115872"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB20","series-title":"Proc. 4th ACM Symp. on Principles of Programming Languages","first-page":"238","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977"},{"issue":"3","key":"10.1016\/S0304-3975(98)00122-4_BIB21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0304-3975(89)90070-4","article-title":"Declarative modeling of the operational behavior of logic languages","volume":"69","author":"Falaschi","year":"1989","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(98)00122-4_BIB22","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/inco.1993.1015","article-title":"A model-theoretic reconstruction of the operational semantics of logic programs","volume":"102","author":"Falaschi","year":"1993","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB23","series-title":"Meta-Programming in Logic Programming","first-page":"263","article-title":"Type inference by program transformation and partial evaluation","author":"Fr\u00fchwirth","year":"1989"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB24","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M.Y. Varai, E. Yardeni, Logic programs as types for logic programs, in: A.R. Meyer (Ed.), Proc. 6th Annual IEEE Symp. on Logic in Computer Science, Amsterdam, The Netherlands, July 1991, IEEE Computer Society Press, Silverspring, MD, pp. 300\u2013309.","DOI":"10.1109\/LICS.1991.151654"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB25","unstructured":"J. Gallagher, D.A. de Waal, Fast and precise regular approximation of logic programs, in: P. Van Hentenryck (Ed.), Proc. 11th Internat. Conf. on Logic Programming, Santa Margherita Ligure, Italy, MIT Press, Cambridge, MA, 1994, pp. 599\u2013613."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB26","unstructured":"R. Giacobazzi, S.K. Debray, G. Levi, A generalized semantics for constraint logic programs, in: Proc. Int. Conf. on 5th Generation Computer Systems, ICOT, Japan, June. ACM (Association for Computing Machinery), New York, 1992, pp. 581\u2013591."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB27","series-title":"Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, chap. 8","first-page":"633","article-title":"Semantic domains","author":"Gunter","year":"1990"},{"issue":"4","key":"10.1016\/S0304-3975(98)00122-4_BIB28","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0743-1066(92)90053-6","article-title":"Global flow analysis as a practical compilation tool","volume":"13","author":"Hermenegildo","year":"1992","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB29","doi-asserted-by":"crossref","unstructured":"D. Jacobs, A. Langen, Static Analysis of Logic Programs for Independent and Parallelism, J. Logic Programming 13(1, 2, 3 and 4) (1992) 291\u2013314.","DOI":"10.1016\/0743-1066(92)90034-Z"},{"issue":"2","key":"10.1016\/S0304-3975(98)00122-4_BIB30","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00245463","article-title":"Complexity of unification problems with associative-commutative operators","volume":"9","author":"Kapur","year":"1992","journal-title":"J. Automated Reas."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB31","doi-asserted-by":"crossref","unstructured":"M. Kifer, J. Wu, A first-order theory of types and polymorphism in logic programming, In IEEE Symp. on Logic in Computer Science, 1991.","DOI":"10.1109\/LICS.1991.151655"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB32","unstructured":"V. Lagoon, Logic program analysis using set logic programs. Master's thesis, Ben-Gurion University of the Negev, Israel, 1998."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB33","doi-asserted-by":"crossref","unstructured":"B. Le Charlier (Ed.), 1st Internat. Symp. on Static Analysis, Namur, Belgium, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, September 1994.","DOI":"10.1007\/3-540-58485-4"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB34","doi-asserted-by":"crossref","unstructured":"P. Lincoln, J. Christian, Adventures in associative\u2013commutative unification, J. Symbolic Comput. 8 (1989) 217\u2013240. Appears also in: C. Kirchner (Ed.), Unification, Academic Press, New York, 1990, pp. 393\u2013416.","DOI":"10.1016\/S0747-7171(89)80026-4"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB35","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"issue":"4","key":"10.1016\/S0304-3975(98)00122-4_BIB36","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/176454.176519","article-title":"Precise and efficient groundness analysis for logic programs","volume":"2","author":"Marriott","year":"1993","journal-title":"ACM Lett. on Programming Languages and Systems (LOPLAS)"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB37","unstructured":"D. Pedreschi, A proof method for run-time properties of Prolog programs, in: P. Van Hentenryck (Ed.), Proc. 11th Internet. Conf. on Logic Programming, Santa Margherita Ligure, Italy, MIT Press, Cambridge, MA, 1994, pp. 584\u2013598."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB38","unstructured":"F. Pfenning (Ed.) Types in Logic Programming, MIT Press, Cambridge, MA, 1992."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB39","series-title":"Proc. North American Conf. on Logic Programming\u201989","first-page":"1115","article-title":"Inference of polymorphic types for logic programming","author":"Pyo","year":"1989"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB40","unstructured":"Y. Rouzaud, L. Nguyen-Phuong, Integrating modes and subtypes into a Prolog type-checker, in: Apt (Ed.), Proc. Joint Internat. Conf. and Symp. on Logic Programming, Washington, USA, MIT Press, Cambridge, MA, 1992, pp. 85\u201397."},{"issue":"2","key":"10.1016\/S0304-3975(98)00122-4_BIB41","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A unification algorithm for associative\u2013commutative functions","volume":"28","author":"Stickel","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB42","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(98)00122-4_BIB43","doi-asserted-by":"crossref","unstructured":"P. Van Hentenryck (Ed.), Proc. 11th Internat. Conf. on Logic Programming, Santa Margherita Ligure, Italy, MIT Press, Cambridge, MA, 1994.","DOI":"10.7551\/mitpress\/4316.001.0001"},{"key":"10.1016\/S0304-3975(98)00122-4_BIB44","unstructured":"J. Xu, D.S. Warren, A type inference system for Prolog, in: R.A. Kowalski, Kenneth A. Bowen (Ed.s), Proc. 5th Internat. Conf. and Symp. on Logic Programming, Seatle, ALP, IEEE, MIT Press, Cambridge, MA, 1988, pp. 604\u2013619."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T09:41:07Z","timestamp":1704015667000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":44,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,5]]}},"alternative-id":["S0304397598001224"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00122-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,5]]}}}