3 papers
cs.LO2026
Partially Finite Model Reasoning in Description Logics Extended Version
Tomasz Gogacz, Filip Murlak, Marcin Przybyłko +2
Aiming to harmonise finite and infinite model reasoning, we initiate the study of partially finite models, where the reasoning task comes with a formula that specifies a part of th…
cs.DB2024
GQL and SQL/PGQ: Theoretical Models and Expressive Power
Amélie Gheerbrant, Leonid Libkin, Liat Peterfreund +1
SQL/PGQ and GQL are very recent international standards for querying property graphs: SQL/PGQ specifies how to query relational representations of property graphs in SQL, while GQL…
cs.DB2023
Querying Incomplete Data : Complexity and Tractability via Datalog and First-Order Rewritings
Amélie Gheerbrant, Leonid Libkin, Alexandra Rogova +1
To answer database queries over incomplete data the gold standard is finding certain answers: those that are true regardless of how incomplete data is interpreted. Such answers can…