{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T18:12:15Z","timestamp":1759515135981,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031436185"},{"type":"electronic","value":"9783031436192"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43619-2_49","type":"book-chapter","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:02:40Z","timestamp":1695481360000},"page":"729-744","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Data Graphs with\u00a0Incomplete Information (and a\u00a0Way to\u00a0Complete Them)"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Areces","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Cassano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danae","family":"Dutto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Fervari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,24]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1613\/jair.5637","volume":"61","author":"S Abriola","year":"2018","unstructured":"Abriola, S., Barcel\u00f3, P., Figueira, D., Figueira, S.: Bisimulations on data graphs. J. Artif. Intell. Res. 61, 171\u2013213 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"49_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2023.108948","volume":"160","author":"S Abriola","year":"2023","unstructured":"Abriola, S., Cifuentes, S., Martinez, M., Pardal, N., Pin, E.: An epistemic approach to model uncertainty in data-graphs. Int. J. Approximate Reason. 160, 108948 (2023)","journal-title":"Int. J. Approximate Reason."},{"key":"49_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jcss.2017.05.008","volume":"89","author":"S Abriola","year":"2017","unstructured":"Abriola, S., Descotte, M.E., Fervari, R., Figueira, S.: Axiomatizations for downward XPath on data trees. J. Comput. Syst. Sci. 89, 209\u2013245 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1322432.1322433","volume":"40","author":"R Angles","year":"2008","unstructured":"Angles, R., Guti\u00e9rrez, C.: Survey of graph database models. ACM Comput. Surv. 40(1), 1:1-1:39 (2008)","journal-title":"ACM Comput. Surv."},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Areces, C., ten Cate, B.: Hybrid logics. In: Handbook of Modal Logic, pp. 821\u2013868. Elsevier (2006)","DOI":"10.1016\/S1570-2464(07)80017-6"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Areces, C., Fervari, R.: Axiomatizing hybrid XPath with data. Log. Methods Comput. Sci. 17(3) (2021)","DOI":"10.46298\/lmcs-17(3:5)2021"},{"issue":"4","key":"49_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1093\/jigpal\/jzv020","volume":"23","author":"C Areces","year":"2015","unstructured":"Areces, C., Fervari, R., Hoffmann, G.: Relation-changing modal operators. Logic J. IGPL 23(4), 601\u2013627 (2015)","journal-title":"Logic J. IGPL"},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-319-65340-2_50","volume-title":"Progress in Artificial Intelligence","author":"C Areces","year":"2017","unstructured":"Areces, C., Fervari, R., Seiler, N.: Tableaux for hybrid XPath with data. In: Oliveira, E., Gama, J., Vale, Z., Lopes Cardoso, H. (eds.) EPIA 2017. LNCS (LNAI), vol. 10423, pp. 611\u2013623. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65340-2_50"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Arenas, M., Fan, W., Libkin, L.: On verifying consistency of XML specifications. In: 21st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2002), pp. 259\u2013270. ACM (2002)","DOI":"10.1145\/543613.543647"},{"issue":"2","key":"49_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1093\/logcom\/exx034","volume":"28","author":"G Aucher","year":"2018","unstructured":"Aucher, G., van Benthem, J., Grossi, D.: Modal logics of sabotage revisited. J. Logic Comput. 28(2), 269\u2013303 (2018)","journal-title":"J. Logic Comput."},{"key":"49_CR11","unstructured":"Baelde, D., Lunel, S., Schmitz, S.: A sequent calculus for a modal logic on finite data trees. In: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), LIPIcs, vol. 62, pp. 32:1\u201332:16. Schloss Dagstuhl (2016)"},{"issue":"1","key":"49_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/2559905","volume":"61","author":"P Barcel\u00f3","year":"2014","unstructured":"Barcel\u00f3, P., Libkin, L., Reutter, J.L.: Querying regular graph patterns. J. ACM 61(1), 81\u2013854 (2014)","journal-title":"J. ACM"},{"key":"49_CR13","volume-title":"Handbook of Modal Logic","author":"P Blackburn","year":"2006","unstructured":"Blackburn, P., van Benthem, J., Wolter, F.: Handbook of Modal Logic. Elsevier, Amsterdam (2006)"},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s11225-006-9009-6","volume":"84","author":"P Blackburn","year":"2006","unstructured":"Blackburn, P., ten Cate, B.: Pure extensions, proof rules, and hybrid axiomatics. Stud. Logica. 84(2), 277\u2013322 (2006)","journal-title":"Stud. Logica."},{"key":"49_CR15","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)","DOI":"10.1145\/1516512.1516515"},{"key":"49_CR17","doi-asserted-by":"publisher","unstructured":"Bra\u00fcner, T.: Hybrid Logics and its Proof-Theory, Applied Logics Series, vol. 37. Springer, Cham (2011). https:\/\/doi.org\/10.1007\/978-94-007-0002-4","DOI":"10.1007\/978-94-007-0002-4"},{"issue":"3","key":"49_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.3166\/jancl.20.139-171","volume":"20","author":"B ten Cate","year":"2010","unstructured":"ten Cate, B., Fontaine, G., Litak, T.: Some modal aspects of XPath. J. Appl. Non-Class. Logics 20(3), 139\u2013171 (2010)","journal-title":"J. Appl. Non-Class. Logics"},{"issue":"2","key":"49_CR19","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.jal.2009.09.002","volume":"8","author":"B ten Cate","year":"2010","unstructured":"ten Cate, B., Litak, T., Marx, M.: Complete axiomatizations for XPath fragments. J. Appl. Logic 8(2), 153\u2013172 (2010)","journal-title":"J. Appl. Logic"},{"key":"49_CR20","unstructured":"Clark, J., DeRose, S.: XML path language (XPath). Website (1999). W3C Recommendation. http:\/\/www.w3.org\/TR\/xpath"},{"key":"49_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85108-0","volume-title":"Logic and Structure","author":"D van Dalen","year":"2013","unstructured":"van Dalen, D.: Logic and Structure, 5th edn. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-540-85108-0","edition":"5"},{"key":"49_CR22","unstructured":"Figueira, D.: Reasoning on Words and Trees with Data. PhD thesis, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (2010)"},{"issue":"4","key":"49_CR23","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/2362355.2362362","volume":"13","author":"D Figueira","year":"2012","unstructured":"Figueira, D.: Decidability of downward XPath. ACM Trans. Comput. Logic 13(4), 34 (2012)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"1","key":"49_CR24","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF00136118","volume":"3","author":"R Goldblatt","year":"1984","unstructured":"Goldblatt, R.: An abstract setting for Henkin proofs. Topoi 3(1), 37\u201341 (1984)","journal-title":"Topoi"},{"issue":"2","key":"49_CR25","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/1071610.1071614","volume":"30","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Koch, C., Pichler, R.: Efficient algorithms for processing XPath queries. ACM Trans. Database Syst. 30(2), 444\u2013491 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"49_CR26","unstructured":"Grabon, M., Michaliszyn, J., Otop, J., Wieczorek, P.: Querying data graphs with arithmetical regular expressions. In: 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 1088\u20131094. IJCAI\/AAAI Press (2016)"},{"issue":"2","key":"49_CR27","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2850413","volume":"63","author":"L Libkin","year":"2016","unstructured":"Libkin, L., Martens, W., Vrgo\u010d, D.: Querying graphs with data. J. ACM 63(2), 14:1-14:53 (2016)","journal-title":"J. ACM"},{"key":"49_CR28","doi-asserted-by":"crossref","unstructured":"Libkin, L., Vrgo\u010d, D.: Regular path queries on graphs with data. In: International Conference on Database Theory (ICDT 2012), pp. 74\u201385. ACM (2012)","DOI":"10.1145\/2274576.2274585"},{"issue":"2","key":"49_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11229-007-9168-7","volume":"158","author":"J Plaza","year":"2007","unstructured":"Plaza, J.: Logics of public communications. Synthese 158(2), 165\u2013179 (2007)","journal-title":"Synthese"},{"key":"49_CR30","volume-title":"Graph Databases","author":"I Robinson","year":"2013","unstructured":"Robinson, I., Webber, J., Eifrem, E.: Graph Databases. O\u2019Reilly Media Inc., Newton (2013)"},{"issue":"2","key":"49_CR31","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/01611190601133539","volume":"31","author":"A Schinner","year":"2007","unstructured":"Schinner, A.: The Voynich manuscript: evidence of the hoax hypothesis. Cryptologia 31(2), 95\u2013107 (2007)","journal-title":"Cryptologia"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43619-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T15:10:38Z","timestamp":1695481838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43619-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031436185","9783031436192"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43619-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.jelia.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"111","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}