Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHubie Chen
Person information
- affiliation: King's College London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j41]Hubie Chen:
Algebraic Global Gadgetry for Surjective Constraint Satisfaction. Comput. Complex. 33(1): 7 (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 - [i33]Hubie Chen:
Algebraic Global Gadgetry for Surjective Constraint Satisfaction. CoRR abs/2005.11307 (2020) - [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)
2010 – 2019
- 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 - [c55]Hubie Chen:
The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems. PODS 2019: 383-398 - [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 - [c52]Hubie Chen, Mans Hulden:
The Computational Complexity of Distinctive Feature Minimization in Phonology. NAACL-HLT (2) 2018: 542-547 - [i30]Hubie Chen, Bart M. P. Jansen, Astrid Pieterse:
Best-case and Worst-case Sparsifiability of Boolean CSPs. CoRR abs/1809.06171 (2018) - 2017
- [j36]Hubie Chen:
The Tractability Frontier of Graph-Like First-Order Query Sets. J. ACM 64(4): 26:1-26:29 (2017) - [j35]Hubie Chen, Moritz Müller:
The Parameterized Space Complexity of Embedding Along a Path. Theory Comput. Syst. 61(3): 851-870 (2017) - [j34]Hubie Chen, Moritz Müller:
One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. ACM Trans. Comput. Log. 18(4): 29:1-29:37 (2017) - [j33]Hubie Chen, Benoît Larose:
Asking the Metaquestions in Constraint Tractability. ACM Trans. Comput. Theory 9(3): 11:1-11:27 (2017) - [j32]Hubie Chen:
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. ACM Trans. Comput. Theory 9(3): 15:1-15:20 (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 - [i29]Hubie Chen:
Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one. CoRR abs/1710.00234 (2017) - 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 - [c47]Hubie Chen:
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. ICALP 2016: 94:1-94:14 - [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) - [i27]Hubie Chen, Moritz Müller:
The parameterized space complexity of embedding along a path. CoRR abs/1602.09022 (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) - [j28]Hubie Chen, Moritz Müller:
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. ACM Trans. Comput. Theory 7(2): 7:1-7:27 (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 - [c43]Hubie Chen:
Parameter Compilation. IPEC 2015: 127-137 - [i24]Hubie Chen, Stefan Mengel:
The Logic of Counting Query Answers: A Study via Existential Positive Queries. CoRR abs/1501.07195 (2015) - [i23]Hubie Chen:
Parameter Compilation. CoRR abs/1503.00260 (2015) - 2014
- [j27]Hubie Chen:
Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction. Log. Methods Comput. Sci. 10(4) (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) - [j25]Hubie Chen:
On the complexity of existential positive queries. ACM Trans. Comput. Log. 15(1): 9:1-9:20 (2014) - [c42]Hubie Chen:
The tractability frontier of graph-like first-order query sets. CSL-LICS 2014: 31:1-31:9 - [c41]Hubie Chen, Moritz Müller:
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. CSL-LICS 2014: 32:1-32:10 - [c40]Simone Bova, Hubie Chen:
The Complexity of Width Minimization for Existential Positive Queries. ICDT 2014: 235-244 - [i22]Hubie Chen:
An Algebraic Hardness Criterion for Surjective Constraint Satisfaction. CoRR abs/1405.4917 (2014) - [i21]Hubie Chen:
The Tractability Frontier of Graph-Like First-Order Query Sets. CoRR abs/1407.3429 (2014) - [i20]Hubie Chen, Stefan Mengel:
A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. CoRR abs/1408.0890 (2014) - [i19]Hubie Chen:
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. CoRR abs/1410.5369 (2014) - 2013
- [j24]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic expression hardness results for primitive positive formula comparison. Inf. Comput. 222: 108-120 (2013) - [j23]Hubie Chen:
Bounded rationality, strategy simplification, and equilibrium. Int. J. Game Theory 42(3): 593-611 (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 - [c38]Hubie Chen, Moritz Müller:
The fine classification of conjunctive queries and parameterized logarithmic space complexity. PODS 2013: 309-320 - [i18]Hubie Chen, Moritz Müller:
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity. CoRR abs/1306.5424 (2013) - [i17]Hubie Chen, Moritz Müller:
One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. CoRR abs/1307.1353 (2013) - 2012
- [j21]Hubie Chen, Moritz Müller:
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. Log. Methods Comput. Sci. 9(1) (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) - [c37]Hubie Chen:
Meditations on Quantified Constraint Satisfaction. Logic and Program Semantics 2012: 35-49 - [c36]Hubie Chen, Víctor Dalmau:
Decomposing Quantified Conjunctive (or Disjunctive) Formulas. LICS 2012: 205-214 - [c35]Hubie Chen, Moritz Müller:
An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. LICS 2012: 215-224 - [c34]Hubie Chen, Michal Wrona:
Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. TIME 2012: 99-106 - [i16]Hubie Chen:
Meditations on Quantified Constraint Satisfaction. CoRR abs/1201.6306 (2012) - [i15]Simone Bova, Hubie Chen, Matthew Valeriote:
Generic Expression Hardness Results for Primitive Positive Formula Comparison. CoRR abs/1205.5745 (2012) - [i14]Hubie Chen:
On the Complexity of Existential Positive Queries. CoRR abs/1206.3902 (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) - [i12]Hubie Chen:
Bounded Rationality, Strategy Simplification, and Equilibrium. CoRR abs/1002.4577 (2010)
2000 – 2009
- 2009
- [j13]Manuel Bodirsky, Hubie Chen:
Relatively quantified constraint satisfaction. Constraints An Int. J. 14(1): 3-15 (2009) - [j12]Hubie Chen:
A rendezvous of logic, complexity, and algebra. ACM Comput. Surv. 42(1): 2:1-2:32 (2009) - [j11]Hubie Chen:
Existentially restricted quantified constraint satisfaction. Inf. Comput. 207(3): 369-388 (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
- [j7]Hubie Chen:
Inverse NP Problems. Comput. Complex. 17(1): 94-118 (2008) - [j6]Hubie Chen:
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. SIAM J. Comput. 37(5): 1674-1701 (2008) - [c31]Hubie Chen, Omer Giménez:
Causal Graphs and Structurally Restricted Planning. ICAPS 2008: 36-43 - [c30]Hubie Chen:
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. ICALP (2) 2008: 197-208 - [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
- [j4]Hubie Chen:
A rendezvous of logic, complexity, and algebra. SIGACT News 37(4): 85-114 (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 - [i8]Hubie Chen:
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. CoRR abs/cs/0607106 (2006) - [i7]Hubie Chen:
Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra. CoRR abs/cs/0611018 (2006) - 2005
- [j3]Hubie Chen:
The expressive rate of constraints. Ann. Math. Artif. Intell. 44(4): 341-352 (2005) - [j2]Hubie Chen:
Periodic Constraint Satisfaction Problems: Tractable Subclasses. Constraints An Int. J. 10(2): 97-113 (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 - [c21]Hubie Chen, Yannet Interian:
A Model for Generating Random Quantified Boolean Formulas. IJCAI 2005: 66-71 - [c20]Hubie Chen:
Parameterized Compilability. IJCAI 2005: 412-417 - [c19]Hubie Chen:
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. STACS 2005: 315-326 - [i6]Hubie Chen, Víctor Dalmau:
Beyond Hypertree Width: Decomposition Methods Without Decompositions. CoRR abs/cs/0505035 (2005) - [i5]Hubie Chen:
Existentially Restricted Quantified Constraint Satisfaction. CoRR abs/cs/0506059 (2005) - [i4]Hubie Chen:
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. Electron. Colloquium Comput. Complex. TR05 (2005) - 2004
- [j1]Hubie Chen, Riccardo Pucella:
A coalgebraic approach to Kleene algebra with tests. Theor. Comput. Sci. 327(1-2): 23-44 (2004) - [c18]Hubie Chen:
Collapsibility and Consistency in Quantified Constraint Satisfaction. AAAI 2004: 155-160 - [c17]Andrei A. Bulatov, Hubie Chen, Víctor Dalmau:
Learnability of Relatively Quantified Generalized Formulas. ALT 2004: 365-379 - [c16]Hubie Chen:
Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. CP 2004: 168-181 - [c15]Hubie Chen, Víctor Dalmau:
(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. CP 2004: 182-196 - [c14]Hubie Chen, Stephen Chong:
Owned Policies for Information Security. CSFW 2004: 126-138 - [c13]Hubie Chen:
Quantified Constraint Satisfaction and Bounded Treewidth. ECAI 2004: 161-165 - [c12]Hubie Chen:
The Expressive Rate of Constraints. AI&M 2004 - [c11]Hubie Chen, Martin Pál:
Optimization, Games, and Quantified Constraint Satisfaction. MFCS 2004: 239-250 - [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 - [i3]Hubie Chen, Riccardo Pucella:
A Coalgebraic Approach to Kleene Algebra with Tests. CoRR cs.LO/0405097 (2004) - 2003
- [c8]Hubie Chen:
Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. CP 2003: 199-213 - [c7]Hubie Chen:
Inverse Circumscription. IJCAI 2003: 449-454 - [c6]Hubie Chen:
A Theory of Average-Case Compilability in Knowledge Representation. IJCAI 2003: 455-460 - [c5]Hubie Chen:
Arithmetic Constant-Depth Circuit Complexity Classes. MFCS 2003: 328-337 - [c4]Hubie Chen:
Inverse NP Problems. MFCS 2003: 338-347 - [c3]Hubie Chen:
An Algorithm for SAT Above the Threshold.