{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T22:40:21Z","timestamp":1707950421994},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540650140","type":"print"},{"value":"9783540497271","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49727-7_17","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T03:02:49Z","timestamp":1181185369000},"page":"278-294","source":"Crossref","is-referenced-by-count":8,"title":["Directional Type Inference for Logic Programs"],"prefix":"10.1007","author":[{"given":"Witold","family":"Charatonik","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,24]]},"reference":[{"key":"17_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58485-4_32","volume-title":"1st International Symposium on Static Analysis","author":"A. Aiken","year":"1994","unstructured":"A. Aiken and T. K. Lakshman. Directional type checking of logic programs. In B. L. Charlier, editor, 1st International Symposium on Static Analysis, volume 864 of Lecture Notes in Computer Science, pages 43\u201360, Namur, Belgium, Sept. 1994. Springer Verlag."},{"key":"17_CR2","unstructured":"K. R. Apt. Declarative programming in Prolog. In D. Miller, editor, Logic Programming-Proceedings of the 1993 International Symposium, pages 12\u201335, Vancouver, Canada, 1993. The MIT Press."},{"key":"17_CR3","unstructured":"K. R. Apt. Program verification and Prolog. In E. B\u00f6rger, editor, Specification and Validation methods for Programming languages and systems, pages 55\u201395. Oxford University Press, 1995."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Mathematical Foundations of Computer Science 1993, 18th International Symposium","author":"K. R. Apt","year":"1993","unstructured":"K. R. Apt and S. Etalle. On the unification free Prolog programs. In A. M. Borzyszkowski and S. Sokolowski, editors, Mathematical Foundations of Computer Science 1993, 18th International Symposium, volume 711 of LNCS, pages 1\u201319, Gdansk, Poland, 30 Aug.\u20133 Sept. 1993. Springer."},{"key":"17_CR5","unstructured":"J. Boye. Directional Types in Logic Programming. PhD thesis, Department of Computer and Information Science, Link\u00f6ping University, 1996."},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"J. Boye and J. Maluszynski. Two aspects of directional types. In L. Sterling, editor, Proceedings of the 12th International Conference on Logic Programming, pages 747\u2013764, Cambridge, June13\u201318 1995. MIT Press.","DOI":"10.7551\/mitpress\/4298.003.0071"},{"issue":"3","key":"17_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0743-1066(96)00144-6","volume":"33","author":"J. Boye","year":"1997","unstructured":"J. Boye and J. Maluszynski. Directional types and the annotation method. Journal of Logic Programming, 33(3):179\u2013220, Dec. 1997.","journal-title":"Journal of Logic Programming"},{"key":"17_CR8","unstructured":"F. Bronsard, T. K. Lakshman, and U. S. Reddy. A framework of directionality for proving termination of logic programs. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 321\u2013335, Washington, USA, 1992. The MIT Press."},{"key":"17_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of the Symposium on Programming Language Implementation and Logic Programming (PLILP\u201998)","author":"M. Bruynooghe","year":"1998","unstructured":"M. Bruynooghe, H. Vandecasteele, A. de Waal, and M. Denecker. Detecting unsolvable queries for definite logic programs. In Proceedings of the Symposium on Programming Language Implementation and Logic Programming (PLILP\u201998), LNCS. Springer-Verlag, 1998. to appear."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"W. Charatonik, D. McAllester, D. Niwi\u0144ski, A. Podelski, and I. Walukiewicz. The Horn mu-calculus. To appear in Vaughan Pratt, editor, Proceedings of the 13th IEEE Annual Symposium on Logic in Computer Science.","DOI":"10.1109\/LICS.1998.705643"},{"key":"17_CR11","unstructured":"W. Charatonik, D. McAllester, and A. Podelski. Computing the least and the greatest model of the set-based abstraction of logic programs. Presented at the Dagstuhl Workshop on Tree Automata, October 1997."},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"W. Charatonik and L. Pacholski. Negative set constraints with equality. In Ninth Annual IEEE Symposium on Logic in Computer Science, pages 128\u2013136, 1994.","DOI":"10.1109\/LICS.1994.316078"},{"key":"17_CR13","unstructured":"W. Charatonik and A. Podelski. Set constraints for greatest models. Technical Report MPI-I-97-2-004, Max-Planck-Institut f\u00fcr Informatik, April 1997. www.mpi-sb.mpg.de\/~podelski\/papers\/greatest.html ."},{"key":"17_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-58485-4_47","volume-title":"Proceedings of the First International Static Analysis Symposium","author":"M. Codish","year":"1994","unstructured":"M. Codish and B. Demoen. Deriving polymorphic type dependencies for logic programs using multiple incarnations of prop. In B. L. Charlier, editor, Proceedings of the First International Static Analysis Symposium, Lecture Notes in Computer Science 864, pages 281\u2013296. Springer Verlag, 1994."},{"key":"17_CR15","series-title":"Lect Notes Comput Sci","first-page":"22","volume-title":"Analysis and Verification of Multiple-Agent Languages","author":"M. Comini","year":"1996","unstructured":"M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Proving properties of logic programs by abstract diagnosis. In M. Dam, editor, Analysis and Verification of Multiple-Agent Languages, volume 1192 of LNCS, pages 22\u201350. Springer-Verlag, June 1996."},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. In Proc. POPL\u2019 92, pages 83\u201394. ACM Press, 1992.","DOI":"10.1145\/143165.143184"},{"key":"17_CR17","series-title":"SIGPLAN\/SIGARCH\/WG2.8","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/224164.224199","volume-title":"Record of FPCA\u2019 95-Conference on Functional Programming and Computer Architecture","author":"P. Cousot","year":"1995","unstructured":"P. Cousot and R. Cousot. Formal language, grammar and set-constraint-based program analysis by abstract interpretation. In Record of FPCA\u2019 95-Conference on Functional Programming and Computer Architecture, pages 170\u2013181, La Jolla, California, USA, 25\u201328 June 1995. SIGPLAN\/SIGARCH\/WG2.8, ACM Press, New York, USA."},{"key":"17_CR18","series-title":"Lect Notes Comput Sci","first-page":"127","volume-title":"Proceedings of the Static Analysis Symposium, SAS\u201997","author":"P. Devienne","year":"1997","unstructured":"P. Devienne, J.-M. Talbot, and S. Tison. Set-based analysis for logic programming and tree automata. In Proceedings of the Static Analysis Symposium, SAS\u201997, volume 1302 of LNCS, pages 127\u2013140. Springer-Verlag, 1997."},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"T. Fr\u00fchwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Sixth Annual IEEE Symposium on Logic in Computer Science, pages 300\u2013309, July 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"17_CR20","unstructured":"J. Gallagher and D. A. de Waal. Regular approximations of logic programs and their uses. Technical Report CSTR-92-06, Department of Computer Science, University of Bristol, 1992."},{"key":"17_CR21","unstructured":"J. Gallagher and D. A. de Waal. Fast and precise regular approximations of logic programs. In P. V. Hentenryck, editor, Proceedings of the Eleventh International Conference on Logic Programming, pages 599\u2013613, Santa Margherita Ligure, Italy, 1994. The MIT Press."},{"key":"17_CR22","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984."},{"key":"17_CR23","unstructured":"N. Heintze. Practical aspects of set based analysis. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 765\u2013779, Washington, USA, 1992. The MIT Press."},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"N. Heintze and J. Jaffar. A finite presentation theorem for approximating logic programs. In Seventeenth Annual ACM Symposium on Principles of Programming Languages, pages 197\u2013209, January 1990.","DOI":"10.1145\/96709.96729"},{"key":"17_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-58601-6_107","volume-title":"Proceedings of the Workshop on Principles and Practice of Constraint Programming","author":"N. Heintze","year":"1994","unstructured":"N. Heintze and J. Jaffar. Set constraints and set-based analysis. In Proceedings of the Workshop on Principles and Practice of Constraint Programming, LNCS 874, pages 281\u2013298. Springer-Verlag, 1994."},{"issue":"2\u20133","key":"17_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1992","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables. Journal of Logic Programming, 13(2\u20133):205\u2013258, 1992.","journal-title":"Journal of Logic Programming"},{"key":"17_CR27","unstructured":"P. Mishra. Towards a theory of types in Prolog. In IEEE International Symposium on Logic Programming, pages 289\u2013298, 1984."},{"key":"17_CR28","unstructured":"Y. Rouzaud and L. Nguyen-Phuong. Integrating modes and subtypes into a Prolog type-checker. In K. Apt, editor, Proceedings of the Joint International Conference and Symposium on Logic Programming, pages 85\u201397, Washington, USA, 1992. The MIT Press."},{"key":"17_CR29","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(94)00130-8","volume":"52","author":"H. Seidl","year":"1994","unstructured":"H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52:57\u201360, 1994.","journal-title":"Information Processing Letters"},{"issue":"2","key":"17_CR30","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1005812220011","volume":"18","author":"C. Weidenbach","year":"1997","unstructured":"C. Weidenbach. Spass version 0.49. Journal of Automated Reasoning, 18(2):247\u2013252, 1997.","journal-title":"Journal of Automated Reasoning"},{"key":"17_CR31","unstructured":"E. Yardeni and E. Shapiro. A type system for logic programs. In E. Shapiro, editor, Concurrent Prolog, volume 2, chapter 28, pages 211\u2013244. The MIT Press, 1987."}],"container-title":["Static Analysis","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49727-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T22:18:30Z","timestamp":1707949110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49727-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650140","9783540497271"],"references-count":31,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-49727-7_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}