Marcin Przybylko

22 papers A* 5A 1B 2Journal 9Unranked 5
YearRankTypeTitle / Venue / Authors
2026 J jnl
Let's Play Tag: Linear Time Evaluation of Conjunctive Queries under TGD Constraints.
CoRR
Nofar Carmeli, Carsten Lutz, Marcin Przybylko
2025 A* conf
Spectra of Cardinality Queries over Description Logic Knowledge Bases.
AAAI
Quentin Manière, Marcin Przybylko
2024 J jnl
Computing measures of weak-MSO definable sets of trees.
CoRR
Damian Niwinski, Marcin Przybylko, Michal Skrzypczak
2024 — conf
Spectra of Cardinality Queries over Description Logic Knowledge Bases (Extended Abstract).
Description Logics
Quentin Manière, Marcin Przybylko
2024 J jnl
Spectra of Cardinality Queries over Description Logic Knowledge Bases.
CoRR
Quentin Manière, Marcin Przybylko
2023 J jnl
Answer Counting under Guarded TGDs.
Log. Methods Comput. Sci.
Cristina Feier, Carsten Lutz, Marcin Przybylko
2023 A* conf
Efficient Answer Enumeration in Description Logics with Functional Roles.
AAAI
Carsten Lutz, Marcin Przybylko
2022 J jnl
Efficient Answer Enumeration in Description Logics with Functional Roles - Extended Version.
CoRR
Carsten Lutz, Marcin Przybylko
2022 A* conf
Efficiently Enumerating Answers to Ontology-Mediated Queries.
PODS
Carsten Lutz, Marcin Przybylko
2022 J jnl
Efficiently Enumerating Answers to Ontology-Mediated Queries.
CoRR
Carsten Lutz, Marcin Przybylko
2021 A conf
Answer Counting Under Guarded TGDs.
ICDT
Cristina Feier, Carsten Lutz, Marcin Przybylko
2021 J jnl
Answer Counting under Guarded TGDs.
CoRR
Cristina Feier, Carsten Lutz, Marcin Przybylko
2021 — conf
Enumerating Answers to Ontology-Mediated Queries: Partial Answers and Efficiency (Extended Abstract).
Description Logics
Carsten Lutz, Marcin Przybylko
2021 J jnl
The uniform measure of simple regular sets of infinite trees.
Inf. Comput.
Marcin Przybylko, Michal Skrzypczak
2020 A* conf
Computing Measures of Weak-MSO Definable Sets of Trees.
ICALP
Damian Niwinski, Marcin Przybylko, Michal Skrzypczak
2020 — conf
The Complexity of Answer Counting for Ontology-Mediated Queries Based on Guarded TGDs (Extended Abstract).
Description Logics
Cristina Feier, Carsten Lutz, Marcin Przybylko
2020 J jnl
The Uniform Measure of Simple Regular Sets of Infinite Trees.
CoRR
Marcin Przybylko, Michal Skrzypczak
2018 — conf
On Computing the Measures of First-Order Definable Sets of Trees.
GandALF
Marcin Przybylko
2016 B conf
On the Complexity of Branching Games with Regular Conditions.
MFCS
Marcin Przybylko, Michal Skrzypczak
2015 A* conf
The (Almost) Complete Guide to Tree Pattern Containment.
PODS
Wojciech Czerwinski, Wim Martens, Pawel Parys, Marcin Przybylko
2014 — conf
Tree games with regular objectives.
GandALF
Marcin Przybylko
2012 B conf
Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity?
MFCS
Filip Murlak, Michal Oginski, Marcin Przybylko