Остановите войну!
for scientists:
default search action
Hubie Chen
- > Home > Persons > Hubie Chen
Publications
- 2024
- [c60]Hubie Chen, Stefan Mengel:
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. ICDT 2024: 16:1-16:17 - 2023
- [i35]Hubie Chen, Gianluigi Greco, Stefan Mengel, Francesco Scarcello:
Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. CoRR abs/2311.14579 (2023) - 2021
- [i34]Manuel Bodirsky, Hubie Chen, Michal Wrona:
Tractability of Quantified Temporal Constraints To The Max. CoRR abs/2104.11442 (2021) - 2020
- [j40]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. Algorithmica 82(8): 2200-2242 (2020) - [c59]Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. IJCAI 2020: 1726-1733 - [c58]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. ISAAC 2020: 58:1-58:17 - [i32]Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler:
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. CoRR abs/2007.14169 (2020) - [i31]Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski:
Sparsification Lower Bounds for List H-Coloring. CoRR abs/2009.08353 (2020) - 2019
- [j39]Hubie Chen, Matthew Valeriote:
Learnability of Solutions to Conjunctive Queries. J. Mach. Learn. Res. 20: 67:1-67:28 (2019) - [j38]Simone Bova, Hubie Chen:
How Many Variables are Needed to Express an Existential Positive Query? Theory Comput. Syst. 63(7): 1573-1594 (2019) - [j37]Hubie Chen, Matt Valeriote, Yuichi Yoshida:
Constant-Query Testability of Assignments to Constraint Satisfaction Problems. SIAM J. Comput. 48(3): 1022-1045 (2019) - [c57]Christoph Berkholz, Hubie Chen:
Compiling Existential Positive Queries to Bounded-Variable Fragments. PODS 2019: 353-364 - [c56]Hubie Chen, Yuichi Yoshida:
Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. PODS 2019: 365-382 - [c54]Hubie Chen, Radu Curticapean, Holger Dell:
The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. WG 2019: 364-378 - 2018
- [c53]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-Case and Worst-Case Sparsifiability of Boolean CSPs. IPEC 2018: 15:1-15:13 - [i30]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR abs/1809.06171 (2018) - 2017
- [j33]Hubie Chen, Benoît Larose:
Asking the Metaquestions in Constraint Tractability. ACM Trans. Comput. Theory 9(3): 11:1-11:27 (2017) - [c51]Simone Bova, Hubie Chen:
How Many Variables Are Needed to Express an Existential Positive Query?. ICDT 2017: 9:1-9:16 - [c50]Hubie Chen, Stefan Mengel:
The logic of counting query answers. LICS 2017: 1-12 - 2016
- [j31]Hubie Chen, Víctor Dalmau:
Decomposing Quantified Conjunctive (or Disjunctive) Formulas. SIAM J. Comput. 45(6): 2066-2086 (2016) - [c49]Hubie Chen, Peter Mayr:
Quantified Constraint Satisfaction on Monoids. CSL 2016: 15:1-15:14 - [c48]Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
Testing Assignments to Constraint Satisfaction Problems. FOCS 2016: 525-534 - [c46]Hubie Chen, Stefan Mengel:
Counting Answers to Existential Positive Queries: A Complexity Classification. PODS 2016: 315-326 - [i28]Hubie Chen, Stefan Mengel:
Counting Answers to Existential Positive Queries: A Complexity Classification. CoRR abs/1601.03240 (2016) - [i26]Hubie Chen, Benoît Larose:
Asking the metaquestions in constraint tractability. CoRR abs/1604.00932 (2016) - [i25]Hubie Chen, Matthew Valeriote, Yuichi Yoshida:
Testing Assignments to Constraint Satisfaction Problems. CoRR abs/1608.03017 (2016) - 2015
- [j30]Hubie Chen, Florent R. Madelaine, Barnaby Martin:
Quantified Constraints and Containment Problems. Log. Methods Comput. Sci. 11(3) (2015) - [j29]Simone Bova, Hubie Chen:
The complexity of equivalence, entailment, and minimization in existential positive logic. J. Comput. Syst. Sci. 81(2): 443-457 (2015) - [c45]Hubie Chen, Matthew Valeriote:
Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. COLT 2015: 326-337 - [c44]Hubie Chen, Stefan Mengel:
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. ICDT 2015: 110-126 - [i24]Hubie Chen, Stefan Mengel:
The Logic of Counting Query Answers: A Study via Existential Positive Queries. CoRR abs/1501.07195 (2015) - 2014
- [j26]Manuel Bodirsky, Hubie Chen, Michal Wrona:
Tractability of quantified temporal constraints to the max. Int. J. Algebra Comput. 24(8): 1141-1156 (2014) - [c40]Simone Bova, Hubie Chen:
The Complexity of Width Minimization for Existential Positive Queries. ICDT 2014: 235-244 - [i20]Hubie Chen, Stefan Mengel:
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. CoRR abs/1408.0890 (2014) - 2013
- [j24]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic expression hardness results for primitive positive formula comparison. Inf. Comput. 222: 108-120 (2013) - [j22]Hubie Chen, Víctor Dalmau, Berit Grußien:
Arc consistency and friends. J. Log. Comput. 23(1): 87-108 (2013) - [c39]Hubie Chen, Dániel Marx:
Block-Sorted Quantified Conjunctive Queries. ICALP (2) 2013: 125-136 - 2012
- [j20]Simone Bova, Hubie Chen, Matthew Valeriote:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. Theory Comput. Syst. 50(2): 329-353 (2012) - [j19]Manuel Bodirsky, Hubie Chen, Tomás Feder:
On the Complexity of MMSNP. SIAM J. Discret. Math. 26(1): 404-414 (2012) - [c36]Hubie Chen, Víctor Dalmau:
Decomposing Quantified Conjunctive (or Disjunctive) Formulas. LICS 2012: 205-214 - [c34]Hubie Chen, Michal Wrona:
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. TIME 2012: 99-106 - [i15]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. CoRR abs/1205.5745 (2012) - 2011
- [c33]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. ICALP (2) 2011: 344-355 - [i13]Hubie Chen, Víctor Dalmau, Berit Grußien:
Arc Consistency and Friends. CoRR abs/1104.4993 (2011) - 2010
- [j18]Hubie Chen, Omer Giménez:
Causal graphs and structurally restricted planning. J. Comput. Syst. Sci. 76(7): 579-592 (2010) - [j17]Hubie Chen, Martin Grohe:
Constraint satisfaction with succinctly specified relations. J. Comput. Syst. Sci. 76(8): 847-860 (2010) - [j16]Manuel Bodirsky, Hubie Chen, Michael Pinsker:
The reducts of equality up to primitive positive interdefinability. J. Symb. Log. 75(4): 1249-1292 (2010) - [j15]Manuel Bodirsky, Hubie Chen:
Quantified Equality Constraints. SIAM J. Comput. 39(8): 3682-3699 (2010) - [j14]Manuel Bodirsky, Hubie Chen:
Peek arc consistency. Theor. Comput. Sci. 411(2): 445-453 (2010) - 2009
- [j13]Manuel Bodirsky, Hubie Chen:
Relatively quantified constraint satisfaction. Constraints An Int. J. 14(1): 3-15 (2009) - [j10]Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin:
The complexity of constraint satisfaction games and QCSP. Inf. Comput. 207(9): 923-944 (2009) - [j9]Manuel Bodirsky, Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited. J. Log. Comput. 19(6): 1359-1383 (2009) - [j8]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal infinite-valued constraint languages. Theor. Comput. Sci. 410(18): 1684-1693 (2009) - [c32]Hubie Chen, Omer Giménez:
On-the-Fly Macros. WoLLIC 2009: 155-169 - [i11]Matthew Valeriote, Simone Bova, Hubie Chen:
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. The Constraint Satisfaction Problem: Complexity and Approximability 2009 - 2008
- [c31]Hubie Chen, Omer Giménez:
Causal Graphs and Structurally Restricted Planning. ICAPS 2008: 36-43 - [c29]Hubie Chen, Florent R. Madelaine, Barnaby Martin:
Quantified Constraints and Containment Problems. LICS 2008: 317-328 - [i10]Manuel Bodirsky, Hubie Chen:
Peek Arc Consistency. CoRR abs/0809.0788 (2008) - 2007
- [j5]Andrei A. Bulatov, Hubie Chen, Víctor Dalmau:
Learning intersection-closed classes with signatures. Theor. Comput. Sci. 382(3): 209-220 (2007) - [c28]Hubie Chen, Omer Giménez:
Act Local, Think Global: Width Notions for Tractable Planning. ICAPS 2007: 73-80 - [c27]Manuel Bodirsky, Hubie Chen:
Qualitative Temporal and Spatial Reasoning Revisited. CSL 2007: 194-207 - [c26]Manuel Bodirsky, Hubie Chen, Jan Kára, Timo von Oertzen:
Maximal Infinite-Valued Constraint Languages. ICALP 2007: 546-557 - [c25]Manuel Bodirsky, Hubie Chen:
Quantified Equality Constraints. LICS 2007: 203-212 - 2006
- [c24]Manuel Bodirsky, Hubie Chen:
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. CSL 2006: 197-211 - [i9]Hubie Chen, Martin Grohe:
Constraint Satisfaction with Succinctly Specified Relations. Complexity of Constraints 2006 - 2005
- [c23]Hubie Chen, Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions. CP 2005: 167-181 - [c22]Hubie Chen, Víctor Dalmau:
From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. CSL 2005: 232-247 - [i6]Hubie Chen, Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions. CoRR abs/cs/0505035 (2005) - 2004
- [c17]Andrei A. Bulatov, Hubie Chen, Víctor Dalmau:
Learnability of Relatively Quantified Generalized Formulas. ALT 2004: 365-379 - [c15]Hubie Chen, Víctor Dalmau:
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. CP 2004: 182-196 - [c10]Hubie Chen, Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas. SAT 2004 - [c9]Hubie Chen, Víctor Dalmau:
Looking Algebraically at Tractable Quantified Boolean Formulas. SAT (Selected Papers 2004: 71-79
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 2024-03-16 22:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint