default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Wrona
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]Jakub Rydval, Zaneta Semanisinová
, Michal Wrona:
Identifying Tractable Quantified Temporal Constraints Within Ord-Horn. ICALP 2024: 151:1-151:20- [i8]Jakub Rydval, Zaneta Semanisinová, Michal Wrona:
Identifying Tractable Quantified Temporal Constraints within Ord-Horn. CoRR abs/2402.09187 (2024) - [i7]Michal Wrona:
Quasi Directed Jonsson Operations Imply Bounded Width (For fo-expansions of symmetric binary cores with free amalgamation). CoRR abs/2402.16540 (2024) - [i6]Manuel Bodirsky, Marcin Kozik, Florent R. Madelaine, Barnaby Martin, Michal Wrona:
Model-checking positive equality free logic on a fixed structure (direttissima). CoRR abs/2408.13840 (2024) - 2023
- [c17]Dmitriy Zhuk, Barnaby Martin, Michal Wrona:
The complete classification for quantified equality constraints. SODA 2023: 2746-2760 - 2021
- [c16]Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona:
Smooth Approximations and Relational Width Collapses. ICALP 2021: 138:1-138:20 - [i5]Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona:
Smooth Approximations and Relational Width Collapses. CoRR abs/2102.07531 (2021) - [i4]Manuel Bodirsky, Hubie Chen, Michal Wrona:
Tractability of Quantified Temporal Constraints To The Max. CoRR abs/2104.11442 (2021) - [i3]Michal Wrona:
Tractability Frontier for Dually-Closed Temporal Quantified Constraint Satisfaction Problems. CoRR abs/2109.02721 (2021) - 2020
- [c15]Michal Wrona:
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width. LICS 2020: 958-971 - [c14]Michal Wrona:
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. STACS 2020: 39:1-39:16 - [i2]Michal Wrona:
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width. CoRR abs/2001.06676 (2020) - [i1]Michal Wrona:
On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width. CoRR abs/2005.04145 (2020)
2010 – 2019
- 2019
- [j3]Michal Wrona:
The Complexity of Minimal Inference Problem for Conservative Constraint Languages. ACM Trans. Comput. Log. 20(2): 8:1-8:35 (2019) - 2017
- [j2]Barnaby Martin, András Pongrácz, Michal Wrona:
The complexity of counting quantifiers on equality languages. Theor. Comput. Sci. 670: 56-67 (2017) - [c13]Michal Wrona:
The complexity of minimal inference problem for conservative constraint languages. LICS 2017: 1-12 - [c12]Michal Wrona:
Minimal Inference Problem Over Finite Domains: The Landscape of Complexity. LPNMR 2017: 101-113 - 2016
- [c11]Barnaby Martin, András Pongrácz, Michal Wrona:
The Complexity of Counting Quantifiers on Equality Languages. CiE 2016: 333-342 - 2014
- [j1]Manuel Bodirsky, Hubie Chen, Michal Wrona:
Tractability of quantified temporal constraints to the max. Int. J. Algebra Comput. 24(8): 1141-1156 (2014) - [c10]Michal Wrona:
Local-to-Global Consistency Implies Tractability of Abduction. AAAI 2014: 1128-1134 - [c9]Michal Wrona:
Tractability Frontier for Dually-Closed Ord-Horn Quantified Constraint Satisfaction Problems. MFCS (1) 2014: 535-546 - 2013
- [c8]Johannes Schmidt, Michal Wrona:
The Complexity of Abduction for Equality Constraint Languages. CSL 2013: 615-633 - 2012
- [c7]Michal Wrona:
Syntactically Characterizing Local-to-Global Consistency in ORD-Horn. CP 2012: 704-719 - [c6]Manuel Bodirsky, Michal Wrona:
Equivalence Constraint Satisfaction Problems. CSL 2012: 122-136 - [c5]Hubie Chen, Michal Wrona:
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. TIME 2012: 99-106
2000 – 2009
- 2008
- [c4]Witold Charatonik, Michal Wrona:
Quantified Positive Temporal Constraints. CSL 2008: 94-108 - [c3]Witold Charatonik, Michal Wrona:
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates. LPAR 2008: 543-557 - 2007
- [c2]Witold Charatonik, Michal Wrona:
2-SAT Problems in Some Multi-Valued Logics Based on Finite Lattices. ISMVL 2007: 21 - 2005
- [c1]Michal Wrona:
Stratified Boolean Grammars. MFCS 2005: 801-812
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-04 03:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
