19 citations · 43 across the 11 of their papers we have counts for
14 papers
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…
On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles
Thomas Gogacz, Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García +2
We study the description logic SQ with number restrictions applicable to transitive roles, extended with either nominals or inverse roles. We show tight 2EXPTIME upper bounds for u…
On Finite Entailment of Non-Local Queries in Description Logics
Tomasz Gogacz, Víctor Gutiérrez-Basulto, Albert Gutowski +2
We study the problem of finite entailment of ontology-mediated queries. Going beyond local queries, we allow transitive closure over roles. We focus on ontologies formulated in the…
Ontology Focusing: Knowledge-enriched Databases on Demand
Tomasz Gogacz, Víctor Gutiérrez-Basulto, Yazmín A. Ibáñez-García +3
We propose a novel framework to facilitate the on-demand design of data-centric systems by exploiting domain knowledge from an existing ontology. Its key ingredient is a process th…
All-Instances Restricted Chase Termination
Tomasz Gogacz, Jerzy Marcinkowski, Andreas Pieris
The chase procedure is a fundamental algorithmic tool in database theory with a variety of applications. A key problem concerning the chase procedure is all-instances termination:…
Finite Query Answering in Expressive Description Logics with Transitive Roles
Tomasz Gogacz, Yazmin Ibáñez-García, Filip Murlak
We study the problem of finite ontology mediated query answering (FOMQA), the variant of OMQA where the represented world is assumed to be finite, and thus only finite models of th…
Entropy bounds for conjunctive queries with functional dependencies
Tomasz Gogacz, Szymon Toruńczyk
We study the problem of finding the worst-case bound for the size of the result of a fixed conjunctive query applied to a database satisfying giv…
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable
Tomasz Gogacz, Jerzy Marcinkowski
We solve a well known and long-standing open problem in database theory, proving that Conjunctive Query Finite Determinacy Problem is undecidable. The technique we use builds on th…
Non-dominating sequences of vectors using only resets and increments
Wojciech Czerwinski, Tomasz Gogacz, Eryk Kopczynski
We consider a variant of Dickson lemma, where each entry of a vector can be reseted or incremented by 1 in respect to the previous one. We give an example of non dominating sequenc…
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
Tomasz Gogacz, Jerzy Marcinkowski
We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecida…
On the BDD/FC Conjecture
Tomasz Gogacz, Jerzy Marcinkowski
Bounded Derivation Depth property (BDD) and Finite Controllability (FC) are two properties of sets of datalog rules and tuple generating dependencies (known as Datalog +/- programs…
Termination of oblivious chase is undecidable
Tomasz Gogacz, Jerzy Marcinkowski
We show that all--instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set consisting of Tuple Generating Dependencie…
On regular groups and fields
Tomasz Gogacz, Krzysztof Krupinski
Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically close…
Converging to the Chase - a Tool for Finite Controllability
T. Gogacz, J. Marcinkowski
We solve a problem, stated in [CGP10], showing that Sticky Datalog, defined in the cited paper as an element of the Datalog\pm project, has the finite controllability property. In…