Semiring Provenance in the Infinite

Brinke, Sophie; Grädel, Erich; Mrkonjić, Lovro; Naaf, Matthias

doi:10.4230/OASIcs.Tannen.3

Abstract

Semiring provenance evaluates database queries or logical statements not just by true or false but by values in some commutative semiring. This permits to track which combinations of atomic facts are responsible for the truth of a statement, and to derive further information, for instance concerning costs, confidence scores, number of proof trees, or access levels to protected data. The focus of this approach, proposed and developed to a large extent by Val Tannen and his collaborators, has first been on (positive) database query languages, but has later been extended, again in collaboration with Val, to a systematic semiring semantics for first-order logic (and other logical systems), as well as to a method for the strategy analysis of games.
So far, semiring provenance has been studied for finite structures. To extend the semiring provenance approach for first-order logic to infinite domains, the semirings need to be equipped with addition and multiplication operators over infinite collections of values. This needs solid algebraic foundations, and we study here the necessary and desirable properties of semirings with infinitary operations to provide a well-defined and informative provenance analysis over infinite domains. We show that, with suitable definitions for such infinitary semiring, large parts of the theory of semiring provenance can be succesfully generalised to infinite structures.

K. Dannert, E. Grädel, M. Naaf, and V. Tannen. Semiring provenance for fixed-point logic. In C. Baier and J. Goubault-Larrecq, editors, 29th EACSL Annual Conference on Computer Science Logic (CSL 2021), volume 183 of Leibniz International Proceedings in Informatics (LIPIcs), pages 17:1-17:22, Dagstuhl, 2021. URL: https://doi.org/10.4230/LIPIcs.CSL.2021.17.
J. Foster, T. Green, and V. Tannen. Annotated XML: queries and provenance. In Proceedings of PODS 2008, pages 271-280, 2008. URL: https://doi.org/10.1145/1376916.1376954.
B. Glavic. Data provenance. Foundations and Trends in Databases, 9(3-4):209-441, 2021. URL: https://doi.org/10.1561/1900000068.
E. Grädel and V. Tannen. Semiring provenance for first-order model checking. arXiv:1712.01980 [cs.LO], 2017. URL: https://arxiv.org/abs/1712.01980.
E. Grädel and V. Tannen. Provenance analysis for logic and games. Moscow Journal of Combinatorics and Number Theory, 9(3):203-228, 2020. Preprint available at https://arxiv.org/abs/1907.08470. URL: https://doi.org/10.2140/moscow.2020.9.203.
E. Grädel and V. Tannen. Provenance analysis and semiring semantics for first-order logic. submitted for publication, 2024.
T. Green, G. Karvounarakis, and V. Tannen. Provenance semirings. In Principles of Database Systems PODS, pages 31-40. ACM, 2007. URL: https://doi.org/10.1145/1265530.1265535.
T. Green and V. Tannen. The semiring framework for database provenance. In Proceedings of PODS, pages 93-99. ACM, 2017. URL: https://doi.org/10.1145/3034786.3056125.
G. Markowsky. Chain-complete posets and directed sets with applications. Algebra universalis, 6(1):53-68, 1976. URL: https://doi.org/10.1007/BF02485815.
G. Markowsky. Free completely distributive lattices. Proceedings of the American Mathematical Society, 74(2):227-228, 1979. URL: https://doi.org/10.1090/S0002-9939-1979-0524290-9.
M. Naaf. Logic, Semirings, and Fixed Points. PhD thesis, RWTH Aachen University, 2024. Forthcoming.

Semiring Provenance in the Infinite

Authors Sophie Brinke , Erich Grädel , Lovro Mrkonjić , Matthias Naaf

File

Document Identifiers

Author Details

Cite As Get BibTex

Abstract

Subject Classification

ACM Subject Classification

Keywords

Metrics

References

Thanks for your feedback!

Could not send message