Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity.

Hubie Chen Hubert Ming Chen King's College London, Department of Informatics, UK Birkbeck University of London, UK University of the Basque Country (UPV/EHU), San Sebastián, Spain Pompeu Fabra University, Department of Technology, Barcelona, Spain Cornell University, Department of Computer Science, Ithaca, NY, USA https://hubie-chen.github.io/ http://hubiechen.weebly.com/ https://www.cs.cornell.edu/hubes/ https://www.kcl.ac.uk/people/hubie-chen https://dl.acm.org/profile/81100114349 https://mathgenealogy.org/id.php?id=159980 https://www.wikidata.org/entity/Q102392627

Hubie Chen Stefan Mengel Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. 2026 22 Log. Methods Comput. Sci. 2 https://doi.org/10.46298/lmcs-22(2:6)2026 db/journals/lmcs/lmcs22.html#ChenM26 streams/journals/lmcs

Mahmoud Abo Khamis Hubie Chen Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time. 2026 March abs/2603.13624 CoRR https://doi.org/10.48550/arXiv.2603.13624 db/journals/corr/corr2603.html#abs-2603-13624 streams/journals/corr

Hubie Chen Algebraic Global Gadgetry for Surjective Constraint Satisfaction. 7 2024 June 33 Comput. Complex. 1 https://doi.org/10.1007/s00037-024-00253-4 db/journals/cc/cc33.html#Chen24

Hubie Chen Stefan Mengel Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. 16:1-16:17 2024 ICDT https://doi.org/10.4230/LIPIcs.ICDT.2024.16 conf/icdt/2024 db/conf/icdt/icdt2024.html#ChenM24

Hubie Chen Stefan Mengel Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. 2024 abs/2411.10229 CoRR https://doi.org/10.48550/arXiv.2411.10229 db/journals/corr/corr2411.html#abs-2411-10229 streams/journals/corr

Hubie Chen Markus Schneider Intermediate Relation Size Bounds for Select-Project-Join Query Plans: Asymptotically Tight Characterizations. 2024 abs/2412.13104 CoRR https://doi.org/10.48550/arXiv.2412.13104 db/journals/corr/corr2412.html#abs-2412-13104 streams/journals/corr

Hubie Chen Bart M. P. Jansen Karolina Okrasa Astrid Pieterse Pawel Rzazewski Sparsification Lower Bounds for List <i>H</i>-Coloring. 8:1-8:23 2023 15 ACM Trans. Comput. Theory 3-4 https://doi.org/10.1145/3612938 https://www.wikidata.org/entity/Q130949675 db/journals/toct/toct15.html#ChenJOPR23

Hubie Chen Gianluigi Greco Stefan Mengel Francesco Scarcello Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. 2023 abs/2311.14579 CoRR https://doi.org/10.48550/arXiv.2311.14579 db/journals/corr/corr2311.html#abs-2311-14579

Manuel Bodirsky Hubie Chen Michal Wrona Tractability of Quantified Temporal Constraints To The Max. 2021 abs/2104.11442 CoRR https://arxiv.org/abs/2104.11442 db/journals/corr/corr2104.html#abs-2104-11442

Hubie Chen Bart M. P. Jansen Astrid Pieterse Best-Case and Worst-Case Sparsifiability of Boolean CSPs. 2200-2242 2020 82 Algorithmica 8 https://doi.org/10.1007/s00453-019-00660-y db/journals/algorithmica/algorithmica82.html#ChenJP20

Hubie Chen Georg Gottlob Matthias Lanzinger Reinhard Pichler Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. 1726-1733 2020 IJCAI https://doi.org/10.24963/ijcai.2020/239 conf/ijcai/2020 db/conf/ijcai/ijcai2020.html#ChenGLP20 Hubie Chen Bart M. P. Jansen Karolina Okrasa Astrid Pieterse Pawel Rzazewski Sparsification Lower Bounds for List H-Coloring. 58:1-58:17 2020 ISAAC https://doi.org/10.4230/LIPIcs.ISAAC.2020.58 conf/isaac/2020 db/conf/isaac/isaac2020.html#ChenJOPR20

Hubie Chen Algebraic Global Gadgetry for Surjective Constraint Satisfaction. 2020 abs/2005.11307 CoRR https://arxiv.org/abs/2005.11307 db/journals/corr/corr2005.html#abs-2005-11307

Hubie Chen Georg Gottlob Matthias Lanzinger Reinhard Pichler Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. 2020 abs/2007.14169 CoRR https://arxiv.org/abs/2007.14169 db/journals/corr/corr2007.html#abs-2007-14169

Hubie Chen Bart M. P. Jansen Karolina Okrasa Astrid Pieterse Pawel Rzazewski Sparsification Lower Bounds for List H-Coloring. 2020 abs/2009.08353 CoRR https://arxiv.org/abs/2009.08353 db/journals/corr/corr2009.html#abs-2009-08353

Hubie Chen Matthew Valeriote Learnability of Solutions to Conjunctive Queries. 67:1-67:28 2019 20 J. Mach. Learn. Res. https://jmlr.org/papers/v20/17-734.html db/journals/jmlr/jmlr20.html#ChenV19

Simone Bova Hubie Chen How Many Variables are Needed to Express an Existential Positive Query? 1573-1594 2019 63 Theory Comput. Syst. 7 https://doi.org/10.1007/s00224-018-9884-z db/journals/mst/mst63.html#BovaC19

Hubie Chen Matt Valeriote Yuichi Yoshida Constant-Query Testability of Assignments to Constraint Satisfaction Problems. 1022-1045 2019 48 SIAM J. Comput. 3 https://doi.org/10.1137/18M121085X https://www.wikidata.org/entity/Q127870181 db/journals/siamcomp/siamcomp48.html#ChenVY19

Christoph Berkholz Hubie Chen Compiling Existential Positive Queries to Bounded-Variable Fragments. 353-364 2019 PODS https://doi.org/10.1145/3294052.3319693 https://www.wikidata.org/entity/Q130879611 conf/pods/2019 db/conf/pods/pods2019.html#BerkholzC19 Hubie Chen Yuichi Yoshida Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. 365-382 2019 PODS https://doi.org/10.1145/3294052.3319679 https://www.wikidata.org/entity/Q130865634 conf/pods/2019 db/conf/pods/pods2019.html#ChenY19 Hubie Chen The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems. 383-398 2019 PODS https://doi.org/10.1145/3294052.3319682 conf/pods/2019 db/conf/pods/pods2019.html#Chen19 Hubie Chen Radu Curticapean Holger Dell The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. 364-378 2019 WG https://doi.org/10.1007/978-3-030-30786-8_28 conf/wg/2019 db/conf/wg/wg2019.html#ChenCD19 Hubie Chen Bart M. P. Jansen Astrid Pieterse Best-Case and Worst-Case Sparsifiability of Boolean CSPs. 15:1-15:13 2018 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2018.15 conf/iwpec/2018 db/conf/iwpec/ipec2018.html#ChenJP18 Hubie Chen Mans Hulden The Computational Complexity of Distinctive Feature Minimization in Phonology. 542-547 2018 NAACL-HLT (2) https://doi.org/10.18653/v1/n18-2086 https://aclanthology.org/N18-2086/ conf/naacl/2018-2 db/conf/naacl/naacl2018-2.html#ChenH18

Hubie Chen Bart M. P. Jansen Astrid Pieterse Best-case and Worst-case Sparsifiability of Boolean CSPs. 2018 abs/1809.06171 CoRR http://arxiv.org/abs/1809.06171 db/journals/corr/corr1809.html#abs-1809-06171

Hubie Chen The Tractability Frontier of Graph-Like First-Order Query Sets. 26:1-26:29 2017 64 J. ACM 4 https://doi.org/10.1145/3073409 db/journals/jacm/jacm64.html#Chen17

Hubie Chen Moritz Müller The Parameterized Space Complexity of Embedding Along a Path. 851-870 2017 61 Theory Comput. Syst. 3 https://doi.org/10.1007/s00224-016-9728-7 db/journals/mst/mst61.html#ChenM17

Hubie Chen Moritz Müller One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. 29:1-29:37 2017 18 ACM Trans. Comput. Log. 4 https://doi.org/10.1145/3143805 db/journals/tocl/tocl18.html#ChenM17

Hubie Chen Benoît Larose Asking the Metaquestions in Constraint Tractability. 11:1-11:27 2017 9 ACM Trans. Comput. Theory 3 https://doi.org/10.1145/3134757 https://www.wikidata.org/entity/Q130994134 db/journals/toct/toct9.html#ChenL17

Hubie Chen Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. 15:1-15:20 2017 9 ACM Trans. Comput. Theory 3 https://doi.org/10.1145/3087534 db/journals/toct/toct9.html#Chen17

Simone Bova Hubie Chen How Many Variables Are Needed to Express an Existential Positive Query?. 9:1-9:16 2017 ICDT https://doi.org/10.4230/LIPIcs.ICDT.2017.9 conf/icdt/2017 db/conf/icdt/icdt2017.html#BovaC17 Hubie Chen Stefan Mengel The logic of counting query answers. 1-12 2017 LICS https://doi.org/10.1109/LICS.2017.8005085 https://doi.ieeecomputersociety.org/10.1109/LICS.2017.8005085 conf/lics/2017 db/conf/lics/lics2017.html#ChenM17

Hubie Chen Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one. 2017 abs/1710.00234 CoRR http://arxiv.org/abs/1710.00234 db/journals/corr/corr1710.html#abs-1710-00234

Hubie Chen Víctor Dalmau Decomposing Quantified Conjunctive (or Disjunctive) Formulas. 2066-2086 2016 45 SIAM J. Comput. 6 https://doi.org/10.1137/140957378 db/journals/siamcomp/siamcomp45.html#ChenD16

Hubie Chen Peter Mayr 0001 Quantified Constraint Satisfaction on Monoids. 15:1-15:14 2016 CSL https://doi.org/10.4230/LIPIcs.CSL.2016.15 conf/csl/2016 db/conf/csl/csl2016.html#ChenM16 Hubie Chen Matthew Valeriote Yuichi Yoshida Testing Assignments to Constraint Satisfaction Problems. 525-534 2016 FOCS https://doi.org/10.1109/FOCS.2016.63 https://doi.ieeecomputersociety.org/10.1109/FOCS.2016.63 conf/focs/2016 db/conf/focs/focs2016.html#ChenVY16 Hubie Chen Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. 94:1-94:14 2016 ICALP https://doi.org/10.4230/LIPIcs.ICALP.2016.94 conf/icalp/2016 db/conf/icalp/icalp2016.html#Chen16 Hubie Chen Stefan Mengel Counting Answers to Existential Positive Queries: A Complexity Classification. 315-326 2016 PODS https://doi.org/10.1145/2902251.2902279 conf/pods/2016 db/conf/pods/pods2016.html#ChenM16

Hubie Chen Stefan Mengel Counting Answers to Existential Positive Queries: A Complexity Classification. 2016 abs/1601.03240 CoRR http://arxiv.org/abs/1601.03240 db/journals/corr/corr1601.html#ChenM16

Hubie Chen Moritz Müller The parameterized space complexity of embedding along a path. 2016 abs/1602.09022 CoRR http://arxiv.org/abs/1602.09022 db/journals/corr/corr1602.html#ChenM16a

Hubie Chen Benoît Larose Asking the metaquestions in constraint tractability. 2016 abs/1604.00932 CoRR http://arxiv.org/abs/1604.00932 db/journals/corr/corr1604.html#ChenL16c

Hubie Chen Matthew Valeriote Yuichi Yoshida Testing Assignments to Constraint Satisfaction Problems. 2016 abs/1608.03017 CoRR http://arxiv.org/abs/1608.03017 db/journals/corr/corr1608.html#ChenVY16

Hubie Chen Florent R. Madelaine Barnaby Martin Quantified Constraints and Containment Problems. 2015 Log. Methods Comput. Sci. https://doi.org/10.2168/LMCS-11(3:9)2015 http://arxiv.org/abs/1310.1016 11 3 db/journals/lmcs/lmcs11.html#ChenMM13

Simone Bova Hubie Chen The complexity of equivalence, entailment, and minimization in existential positive logic. 443-457 2015 81 J. Comput. Syst. Sci. 2 https://doi.org/10.1016/j.jcss.2014.10.002 db/journals/jcss/jcss81.html#BovaC15

Hubie Chen Moritz Müller The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. 7:1-7:27 2015 7 ACM Trans. Comput. Theory 2 https://doi.org/10.1145/2751316 db/journals/toct/toct7.html#ChenM15

Hubie Chen Matthew Valeriote Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. 326-337 2015 COLT http://proceedings.mlr.press/v40/Chen15a.html conf/colt/2015 db/conf/colt/colt2015.html#ChenV15 Hubie Chen Stefan Mengel A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. 110-126 2015 ICDT https://doi.org/10.4230/LIPIcs.ICDT.2015.110 conf/icdt/2015 db/conf/icdt/icdt2015.html#ChenM15 Hubie Chen Parameter Compilation. 127-137 2015 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2015.127 conf/iwpec/2015 db/conf/iwpec/ipec2015.html#Chen15

Hubie Chen Stefan Mengel The Logic of Counting Query Answers: A Study via Existential Positive Queries. 2015 abs/1501.07195 CoRR http://arxiv.org/abs/1501.07195 db/journals/corr/corr1501.html#ChenM15b

Hubie Chen Parameter Compilation. 2015 abs/1503.00260 CoRR http://arxiv.org/abs/1503.00260 db/journals/corr/corr1503.html#Chen15h

Hubie Chen Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction. 2014 10 4 Log. Methods Comput. Sci. https://doi.org/10.2168/LMCS-10(4:14)2014 http://arxiv.org/abs/1403.0222 db/journals/lmcs/lmcs10.html#Chen14a

Manuel Bodirsky Hubie Chen Michal Wrona Tractability of quantified temporal constraints to the max. 1141-1156 2014 24 Int. J. Algebra Comput. 8 https://doi.org/10.1142/S0218196714500507 db/journals/ijac/ijac24.html#BodirskyCW14

Hubie Chen On the complexity of existential positive queries. 9:1-9:20 2014 15 ACM Trans. Comput. Log. 1 https://doi.org/10.1145/2559946 https://www.wikidata.org/entity/Q130960645 db/journals/tocl/tocl15.html#Chen14

Hubie Chen The tractability frontier of graph-like first-order query sets. 31:1-31:9 2014 CSL-LICS https://doi.org/10.1145/2603088.2603119 conf/csl/2014 db/conf/csl/csl2014.html#Chen14 Hubie Chen Moritz Müller One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. 32:1-32:10 2014 CSL-LICS https://doi.org/10.1145/2603088.2603107 conf/csl/2014 db/conf/csl/csl2014.html#ChenM14 Simone Bova Hubie Chen The Complexity of Width Minimization for Existential Positive Queries. 235-244 2014 ICDT https://doi.org/10.5441/002/icdt.2014.25 conf/icdt/2014 db/conf/icdt/icdt2014.html#BovaC14

Hubie Chen An Algebraic Hardness Criterion for Surjective Constraint Satisfaction. 2014 abs/1405.4917 CoRR http://arxiv.org/abs/1405.4917 db/journals/corr/corr1405.html#Chen14d

Hubie Chen The Tractability Frontier of Graph-Like First-Order Query Sets. 2014 abs/1407.3429 CoRR http://arxiv.org/abs/1407.3429 db/journals/corr/corr1407.html#Chen14i

Hubie Chen Stefan Mengel A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. 2014 abs/1408.0890 CoRR http://arxiv.org/abs/1408.0890 db/journals/corr/corr1408.html#ChenM14

Hubie Chen Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. 2014 abs/1410.5369 CoRR http://arxiv.org/abs/1410.5369 db/journals/corr/corr1410.html#Chen14o

Simone Bova Hubie Chen Matthew Valeriote Generic expression hardness results for primitive positive formula comparison. 108-120 2013 222 Inf. Comput. https://doi.org/10.1016/j.ic.2012.10.008 db/journals/iandc/iandc222.html#BovaCV13

Hubie Chen Bounded rationality, strategy simplification, and equilibrium. 593-611 2013 42 Int. J. Game Theory 3 https://doi.org/10.1007/s00182-011-0293-7 db/journals/ijgt/ijgt42.html#Chen13

Hubie Chen Víctor Dalmau Berit Grußien Arc consistency and friends. 87-108 2013 23 J. Log. Comput. 1 https://doi.org/10.1093/logcom/exr039 db/journals/logcom/logcom23.html#ChenDG13

Hubie Chen Dániel Marx Block-Sorted Quantified Conjunctive Queries. 125-136 2013 ICALP (2) https://doi.org/10.1007/978-3-642-39212-2_14 conf/icalp/2013-2 db/conf/icalp/icalp2013-2.html#ChenM13 Hubie Chen Moritz Müller The fine classification of conjunctive queries and parameterized logarithmic space complexity. 309-320 2013 PODS https://doi.org/10.1145/2463664.2463669 conf/pods/2013 db/conf/pods/pods2013.html#ChenM13

Hubie Chen Moritz Müller The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space Complexity. 2013 CoRR http://arxiv.org/abs/1306.5424 abs/1306.5424 db/journals/corr/corr1306.html#ChenM13

Hubie Chen Moritz Müller One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. 2013 CoRR http://arxiv.org/abs/1307.1353 abs/1307.1353 db/journals/corr/corr1307.html#ChenM13a

Hubie Chen Moritz Müller An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction https://doi.org/10.2168/LMCS-9(1:15)2013 http://arxiv.org/abs/1207.6696 2012 Log. Methods Comput. Sci. 9 1 db/journals/lmcs/lmcs9.html#abs-1207-6696

Simone Bova Hubie Chen Matthew Valeriote On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. 329-353 2012 50 Theory Comput. Syst. 2 https://doi.org/10.1007/s00224-010-9302-7 db/journals/mst/mst50.html#BovaCV12

Manuel Bodirsky Hubie Chen Tomás Feder On the Complexity of MMSNP. 404-414 2012 26 SIAM J. Discret. Math. 1 https://doi.org/10.1137/090778493 db/journals/siamdm/siamdm26.html#BodirskyCF12

Hubie Chen Meditations on Quantified Constraint Satisfaction. 35-49 2012 Logic and Program Semantics https://doi.org/10.1007/978-3-642-29485-3_4 conf/birthday/2012kozen db/conf/birthday/kozen2012.html#Chen12 Hubie Chen Víctor Dalmau Decomposing Quantified Conjunctive (or Disjunctive) Formulas. 205-214 2012 LICS https://doi.org/10.1109/LICS.2012.31 https://doi.ieeecomputersociety.org/10.1109/LICS.2012.31 conf/lics/2012 db/conf/lics/lics2012.html#ChenD12 Hubie Chen Moritz Müller An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. 215-224 2012 LICS https://doi.org/10.1109/LICS.2012.32 https://doi.ieeecomputersociety.org/10.1109/LICS.2012.32 conf/lics/2012 db/conf/lics/lics2012.html#ChenM12 Hubie Chen Michal Wrona Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. 99-106 2012 TIME https://doi.org/10.1109/TIME.2012.19 https://doi.ieeecomputersociety.org/10.1109/TIME.2012.19 conf/time/2012 db/conf/time/time2012.html#ChenW12

Hubie Chen Meditations on Quantified Constraint Satisfaction http://arxiv.org/abs/1201.6306 2012 CoRR abs/1201.6306 db/journals/corr/corr1201.html#abs-1201-6306

Simone Bova Hubie Chen Matthew Valeriote Generic Expression Hardness Results for Primitive Positive Formula Comparison http://arxiv.org/abs/1205.5745 2012 CoRR abs/1205.5745 db/journals/corr/corr1205.html#abs-1205-5745

Hubie Chen On the Complexity of Existential Positive Queries http://arxiv.org/abs/1206.3902 2012 CoRR abs/1206.3902 db/journals/corr/corr1206.html#abs-1206-3902

Simone Bova Hubie Chen Matthew Valeriote Generic Expression Hardness Results for Primitive Positive Formula Comparison. 344-355 2011 ICALP (2) https://doi.org/10.1007/978-3-642-22012-8_27 conf/icalp/2011-2 db/conf/icalp/icalp2011-2.html#BovaCV11

Hubie Chen Víctor Dalmau Berit Grußien Arc Consistency and Friends http://arxiv.org/abs/1104.4993 2011 CoRR abs/1104.4993 db/journals/corr/corr1104.html#abs-1104-4993

Hubie Chen Omer Giménez Causal graphs and structurally restricted planning. 579-592 2010 76 J. Comput. Syst. Sci. 7 https://doi.org/10.1016/j.jcss.2009.10.013 db/journals/jcss/jcss76.html#ChenG10

Hubie Chen Martin Grohe Constraint satisfaction with succinctly specified relations. 847-860 2010 76 J. Comput. Syst. Sci. 8 https://doi.org/10.1016/j.jcss.2010.04.003 db/journals/jcss/jcss76.html#ChenG10a

Manuel Bodirsky Hubie Chen Michael Pinsker The reducts of equality up to primitive positive interdefinability. 1249-1292 2010 75 J. Symb. Log. 4 https://doi.org/10.2178/jsl/1286198146 http://projecteuclid.org/euclid.jsl/1286198146 db/journals/jsyml/jsyml75.html#BodirskyCP10

Manuel Bodirsky Hubie Chen Quantified Equality Constraints. 3682-3699 2010 39 SIAM J. Comput. 8 https://doi.org/10.1137/080725209 db/journals/siamcomp/siamcomp39.html#BodirskyC10

Manuel Bodirsky Hubie Chen Peek arc consistency. 445-453 2010 411 Theor. Comput. Sci. 2 https://doi.org/10.1016/j.tcs.2009.07.059 db/journals/tcs/tcs411.html#BodirskyC10

Hubie Chen Bounded Rationality, Strategy Simplification, and Equilibrium http://arxiv.org/abs/1002.4577 2010 CoRR abs/1002.4577 db/journals/corr/corr1002.html#abs-1002-4577

Manuel Bodirsky Hubie Chen Relatively quantified constraint satisfaction. 3-15 2009 14 Constraints An Int. J. 1 https://doi.org/10.1007/s10601-008-9054-z db/journals/constraints/constraints14.html#BodirskyC09

Hubie Chen A rendezvous of logic, complexity, and algebra. 2009 42 ACM Comput. Surv. 1 https://doi.org/10.1145/1592451.1592453 https://www.wikidata.org/entity/Q55967128 db/journals/csur/csur42.html#Chen09 2:1-2:32

Hubie Chen Existentially restricted quantified constraint satisfaction. 369-388 2009 207 Inf. Comput. 3 https://doi.org/10.1016/j.ic.2008.11.001 db/journals/iandc/iandc207.html#Chen09

Ferdinand Börner Andrei A. Bulatov Hubie Chen Peter Jeavons 0001 Andrei A. Krokhin The complexity of constraint satisfaction games and QCSP. 923-944 2009 207 Inf. Comput. 9 https://doi.org/10.1016/j.ic.2009.05.003 db/journals/iandc/iandc207.html#BornerBCJK09

Manuel Bodirsky Hubie Chen Qualitative Temporal and Spatial Reasoning Revisited. 1359-1383 2009 19 J. Log. Comput. 6 https://doi.org/10.1093/logcom/exp025 db/journals/logcom/logcom19.html#BodirskyC09

Manuel Bodirsky Hubie Chen Jan Kára Timo von Oertzen Maximal infinite-valued constraint languages. 1684-1693 2009 410 Theor. Comput. Sci. 18 https://doi.org/10.1016/j.tcs.2008.12.050 db/journals/tcs/tcs410.html#BodirskyCKO09

Hubie Chen Omer Giménez On-the-Fly Macros. 155-169 2009 WoLLIC https://doi.org/10.1007/978-3-642-02261-6_13 conf/wollic/2009 db/conf/wollic/wollic2009.html#ChenG09 Matthew Valeriote Simone Bova Hubie Chen On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. 2009 The Constraint Satisfaction Problem: Complexity and Approximability http://drops.dagstuhl.de/opus/volltexte/2010/2369/ conf/dagstuhl/2009P9441 db/conf/dagstuhl/P9441.html#ValerioteBC09

Hubie Chen Inverse NP Problems. 94-118 2008 17 Comput. Complex. 1 https://doi.org/10.1007/s00037-008-0240-6 db/journals/cc/cc17.html#Chen08

Hubie Chen The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. 1674-1701 2008 37 SIAM J. Comput. 5 https://doi.org/10.1137/060668572 db/journals/siamcomp/siamcomp37.html#Chen08

Hubie Chen Omer Giménez Causal Graphs and Structurally Restricted Planning. 36-43 2008 ICAPS conf/aips/2008 db/conf/aips/icaps2008.html#ChenG08 http://www.aaai.org/Library/ICAPS/2008/icaps08-005.php Hubie Chen Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. 197-208 2008 ICALP (2) https://doi.org/10.1007/978-3-540-70583-3_17 conf/icalp/2008-2 db/conf/icalp/icalp2008-2.html#Chen08 Hubie Chen Florent R. Madelaine Barnaby Martin Quantified Constraints and Containment Problems. 317-328 2008 LICS https://doi.org/10.1109/LICS.2008.15 https://doi.ieeecomputersociety.org/10.1109/LICS.2008.15 conf/lics/2008 db/conf/lics/lics2008.html#ChenMM08

Manuel Bodirsky Hubie Chen Peek Arc Consistency http://arxiv.org/abs/0809.0788 2008 CoRR abs/0809.0788 db/journals/corr/corr0809.html#abs-0809-0788

Andrei A. Bulatov Hubie Chen Víctor Dalmau Learning intersection-closed classes with signatures. 209-220 2007 382 Theor. Comput. Sci. 3 https://doi.org/10.1016/j.tcs.2007.03.039 db/journals/tcs/tcs382.html#BulatovCD07

Hubie Chen Omer Giménez Act Local, Think Global: Width Notions for Tractable Planning. 73-80 2007 ICAPS conf/aips/2007 db/conf/aips/icaps2007.html#ChenG07 http://www.aaai.org/Library/ICAPS/2007/icaps07-010.php Manuel Bodirsky Hubie Chen Qualitative Temporal and Spatial Reasoning Revisited. 194-207 2007 conf/csl/2007 CSL https://doi.org/10.1007/978-3-540-74915-8_17 db/conf/csl/csl2007.html#BodirskyC07 Manuel Bodirsky Hubie Chen Jan Kára Timo von Oertzen Maximal Infinite-Valued Constraint Languages. 546-557 2007 conf/icalp/2007 ICALP https://doi.org/10.1007/978-3-540-73420-8_48 db/conf/icalp/icalp2007.html#BodirskyCKO07 Manuel Bodirsky Hubie Chen Quantified Equality Constraints. 203-212 2007 conf/lics/2007 LICS https://doi.org/10.1109/LICS.2007.38 https://doi.ieeecomputersociety.org/10.1109/LICS.2007.38 db/conf/lics/lics2007.html#BodirskyC07

Hubie Chen A rendezvous of logic, complexity, and algebra. 85-114 2006 37 SIGACT News 4 https://doi.org/10.1145/1189056.1189076 db/journals/sigact/sigact37.html#Chen06

Manuel Bodirsky Hubie Chen Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. 197-211 2006 conf/csl/2006 CSL https://doi.org/10.1007/11874683_13 db/conf/csl/csl2006.html#BodirskyC06 Hubie Chen Martin Grohe Constraint Satisfaction with Succinctly Specified Relations. 2006 Complexity of Constraints http://drops.dagstuhl.de/opus/volltexte/2006/802 conf/dagstuhl/2006P6401 db/conf/dagstuhl/P6401.html#ChenG06

Hubie Chen The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case http://arxiv.org/abs/cs/0607106 2006 CoRR abs/cs/0607106 db/journals/corr/corr0607.html#abs-cs-0607106

Hubie Chen Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra http://arxiv.org/abs/cs/0611018 2006 CoRR abs/cs/0611018 db/journals/corr/corr0611.html#abs-cs-0611018

Hubie Chen The expressive rate of constraints. 341-352 2005 44 Ann. Math. Artif. Intell. 4 https://doi.org/10.1007/s10472-005-7031-4 db/journals/amai/amai44.html#Chen05

Hubie Chen Periodic Constraint Satisfaction Problems: Tractable Subclasses. 97-113 2005 10 Constraints An Int. J. 2 https://doi.org/10.1007/s10601-005-0551-z db/journals/constraints/constraints10.html#Chen05

Hubie Chen Víctor Dalmau Beyond Hypertree Width: Decomposition Methods Without Decompositions. 167-181 2005 conf/cp/2005 CP https://doi.org/10.1007/11564751_15 db/conf/cp/cp2005.html#ChenD05 Hubie Chen Víctor Dalmau From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. 232-247 2005 conf/csl/2005 CSL https://doi.org/10.1007/11538363_17 db/conf/csl/csl2005.html#ChenD05 Hubie Chen Yannet Interian A Model for Generating Random Quantified Boolean Formulas. 66-71 2005 conf/ijcai/2005 IJCAI http://ijcai.org/Proceedings/05/Papers/0633.pdf db/conf/ijcai/ijcai2005.html#ChenI05 Hubie Chen Parameterized Compilability. 412-417 2005 conf/ijcai/2005 IJCAI http://ijcai.org/Proceedings/05/Papers/0644.pdf db/conf/ijcai/ijcai2005.html#Chen05 Hubie Chen Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. 315-326 https://doi.org/10.1007/978-3-540-31856-9_26 2005 conf/stacs/2005 STACS db/conf/stacs/stacs2005.html#Chen05

Hubie Chen Víctor Dalmau Beyond Hypertree Width: Decomposition Methods Without Decompositions http://arxiv.org/abs/cs/0505035 2005 CoRR abs/cs/0505035 db/journals/corr/corr0505.html#abs-cs-0505035

Hubie Chen Existentially Restricted Quantified Constraint Satisfaction http://arxiv.org/abs/cs/0506059 2005 CoRR abs/cs/0506059 db/journals/corr/corr0506.html#abs-cs-0506059

Hubie Chen Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms Electron. Colloquium Comput. Complex. 2005 TR05 TR05-036 db/journals/eccc/eccc12.html#TR05-036 https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-036/index.html

Hubert Ming Chen The Computational Complexity of Quantified Constraint Satisfaction. Cornell University, USA 2004

Hubie Chen Riccardo Pucella A coalgebraic approach to Kleene algebra with tests. 23-44 2004 327 Theor. Comput. Sci. 1-2 https://doi.org/10.1016/j.tcs.2004.07.020 db/journals/tcs/tcs327.html#ChenP04

Hubie Chen Collapsibility and Consistency in Quantified Constraint Satisfaction. 155-160 2004 conf/aaai/2004 AAAI db/conf/aaai/aaai2004.html#Chen04 http://www.aaai.org/Library/AAAI/2004/aaai04-025.php Andrei A. Bulatov Hubie Chen Víctor Dalmau Learnability of Relatively Quantified Generalized Formulas. 365-379 https://doi.org/10.1007/978-3-540-30215-5_28 2004 conf/alt/2004 ALT db/conf/alt/alt2004.html#BulatovCD04 Hubie Chen Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. 168-181 https://doi.org/10.1007/978-3-540-30201-8_15 2004 conf/cp/2004 CP db/conf/cp/cp2004.html#Chen04 Hubie Chen Víctor Dalmau (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. 182-196 https://doi.org/10.1007/978-3-540-30201-8_16 2004 conf/cp/2004 CP db/conf/cp/cp2004.html#ChenD04 Hubie Chen Stephen Chong Owned Policies for Information Security. 126-138 2004 conf/csfw/2004 CSFW https://doi.ieeecomputersociety.org/10.1109/CSFW.2004.15 db/conf/csfw/csfw2004.html#ChenC04 Hubie Chen Quantified Constraint Satisfaction and Bounded Treewidth. 161-165 2004 conf/ecai/2004 ECAI db/conf/ecai/ecai2004.html#Chen04 Hubie Chen The Expressive Rate of Constraints. 2004 AI&M http://rutcor.rutgers.edu/~amai/aimath04/AcceptedPapers/Chen-aimath04.pdf conf/isaim/2004 db/conf/isaim/isaim2004.html#Chen04 Hubie Chen Martin Pál Optimization, Games, and Quantified Constraint Satisfaction. 239-250 https://doi.org/10.1007/978-3-540-28629-5_16 2004 conf/mfcs/2004 MFCS db/conf/mfcs/mfcs2004.html#ChenP04 Hubie Chen Víctor Dalmau Looking Algebraically at Tractable Quantified Boolean Formulas. 2004 conf/sat/2004 SAT http://www.satisfiability.org/SAT04/programme/91.pdf db/conf/sat/sat2004.html#ChenD04 Hubie Chen Víctor Dalmau Looking Algebraically at Tractable Quantified Boolean Formulas. 71-79 2004 conf/sat/2004lncs SAT (Selected Papers https://doi.org/10.1007/11527695_6 db/conf/sat/sat2004lncs.html#ChenD04a

Hubie Chen Riccardo Pucella A Coalgebraic Approach to Kleene Algebra with Tests http://arxiv.org/abs/cs/0405097 2004 CoRR cs.LO/0405097 db/journals/corr/corr0405.html#cs-LO-0405097

Hubie Chen Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. 199-213 https://doi.org/10.1007/978-3-540-45193-8_14 2003 conf/cp/2003 CP db/conf/cp/cp2003.html#Chen03 Hubie Chen Inverse Circumscription. 449-454 2003 conf/ijcai/2003 IJCAI db/conf/ijcai/ijcai2003.html#Chen03 http://ijcai.org/Proceedings/03/Papers/067.pdf Hubie Chen A Theory of Average-Case Compilability in Knowledge Representation. 455-460 2003 conf/ijcai/2003 IJCAI db/conf/ijcai/ijcai2003.html#Chen03a http://ijcai.org/Proceedings/03/Papers/068.pdf Hubie Chen Arithmetic Constant-Depth Circuit Complexity Classes. 328-337 https://doi.org/10.1007/978-3-540-45138-9_27 2003 conf/mfcs/2003 MFCS db/conf/mfcs/mfcs2003.html#Chen03 Hubie Chen Inverse NP Problems. 338-347 https://doi.org/10.1007/978-3-540-45138-9_28 2003 conf/mfcs/2003 MFCS db/conf/mfcs/mfcs2003.html#Chen03a Hubie Chen An Algorithm for SAT Above the Threshold. 14-24 https://doi.org/10.1007/978-3-540-24605-3_2 2003 conf/sat/2003 SAT db/conf/sat/sat2003.html#Chen03 Hubie Chen Riccardo Pucella A Coalgebraic Approach to Kleene Algebra with Tests. 2003 conf/cmcs/2003 CMCS https://doi.org/10.1016/S1571-0661(04)80634-0 db/conf/cmcs/cmcs2003.html#ChenP03 94-109 Hubie Chen Carla P. Gomes Bart Selman Formal Models of Heavy-Tailed Behavior in Combinatorial Search. 408-421 2001 conf/cp/2001 CP https://doi.org/10.1007/3-540-45578-7_28 db/conf/cp/cp2001.html#ChenGS01

Hubie Chen Polynomial Programs and the Razborov-Smolensky Method Electron. Colloquium Comput. Complex. 2001 TR01 TR01-067 db/journals/eccc/eccc8.html#ECCC-TR01-067 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-067/index.html

Hubie Chen Arithmetic Versions of Constant Depth Circuit Complexity Classes Electron. Colloquium Comput. Complex. 2001 TR01 TR01-095 db/journals/eccc/eccc8.html#ECCC-TR01-095 https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-095/index.html

Christoph Berkholz Manuel Bodirsky Ferdinand Börner Simone Bova Andrei A. Bulatov Stephen Chong Radu Curticapean Víctor Dalmau Holger Dell Tomás Feder Omer Giménez Carla P. Gomes Georg Gottlob Gianluigi Greco Martin Grohe Berit Grußien Mans Hulden Yannet Interian Bart M. P. Jansen Peter Jeavons 0001 Jan Kára Mahmoud Abo Khamis Andrei A. Krokhin Matthias Lanzinger Benoît Larose Florent R. Madelaine Barnaby Martin Dániel Marx Peter Mayr 0001 Stefan Mengel Moritz MuellerMoritz Müller Timo von Oertzen Karolina Okrasa Martin Pál Reinhard Pichler Astrid Pieterse Michael Pinsker Riccardo Pucella Pawel Rzazewski Francesco Scarcello Markus Schneider Bart Selman Matthew ValerioteMatt Valeriote Michal Wrona Yuichi Yoshida