2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.LO2023★ 1 cited
Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules
Tim S. Lyon, Piotr Ostropolski-Nalewaja
Chase algorithms are indispensable in the domain of knowledge base querying, which enable the extraction of implicit knowledge from a given database via applications of rules from…
cs.DB2021★ 2 cited
Determinacy of Real Conjunctive Queries. The Boolean Case
Jarosław Kwiecień, Jerzy Marcinkowski, Piotr Ostropolski-Nalewaja
In their classical 1993 paper [CV93] Chaudhuri and Vardi notice that some fundamental database theory results and techniques fail to survive when we try to see query answers as bag…