{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T04:14:30Z","timestamp":1749615270927,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319476766"},{"type":"electronic","value":"9783319476773"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47677-3_9","type":"book-chapter","created":{"date-parts":[[2016,10,5]],"date-time":"2016-10-05T10:17:10Z","timestamp":1475662630000},"page":"136-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Identifying XML Schema Constraints Using Temporal Logic"],"prefix":"10.1007","author":[{"given":"Ruifang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ke","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongli","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zongyan","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,6]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-46093-4_9","volume-title":"Database Programming Languages","author":"HV Jagadish","year":"2002","unstructured":"Jagadish, H.V., Lakshmanan, L.V.S., Srivastava, D., Thompson, K.: TAX: a tree algebra for XML. In: Ghelli, G., Grahne, G. (eds.) DBPL 2001. LNCS, vol. 2397, pp. 149\u2013164. Springer, Heidelberg (2002). doi: 10.1007\/3-540-46093-4_9"},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s00778-002-0076-7","volume":"11","author":"S Amer-Yahia","year":"2002","unstructured":"Amer-Yahia, S., Cho, S.R., Lakshmanan, L.V.S., et al.: Tree pattern query minimization. VLDB J. Int. J. Very Large Data Bases 11(4), 315\u2013331 (2002)","journal-title":"VLDB J. Int. J. Very Large Data Bases"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1108\/17440080710834265","volume":"3","author":"D Che","year":"2007","unstructured":"Che, D.: An efficient algorithm for tree pattern query minimization under broad integrity constraints. Int. J. Web Inform. Syst. 3(3), 231\u2013256 (2007)","journal-title":"Int. J. Web Inform. Syst."},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chen, D., Chan, C.Y.: Minimization of tree pattern queries with constraints. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 609\u2013622 (2008)","DOI":"10.1145\/1376616.1376678"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11280-010-0089-x","volume":"13","author":"KH Lee","year":"2010","unstructured":"Lee, K.H., Whang, K.Y., Han, W.S.: Xmin: minimizing tree pattern queries with minimality guarantee. World Wide Web 13(3), 343\u2013371 (2010)","journal-title":"World Wide Web"},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.4304\/jsw.8.6.1479-1486","volume":"8","author":"H Li","year":"2013","unstructured":"Li, H., Liao, H.S., Su, H.: Optimize twig query pattern based on XML schema. J. Softw. 8(6), 1479\u20131486 (2013)","journal-title":"J. Softw."},{"key":"9_CR7","unstructured":"Huth, M., Ryan, M.: Logic in Computer Science, 2nd edn., pp. 207\u2013216. Cambridge University Press, Cambridge (2005)"},{"issue":"4","key":"9_CR8","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/1516507.1516509","volume":"31","author":"S Kalvala","year":"2009","unstructured":"Kalvala, S., Warburton, R., Lacey, D.: Program transformations using temporal logic side conditions. ACM Trans. Program. Lang. Syst. (TOPLAS) 31(4), 824\u2013833 (2009)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"6","key":"9_CR9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TIME.2004.1314428","volume":"152","author":"L Afanasiev","year":"2004","unstructured":"Afanasiev, L., Franceschet, M., Marx, M., et al.: Ctl model checking for processing simple xpath queries. Proc. Temp. Represent. Reasoning 152(6), 117\u2013124 (2004)","journal-title":"Proc. Temp. Represent. Reasoning"},{"issue":"8","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1361","DOI":"10.1109\/TKDE.2011.74","volume":"24","author":"FA Currim","year":"2012","unstructured":"Currim, F.A., Currim, S.A., Dyreson, C.E., et al.: Adding temporal constraints to XML schema. IEEE Trans. Knowl. Data Eng. 24(8), 1361\u20131377 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-89439-1_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L Libkin","year":"2008","unstructured":"Libkin, L., Sirangelo, C.: Reasoning about XML with temporal logics and automata. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 97\u2013112. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-89439-1_7"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/11523468_4","volume-title":"Automata, Languages and Programming","author":"L Libkin","year":"2005","unstructured":"Libkin, L.: Logics for unranked trees: an overview. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 35\u201350. Springer, Heidelberg (2005). doi: 10.1007\/11523468_4"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/11965893_25","volume-title":"Database Theory \u2013 ICDT 2007","author":"M Arenas","year":"2006","unstructured":"Arenas, M., Barcel\u00f3, P., Libkin, L.: Combining temporal logics for querying XML documents. In: Schwentick, T., Suciu, D. (eds.) ICDT 2007. LNCS, vol. 4353, pp. 359\u2013373. Springer, Heidelberg (2006). doi: 10.1007\/11965893_25"},{"issue":"11","key":"9_CR14","doi-asserted-by":"publisher","first-page":"2977","DOI":"10.3724\/SP.J.1001.2009.03422","volume":"20","author":"JM Zhang","year":"2009","unstructured":"Zhang, J.M., Tao, S.Q., Liang, J.Y.: Minimization of path expression under structural integrity constraints for XML. J. Softw. 20(11), 2977\u20132987 (2009)","journal-title":"J. Softw."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/3-540-54415-1_54","volume-title":"Theoretical Aspects of Computer Software","author":"B Steffen","year":"1991","unstructured":"Steffen, B.: Data flow analysis as model checking. In: Ito, T., Meyer, A.R. (eds.) TACS 1991. LNCS, vol. 526, pp. 346\u2013364. Springer, Heidelberg (1991). doi: 10.1007\/3-540-54415-1_54"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-18088-5_22","volume-title":"Automata, Languages and Programming","author":"T Hafer","year":"1987","unstructured":"Hafer, T., Thomas, W.: Computation tree logic CTL* and path quantifiers in the monadic theory of the binary tree. In: Ottmann, T. (ed.) ICALP 1987. LNCS, vol. 267, pp. 269\u2013279. Springer, Heidelberg (1987). doi: 10.1007\/3-540-18088-5_22"},{"key":"9_CR17","unstructured":"Kupferman, O., Pnueli, A.: Once and for all. In: Proceedings of the 10th LICS, pp. 25\u201335"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-78499-9_14","volume-title":"Foundations of Software Science and Computational Structures","author":"L Bozzelli","year":"2008","unstructured":"Bozzelli, L.: The complexity of CTL* + linear past. In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 186\u2013200. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-78499-9_14"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Pistore, M., Vardi, M.Y.: The planning spectrum - one, two, three, infinity. In: Proceedings of the 18th LICS, pp. 234\u2013243","DOI":"10.1109\/LICS.2003.1210063"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Kupferman, O., Vardi, M.Y.: Memoryful branching-time logic. In: Proceedings of the 21th LICS, pp. 265\u2013274","DOI":"10.1109\/LICS.2006.34"},{"key":"9_CR21","unstructured":"http:\/\/www.lsv.ens-cachan.fr\/~markey\/PLTL.php"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past.In: Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), Copenhagen, Denmark, July 2002, pp. 383\u2013392. IEEE Comp. Soc. Press (2002)","DOI":"10.1109\/LICS.2002.1029846"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering: Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47677-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T23:58:33Z","timestamp":1749599913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47677-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319476766","9783319476773"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47677-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"6 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}