Publikacje

• Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough - 2024
  SIAM Journal on Computing 53 (2024), 1709-1745 Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona
• Identifying Tractable Quantified Temporal Constraints Within Ord-Horn - 2024 International Colloquium on Automata Languages and Programming [ICALP] 297 (2024), 20 Jakub Rydval, Zaneta Semanisinova, Michał Wrona
• The complete classification for quantified equality constraints - 2023 ACM/SIAM Symposium on Discrete Algorithms [SODA], (2023), 2746-2760 Dmitriy Zhuk, Barnaby Martin, Michał Wrona
• Smooth Approximations and Relational Width Collapses - 2021 International Colloquium on Automata Languages and Programming [ICALP] LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 (2021), 138:1-138:20 Antoine Mottet, Tomáš Nagy, Michael Pinsker, Michał Wrona
• On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width - 2020 IEEE Symposium on Logic in Computer Science [LICS] 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) (2020), 958-971 Michał Wrona
• Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width - 2020 International Symposium on Theoretical Aspects of Computer Science [STACS] 154 (LIPIcs) (2020), 39:1-39:16 Michał Wrona
• The Complexity of Minimal Inference Problem for Conservative Constraint Languages - 2019
  ACM Transactions on Computational Logic 20(2) (2019), Michał Wrona
• The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). - 2017
  Proceedings of the Annual Acm/ieee Symposium On Logic in Computer Science (lics) IEEE Symposium on Logic in Computer Science [LICS], (2017), Michał Wrona
• Minimal Inference Problem over Finite Domains: The Landscape of Complexity. Procedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). - 2017
  Procedings of the International Conference On Logic Programming and Nonmonotonic Reasoning (lpnmr) International Conference on Logic Programming and Non-monotonic Reasoning [LPNMR], (2017), Michał Wrona
• The Complexity of Counting Quantifiers on Equality Languages - 2017
  Theoretical Computer Science 670 (2017), 56–67 Barnaby Martin, Andras Pongracz, Michał Wrona
• The Complexity of Counting Quantifiers on Equality Languages - 2016
  Lecture Notes in Computer Science 9709 (2016), 333-342 Barnaby Martin, Andras Pongracz, Michał Wrona
• Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems - 2014
  Lecture Notes in Computer Science 8634 (Springer) (2014), 535-546 Michał Wrona
• Local-to-Global Consistency Implies Tractability of Abduction. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. - 2014
  Proceedings of the Twenty-eighth Aaai Conference On Artificial Intelligence (2014), 1128-1134 Michał Wrona
• Tractability of quantified temporal constraints to the max - 2014
  International Journal of Algebra and Computation 24 (2014), 1141-1156 Manuel Bodirsky, Hubie Chen, Michał Wrona
• The Complexity of Abduction for Equality Constraint Languages - 2013
  Lipics–leibniz International Proceedings in Informatics 23 (2013), 615-633 Johannes Schmidt, Michał Wrona
• Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction - 2012
  19th International Symposium On Temporal Representation and Reasoning (2012), 99-106 Hubie Chen, Michał Wrona
• Equivalence Constraint Satisfaction Problems - 2012
  Lipics - Leibniz International Proceedings in Informatics (2012), 122-136 Manuel Bodirsky, Michał Wrona
• Syntactically Characterizing Local-to-Global Consistency in ORD-Horn - 2012
  Lecture Notes in Computer Science 7514 (2012), 704-719 Michał Wrona
• Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates - 2008
  Lecture Notes in Artificial Intelligence 5330 (2008), 543-557 Witold Charatonik, Michał Wrona
• Quantified Positive Temporal Constraints - 2008
  Lecture Notes in Computer Science 5213 (2008), 94-108 Witold Charatonik, Michał Wrona
• 2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices - 2007
  37th International Symposium On Multiple-valued Logic, Ismvl 2007 IEEE Computer Society (2007), 21 Witold Charatonik, Michał Wrona
• Stratified Boolean Grammars -
  Lecture Notes in Computer Science 3618 (Springer) (), 801-812 Michał Wrona