Michal Wrona

According to our database, Michal Wrona authored at least 22 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Model-checking positive equality free logic on a fixed structure (direttissima).

Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona

CoRR, 2024

Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation).

Michal Wrona

CoRR, 2024

Identifying Tractable Quantified Temporal Constraints Within Ord-Horn.

Jakub Rydval, Zaneta Semanisinová, Michal Wrona

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023

The complete classification for quantified equality constraints.

Dmitriy Zhuk, Barnaby Martin, Michal Wrona

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2021

Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems.

Michal Wrona

CoRR, 2021

Smooth Approximations and Relational Width Collapses.

Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width.

Michal Wrona

Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width.

Michal Wrona

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

2019

The Complexity of Minimal Inference Problem for Conservative Constraint Languages.

Michal Wrona

ACM Trans. Comput. Log., 2019

2017

The complexity of counting quantifiers on equality languages.

Barnaby Martin, András Pongrácz, Michal Wrona

Theor. Comput. Sci., 2017

Minimal Inference Problem Over Finite Domains: The Landscape of Complexity.

Michal Wrona

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

2014

Tractability of quantified temporal constraints to the max.

Manuel Bodirsky, Hubie Chen, Michal Wrona

Int. J. Algebra Comput., 2014

Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems.

Michal Wrona

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Local-to-Global Consistency Implies Tractability of Abduction.

Michal Wrona

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

The Complexity of Abduction for Equality Constraint Languages.

Johannes Schmidt, Michal Wrona

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction.

Hubie Chen, Michal Wrona

Proceedings of the 19th International Symposium on Temporal Representation and Reasoning, 2012

Equivalence Constraint Satisfaction Problems.

Manuel Bodirsky, Michal Wrona

Proceedings of the Computer Science Logic (CSL'12), 2012

Syntactically Characterizing Local-to-Global Consistency in ORD-Horn.

Michal Wrona

Proceedings of the Principles and Practice of Constraint Programming, 2012

2008

Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates.

Witold Charatonik, Michal Wrona

Proceedings of the Logic for Programming, 2008

Quantified Positive Temporal Constraints.

Witold Charatonik, Michal Wrona

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices.

Witold Charatonik, Michal Wrona

Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

2005

Stratified Boolean Grammars.

Michal Wrona

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005