dr hab. Michał Wrona, prof. UJ

The complete classification for quantified equality constraints, ACM/SIAM Symposium on Discrete Algorithms [SODA], (2023), 2746-2760

Smooth Approximations and Relational Width Collapses, International Colloquium on Automata Languages and Programming [ICALP] vol. LIPIcs 198, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021 (2021), 138:1-138:20

On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width, IEEE Symposium on Logic in Computer Science [LICS] vol. 35TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2020) (2020), 958-971

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width, International Symposium on Theoretical Aspects of Computer Science [STACS] vol. 154 (LIPIcs) (2020), 39:1-39:16

The Complexity of Minimal Inference Problem for Conservative Constraint Languages, ACM Transactions on Computational Logic vol. 20(2) (2019),

The Complexity of Minimal Inference Problem for Conservative Constraint Languages. Proceedings of the Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)., IEEE Symposium on Logic in Computer Science [LICS], (2017),

Minimal Inference Problem over Finite Domains: The Landscape of Complexity. Procedings of the International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)., International Conference on Logic Programming and Non-monotonic Reasoning [LPNMR], (2017),

The Complexity of Counting Quantifiers on Equality Languages, Theoretical Computer Science vol. 670 (2017), 56–67

The Complexity of Counting Quantifiers on Equality Languages, Lecture Notes in Computer Science vol. 9709 (2016), 333-342

Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems, Lecture Notes in Computer Science vol. 8634 (Springer) (2014), 535-546

Local-to-Global Consistency Implies Tractability of Abduction. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence., Proceedings of the Twenty-eighth Aaai Conference On Artificial Intelligence (2014), 1128-1134

Tractability of quantified temporal constraints to the max, International Journal of Algebra and Computation vol. 24 (2014), 1141-1156

The Complexity of Abduction for Equality Constraint Languages, Lipics–leibniz International Proceedings in Informatics vol. 23 (2013), 615-633

Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction, 19th International Symposium On Temporal Representation and Reasoning (2012), 99-106

Equivalence Constraint Satisfaction Problems, Lipics - Leibniz International Proceedings in Informatics (2012), 122-136

Syntactically Characterizing Local-to-Global Consistency in ORD-Horn, Lecture Notes in Computer Science vol. 7514 (2012), 704-719

Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates, Lecture Notes in Artificial Intelligence vol. 5330 (2008), 543-557

Quantified Positive Temporal Constraints, Lecture Notes in Computer Science vol. 5213 (2008), 94-108

2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices, 37th International Symposium On Multiple-valued Logic, Ismvl 2007 vol. IEEE Computer Society (2007), 21

Stratified Boolean Grammars, Lecture Notes in Computer Science vol. 3618 (Springer) (), 801-812