Tomasz Gogacz

According to our database1, Tomasz Gogacz authored at least 23 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Evaluating Graph Queries Using Semantic Treewidth.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Uniform Restricted Chase Termination.
SIAM J. Comput., June, 2023

Exploiting Semantic Treewidth for Graph Queries Evaluation (short paper).
Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), 2023

2020
All-Instances Restricted Chase Termination for Linear TGDs.
Künstliche Intell., 2020

All-Instances Restricted Chase Termination.
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2020

Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

On Finite Entailment of Non-Local Queries in Description Logics.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

Ontology Focusing: Knowledge-Enriched Databases on Demand.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019
All-Instances Restricted Chase Termination: The Guarded Case.
CoRR, 2019

On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Finite Query Answering in Expressive Description Logics with Transitive Roles.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

2017
Converging to the chase - A tool for finite controllability.
J. Comput. Syst. Sci., 2017

Measure properties of regular sets of trees.
Inf. Comput., 2017

Entropy Bounds for Conjunctive Queries with Functional Dependencies.
Proceedings of the 20th International Conference on Database Theory, 2017

2016
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

2015
Non-dominating Sequences of Vectors Using only Resets and Increments.
Fundam. Informaticae, 2015

The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

2014
On Regular Groups and Fields.
J. Symb. Log., 2014

Termination of oblivious chase is undecidable.
CoRR, 2014

Measure Properties of Game Tree Languages.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

All-Instances Termination of Chase is Undecidable.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Decidability of MSO+U on Infinite Trees.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
On the BDD/FC conjecture.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013


  Loading...