C. Bourgaux, A. Ozaki, R. Peñaloza & L. Predoiu (2020):
Provenance for the Description Logic ELHr.
In: Proceedings of IJCAI 2020,
pp. 1862–1869,
doi:10.24963/ijcai.2020/258.
J. Bradfield & I. Walukiewicz (2018):
The mu-calculus and model checking.
In: E. Clarke, T. Henzinger, H. Veith & R. Bloem: Handbook of Model Checking.
Springer,
pp. 871–919,
doi:10.1007/978-3-319-10575-8_26.
F. Canavoi, E Grädel, S. Lessenich & W. Pakusa (2015):
Defining winning strategies in fixed-point logic.
In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS),
pp. 366–377,
doi:10.1109/LICS.2015.42.
K. Chatterjee, W. Dvorák, M. Henzinger & V. Loitzenbauer (2016):
Conditionally Optimal Algorithms for Generalized Büchi Games.
arXiv:1607.05850 [cs.DS].
Available at http://arxiv.org/abs/1607.05850.
K. Chatterjee & M. Henzinger (2014):
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition.
J. ACM 61(3),
pp. 15:1–15:40,
doi:10.1145/2597631.
K. Chatterjee, T. Henzinger & N. Piterman (2008):
Algorithms for Büchi Games.
arXiv:0805.2620 [cs.GT].
Available at http://arxiv.org/abs/0805.2620.
K. Dannert & E. Grädel (2019):
Provenance Analysis: A Perspective for Description Logics?.
In: C. Lutz et al.: Description Logic, Theory Combination, and All That,
Lecture Notes in Computer Science 11560.
Springer,
pp. 266–285,
doi:10.1007/978-3-030-22102-7_12.
K. Dannert & E. Grädel (2020):
Semiring Provenance for guarded logics.
In: Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory through Algebraic Logic,
Outstanding Contributions to Logic.
Springer,
pp. 53–79,
doi:10.1007/978-3-030-64187-0_3.
K. Dannert, E. Grädel, M. Naaf & V. Tannen (2021):
Semiring Provenance for Fixed-Point Logic.
In: C. Baier & J. Goubault-Larrecq: 29th EACSL Annual Conference on Computer Science Logic (CSL 2021),
Leibniz International Proceedings in Informatics (LIPIcs) 183,
Dagstuhl,
pp. 17:1–17:22,
doi:10.4230/LIPIcs.CSL.2021.17.
D. Deutch, T. Milo, S. Roy & V. Tannen (2014):
Circuits for Datalog Provenance.
In: Proc. 17th International Conference on Database Theory ICDT.
OpenProceedings.org,
pp. 201–212,
doi:10.5441/002/icdt.2014.22.
J. Duparc (2003):
Positive games and persistent strategies.
In: International Workshop on Computer Science Logic.
Springer,
pp. 183–196,
doi:10.1007/978-3-540-45220-1_17.
F. Geerts & A. Poggi (2010):
On database query languages for K-relations.
Journal of Applied Logic 8(2),
pp. 173–185,
doi:10.1016/j.jal.2009.09.001.
E. Grädel, P. G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M. Y. Vardi, Y. Venema & S. Weinstein (2007):
Finite Model Theory and Its Applications.
Texts in Theoretical Computer Science. An EATCS Series.
Springer,
doi:10.1007/3-540-68804-8.
E. Grädel, N. Lücking & M. Naaf (2021):
Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials.
arXiv:2106.12892 [cs.LO].
Available at https://arxiv.org/abs/2106.12892.
E. Grädel & V. Tannen (2017):
Semiring Provenance for First-Order Model Checking.
arXiv:1712.01980 [cs.LO].
Available at https://arxiv.org/abs/1712.01980.
E. Grädel & V. Tannen (2020):
Provenance analysis for logic and games.
Moscow Journal of Combinatorics and Number Theory 9(3),
pp. 203–228,
doi:10.2140/moscow.2020.9.203.
Preprint available at https://arxiv.org/abs/1907.08470.
E. Grädel, W. Thomas & T. Wilke (2002):
Automata, Logics, and Infinite Games.
Lecture Notes in Compter Science 2500.
Springer,
doi:10.1007/3-540-36387-4.
T. Green, G. Karvounarakis & V. Tannen (2007):
Provenance semirings.
In: Principles of Database Systems PODS,
pp. 31–40,
doi:10.1145/1265530.1265535.
T. Green & V. Tannen (2017):
The Semiring Framework for Database Provenance.
In: Proceedings of PODS.
ACM,
pp. 93–99,
doi:10.1145/3034786.3056125.
J. Marcinkowski & T. Truderung (2002):
Optimal complexity bounds for positive LTL games.
In: International Workshop on Computer Science Logic.
Springer,
pp. 262–275,
doi:10.1007/3-540-45793-3_18.
M. Mohri (2002):
Semiring frameworks and algorithms for shortest-distance problems.
Journal of Automata, Languages and Combinatorics 7(3),
pp. 321–350,
doi:10.25596/jalc-2002-321.
M. Naaf (2021):
Computing Least and Greatest Fixed Points in Absorptive Semirings.
arXiv:2106.00399 [cs.LO].
Available at https://arxiv.org/abs/2106.00399.
A. Ozaki & R. Peñaloza (2018):
Provenance in Ontology-based Data Access.
In: Description Logics 2018,
CEUR Workshop Proceedings 2211.
Available at http://ceur-ws.org/Vol-2211/paper-28.pdf.
M. Raghothaman, J. Mendelson, D. Zhao, M. Naik & B. Scholz (2020):
Provenance-guided synthesis of Datalog programs.
Proc. ACM Program. Lang. 4,
pp. 62:1–62:27,
doi:10.1145/3371130.
P. Senellart (2017):
Provenance and Probabilities in Relational Databases: From Theory to Practice.
SIGMOD Record 46(4),
pp. 5–15,
doi:10.1145/3186549.3186551.
I. Walukiewicz (2002):
Monadic second-order logic on tree-like structures.
Theoretical Computer Science 275,
pp. 311–346,
doi:10.1016/S0304-3975(01)00185-2.
J. Xu, W. Zhang, A. Alawini & V. Tannen (2018):
Provenance Analysis for Missing Answers and Integrity Repairs.
IEEE Data Eng. Bull. 41(1),
pp. 39–50.
Available at http://sites.computer.org/debull/A18mar/p39.pdf.
eptcs@eptcs.org