Marcin Przybylko

According to our database1, Marcin Przybylko authored at least 14 papers between 2012 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
Spectra of Cardinality Queries over Description Logic Knowledge Bases (Extended Abstract).
Proceedings of the 37th International Workshop on Description Logics (DL 2024), 2024

2023
Answer Counting under Guarded TGDs.
Log. Methods Comput. Sci., 2023

Efficient Answer Enumeration in Description Logics with Functional Roles.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Efficient Answer Enumeration in Description Logics with Functional Roles - Extended Version.
CoRR, 2022

Efficiently Enumerating Answers to Ontology-Mediated Queries.
Proceedings of the PODS '22: International Conference on Management of Data, Philadelphia, PA, USA, June 12, 2022

2021
The uniform measure of simple regular sets of infinite trees.
Inf. Comput., 2021

Enumerating Answers to Ontology-Mediated Queries: Partial Answers and Efficiency (Extended Abstract).
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020
Computing Measures of Weak-MSO Definable Sets of Trees.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

The Complexity of Answer Counting for Ontology-Mediated Queries Based on Guarded TGDs (Extended Abstract).
Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), 2020

2018
On Computing the Measures of First-Order Definable Sets of Trees.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018

2016
On the Complexity of Branching Games with Regular Conditions.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
The (Almost) Complete Guide to Tree Pattern Containment.
Proceedings of the 34th ACM Symposium on Principles of Database Systems, 2015

2014
Tree games with regular objectives.
Proceedings of the Proceedings Fifth International Symposium on Games, 2014

2012
Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012


  Loading...