Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1007/978-3-031-43619-2_49guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Data Graphs with Incomplete Information (and a Way to Complete Them)

Published: 24 September 2023 Publication History

Abstract

We introduce a modal language for reasoning about data graphs with incomplete information. Such data graphs are formally represented as models in which data value functions are partial—to capture what is unknown. In this setting, we also allow for unknown data values to be learned. Our main result is a sound and strongly complete axiomatization for the logic.

References

[1]
Abriola S, Barceló P, Figueira D, and Figueira S Bisimulations on data graphs J. Artif. Intell. Res. 2018 61 171-213
[2]
Abriola S, Cifuentes S, Martinez M, Pardal N, and Pin E An epistemic approach to model uncertainty in data-graphs Int. J. Approximate Reason. 2023 160
[3]
Abriola S, Descotte ME, Fervari R, and Figueira S Axiomatizations for downward XPath on data trees J. Comput. Syst. Sci. 2017 89 209-245
[4]
Angles R and Gutiérrez C Survey of graph database models ACM Comput. Surv. 2008 40 1 1:1-1:39
[5]
Areces, C., ten Cate, B.: Hybrid logics. In: Handbook of Modal Logic, pp. 821–868. Elsevier (2006)
[6]
Areces, C., Fervari, R.: Axiomatizing hybrid XPath with data. Log. Methods Comput. Sci. 17(3) (2021)
[7]
Areces C, Fervari R, and Hoffmann G Relation-changing modal operators Logic J. IGPL 2015 23 4 601-627
[8]
Areces C, Fervari R, and Seiler N Oliveira E, Gama J, Vale Z, and Lopes Cardoso H Tableaux for hybrid XPath with data Progress in Artificial Intelligence 2017 Cham Springer 611-623
[9]
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–270. ACM (2002)
[10]
Aucher G, van Benthem J, and Grossi D Modal logics of sabotage revisited J. Logic Comput. 2018 28 2 269-303
[11]
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–32:16. Schloss Dagstuhl (2016)
[12]
Barceló P, Libkin L, and Reutter JL Querying regular graph patterns J. ACM 2014 61 1 81-854
[13]
Blackburn P, van Benthem J, and Wolter F Handbook of Modal Logic 2006 Amsterdam Elsevier
[14]
Blackburn P and ten Cate B Pure extensions, proof rules, and hybrid axiomatics Stud. Logica. 2006 84 2 277-322
[15]
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press (2001)
[16]
Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. J. ACM 56(3) (2009)
[17]
Braüner, T.: Hybrid Logics and its Proof-Theory, Applied Logics Series, vol. 37. Springer, Cham (2011).
[18]
ten Cate B, Fontaine G, and Litak T Some modal aspects of XPath J. Appl. Non-Class. Logics 2010 20 3 139-171
[19]
ten Cate B, Litak T, and Marx M Complete axiomatizations for XPath fragments J. Appl. Logic 2010 8 2 153-172
[20]
Clark, J., DeRose, S.: XML path language (XPath). Website (1999). W3C Recommendation. http://www.w3.org/TR/xpath
[21]
van Dalen D Logic and Structure 2013 5 Berlin Springer
[22]
Figueira, D.: Reasoning on Words and Trees with Data. PhD thesis, Laboratoire Spécification et Vérification, ENS Cachan, France (2010)
[23]
Figueira D Decidability of downward XPath ACM Trans. Comput. Logic 2012 13 4 34
[24]
Goldblatt R An abstract setting for Henkin proofs Topoi 1984 3 1 37-41
[25]
Gottlob G, Koch C, and Pichler R Efficient algorithms for processing XPath queries ACM Trans. Database Syst. 2005 30 2 444-491
[26]
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–1094. IJCAI/AAAI Press (2016)
[27]
Libkin L, Martens W, and Vrgoč D Querying graphs with data J. ACM 2016 63 2 14:1-14:53
[28]
Libkin, L., Vrgoč, D.: Regular path queries on graphs with data. In: International Conference on Database Theory (ICDT 2012), pp. 74–85. ACM (2012)
[29]
Plaza J Logics of public communications Synthese 2007 158 2 165-179
[30]
Robinson I, Webber J, and Eifrem E Graph Databases 2013 Newton O’Reilly Media Inc.
[31]
Schinner A The Voynich manuscript: evidence of the hoax hypothesis Cryptologia 2007 31 2 95-107

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings
Logics in Artificial Intelligence: 18th European Conference, JELIA 2023, Dresden, Germany, September 20–22, 2023, Proceedings
Sep 2023
833 pages
ISBN:978-3-031-43618-5
DOI:10.1007/978-3-031-43619-2
  • Editors:
  • Sarah Gaggl,
  • Maria Vanina Martinez,
  • Magdalena Ortiz

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 24 September 2023

Author Tags

  1. Data Graphs
  2. Incomplete Data
  3. Modal/Intuitionistic Logic

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 03 Oct 2024

Other Metrics

Citations

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media