{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:49:22Z","timestamp":1725533362473},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024436"},{"type":"electronic","value":"9783642024443"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02444-3_8","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T05:15:35Z","timestamp":1244265335000},"page":"117-135","source":"Crossref","is-referenced-by-count":1,"title":["Towards a Type Discipline for Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Camillo","family":"Fiorentini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Momigliano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Ornaghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. CUP (2003)","DOI":"10.1017\/CBO9780511543357"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/11562931_7","volume-title":"Logic Programming","author":"S. Baselice","year":"2005","unstructured":"Baselice, S., Bonatti, P.A., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 52\u201366. Springer, Heidelberg (2005)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-09510-1_3","volume-title":"Automata, Languages, and Programming","author":"A. Bertoni","year":"1979","unstructured":"Bertoni, A., Mauri, G., Miglioli, P.: A characterization of abstract data as model-theoretic invariants. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol.\u00a071, pp. 26\u201337. Springer, Heidelberg (1979)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/227604.227609","volume":"21","author":"P. Buneman","year":"1996","unstructured":"Buneman, P., Ohori, A.: Polymorphism and type inference in database programming. ACM Trans. Database Syst.\u00a021(1), 30\u201376 (1996)","journal-title":"ACM Trans. Database Syst."},{"issue":"3-4","key":"8_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10472-007-9076-z","volume":"50","author":"F. Calimeri","year":"2007","unstructured":"Calimeri, F., Cozza, S., Ianni, G.: External sources of knowledge and value invention in logic programming. Ann. Math. Artif. Intell.\u00a050(3-4), 333\u2013361 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/978-3-540-89982-2_37","volume-title":"ICLP 2008","author":"F. Calimeri","year":"2008","unstructured":"Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable functions in ASP: Theory and implementation. In: de la Banda, M.G., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 407\u2013424. Springer, Heidelberg (2008)"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1006\/jcss.2001.1812","volume":"64","author":"J. Bussche Van den","year":"2002","unstructured":"Van den Bussche, J., Waller, E.: Polymorphic type inference for the relational algebra. J. Comput. Syst. Sci.\u00a064(3), 694\u2013718 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Ricca, F., Gallucci, L., Schindlauer, R., Dell\u2019Armi, T., Grasso, G., Leone, N.: OntoDLV: an ASP-based system for enterprise ontologies. Journal of Logic and Computation (to appear, 2009)","DOI":"10.1093\/logcom\/exn042"},{"key":"8_CR9","volume-title":"Handbook of knowledge representation","author":"M. Gelfond","year":"2007","unstructured":"Gelfond, M.: Answer sets. In: van Harmelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of knowledge representation, vol.\u00a07. Elsevier, Amsterdam (2007)"},{"key":"8_CR10","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: ICLP\/SLP, pp. 1070\u20131080 (1988)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0304-3975(90)90107-S","volume":"89","author":"M. Hanus","year":"1991","unstructured":"Hanus, M.: Horn clause programs with polymorphic types: Semantics and resolution. Theor. Comput. Sci.\u00a089(1), 63\u2013106 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M.V. Hermenegildo","year":"2005","unstructured":"Hermenegildo, M.V., Puebla, G., Bueno, F., L\u00f3pez-Garc\u00eda, P.: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor). Sci. Comput. Programming\u00a058(1-2), 115\u2013140 (2005)","journal-title":"Sci. Comput. Programming"},{"key":"8_CR13","first-page":"1","volume-title":"Types in Logic Programming","author":"P.M. Hill","year":"1992","unstructured":"Hill, P.M., Topor, R.W.: A semantics for typed logic programs. In: Types in Logic Programming, pp. 1\u201362. MIT Press, Cambridge (1992)"},{"key":"8_CR14","unstructured":"Jefferey, D.: Expressive Type Systems for Logic Programming Languages. PhD thesis, The University of Melbourne (2002)"},{"key":"8_CR15","unstructured":"Lakshman, T.L., Reddy, U.S.: Typed PROLOG: A semantic reconstruction of the Mycroft-O\u2019Keefe type system. In: ISLP, pp. 202\u2013217 (1991)"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., et al.: The DLV system for knowledge representation and reasoning. ACM TOCL\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM TOCL"},{"key":"8_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming; (2nd extended ed.)","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of logic programming (2nd extended ed.). Springer, Heidelberg (1987)"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0004-3702(84)90017-1","volume":"23","author":"A. Mycroft","year":"1984","unstructured":"Mycroft, A., O\u2019Keefe, R.A.: A polymorphic type system for PROLOG. Artif. Intell.\u00a023(3), 295\u2013307 (1984)","journal-title":"Artif. Intell."},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/11591191_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G. Nadathur","year":"2005","unstructured":"Nadathur, G., Qi, X.: Optimizing the runtime processing of types in polymorphic logic programming languages. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol.\u00a03835, pp. 110\u2013124. Springer, Heidelberg (2005)"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/571157.571169","volume-title":"PPDP","author":"D. Overton","year":"2002","unstructured":"Overton, D., Somogyi, Z., Stuckey, P.J.: Constraint-based mode analysis of Mercury. In: PPDP, pp. 109\u2013120. ACM, New York (2002)"},{"key":"8_CR21","volume-title":"Types in logic programming","author":"F. Pfenning","year":"1992","unstructured":"Pfenning, F.: Types in logic programming. MIT Press, Cambridge (1992)"},{"issue":"1-2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artif. Intell.\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02444-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T13:35:44Z","timestamp":1552052144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02444-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024436","9783642024443"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02444-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}