{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:01:24Z","timestamp":1725559284949},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278283"},{"type":"electronic","value":"9783540316756"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11526988_10","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T20:27:30Z","timestamp":1279139250000},"page":"305-317","source":"Crossref","is-referenced-by-count":0,"title":["Towards Types for Web Rule Languages"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Drabent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"Data on the Web: From Relations to Semistructured Data and XML","author":"S. Abiteboul","year":"1999","unstructured":"Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Francisco (1999)"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1016\/S0022-0000(03)00032-1","volume":"66","author":"N. Alon","year":"2003","unstructured":"Alon, N., Milo, T., Neven, F., Suciu, D., Vianu, V.: XML with data values: Typechecking revisited. J. Comput. Syst. Sci.\u00a066(4), 688\u2013727 (2003)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology (April 2001)","key":"10_CR3"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1006\/inco.1997.2695","volume":"142","author":"A. Br\u00fcggemann-Klein","year":"1998","unstructured":"Br\u00fcggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Information and Computation\u00a0142(2), 182\u2013206 (1998)","journal-title":"Information and Computation"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30122-6_1","volume-title":"Principles and Practice of Semantic Web Reasoning","author":"F. Bry","year":"2004","unstructured":"Bry, F., Drabent, W., Ma\u0142uszy\u0144ski, J.: On subtyping of treestructured data: A polynomial approach. In: Ohlbach, H.J., Schaffert, S. (eds.) PPSWR 2004. LNCS, vol.\u00a03208, pp. 1\u201318. Springer, Heidelberg (2004)"},{"unstructured":"Clark, J., Murata, M. (eds.): RELAX NG specification (December 2001), \n                  \n                    http:\/\/www.oasis-open.org\/committees\/relax-ng\/spec-20011203.html","key":"10_CR6"},{"unstructured":"Common, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2002), \n                  \n                    http:\/\/www.grappa.univ-ille3.fr\/tata\/","key":"10_CR7"},{"key":"10_CR8","first-page":"157","volume-title":"Types in Logic Programming","author":"P. Dart","year":"1992","unstructured":"Dart, P., Zobel, J.: A regular type language for logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 157\u2013187. The MIT Press, Cambridge (1992)"},{"issue":"4\u20135","key":"10_CR9","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S1471068402001473","volume":"2","author":"W. Drabent","year":"2002","unstructured":"Drabent, W., Maluszynski, J., Pietrzak, P.: Using parametric set constraints for locating errors in CLP programs. Theory and Practice of Logic Programming\u00a02(4\u20135), 549\u2013610 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"unstructured":"Extensible markup language (XML) 1.0 (second edition), W3C recommendation (October 6, 2000), \n                  \n                    http:\/\/www.w3.org\/TR\/REC-xml","key":"10_CR10"},{"unstructured":"Fallside, D.C. (ed.): XML Schema part 0: Primer. W3C Recommendation (2001), \n                  \n                    http:\/\/www.w3.org\/TR\/xmlschema-0\/","key":"10_CR11"},{"key":"10_CR12","first-page":"599","volume-title":"Proc. of the Eleventh International Conference on Logic Programming","author":"J. Gallagher","year":"1994","unstructured":"Gallagher, J., de Waal, D.A.: Fast and precise regular approximations of logic programs. In: Van Hentenryck, P. (ed.) Proc. of the Eleventh International Conference on Logic Programming, pp. 599\u2013613. The MIT Press, Cambridge (1994)"},{"key":"10_CR13","series-title":"BeyondWords","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. BeyondWords, vol.\u00a03. Springer-Verlag, Heidelberg (1997)"},{"key":"10_CR14","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation, 2nd edn. Addison-Wesley, Reading (2001)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: ICFP 2000, pp. 11\u201322 (2000)","key":"10_CR15","DOI":"10.1145\/351240.351242"},{"key":"10_CR16","series-title":"The Art of Computer Programming","volume-title":"Fundamental Algorithms","author":"E. Donald","year":"1973","unstructured":"Donald, E.: Fundamental Algorithms, 2nd edn. The Art of Computer Programming. Addison-Wesley, Reading (1973)","edition":"2"},{"doi-asserted-by":"crossref","unstructured":"Martens, W., Neven, F.: Frontiers of tractability for typechecking simple XML transformations. In: PODS 2004, pp. 23\u201334 (2004)","key":"10_CR17","DOI":"10.1145\/1055558.1055563"},{"unstructured":"Murata, M., Lee, D., Mani, M.: Taxonomy of XML schema languages using formal language theory. In: Extreme Markup Langages, Montreal, Canada (2001), \n                  \n                    http:\/\/www.cs.ucla.edu\/~dongwon\/paper\/","key":"10_CR18"},{"unstructured":"Murata, M., Lee, D., Mani, M., Kawaguchi, K.: Taxonomy of XML schema languages using formal language theory (2003) (submitted)","key":"10_CR19"},{"unstructured":"Neven, F., Schwentick, T.: XML schemas without order. Unpublished (1999)","key":"10_CR20"},{"unstructured":"Schaffert, S., Bry, F.: Querying the Web Reconsidered: A Practical Introduction to Xcerpt. In: Proceedings of Extreme Markup Languages 2004, Montreal, Quebec, Canada, August 2-6 (2004)","key":"10_CR21"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-24572-8_9","volume-title":"Principles and Practice of Semantic Web Reasoning","author":"A. Wilk","year":"2003","unstructured":"Wilk, A., Drabent, W.: On types for XML query language xcerpt. In: Bry, F., Henze, N., Ma\u0142uszy\u0144ski, J. (eds.) PPSWR 2003. LNCS, vol.\u00a02901, pp. 128\u2013145. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Reasoning Web"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11526988_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:48:00Z","timestamp":1619506080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11526988_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278283","9783540316756"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11526988_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}