Hubie Chen

Affiliations:
  • King's College London, UK


According to our database1, Hubie Chen authored at least 90 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability.
CoRR, 2023

2020
Algebraic Global Gadgetry for Surjective Constraint Satisfaction.
CoRR, 2020

Best-Case and Worst-Case Sparsifiability of Boolean CSPs.
Algorithmica, 2020

Sparsification Lower Bounds for List H-Coloring.
Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019
Constant-Query Testability of Assignments to Constraint Satisfaction Problems.
SIAM J. Comput., 2019

How Many Variables are Needed to Express an Existential Positive Query?
Theory Comput. Syst., 2019

Learnability of Solutions to Conjunctive Queries.
J. Mach. Learn. Res., 2019

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

Compiling Existential Positive Queries to Bounded-Variable Fragments.
Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2019

2018
The Computational Complexity of Distinctive Feature Minimization in Phonology.
Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2018

2017
Asking the Metaquestions in Constraint Tractability.
ACM Trans. Comput. Theory, 2017

Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness.
ACM Trans. Comput. Theory, 2017

One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries.
ACM Trans. Comput. Log., 2017

The Parameterized Space Complexity of Embedding Along a Path.
Theory Comput. Syst., 2017

The Tractability Frontier of Graph-Like First-Order Query Sets.
J. ACM, 2017

Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one.
CoRR, 2017

The logic of counting query answers.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Decomposing Quantified Conjunctive (or Disjunctive) Formulas.
SIAM J. Comput., 2016

Counting Answers to Existential Positive Queries: A Complexity Classification.
Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, 2016

Testing Assignments to Constraint Satisfaction Problems.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Quantified Constraint Satisfaction on Monoids.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space.
ACM Trans. Comput. Theory, 2015

The complexity of equivalence, entailment, and minimization in existential positive logic.
J. Comput. Syst. Sci., 2015

Quantified Constraints and Containment Problems.
Log. Methods Comput. Sci., 2015

The Logic of Counting Query Answers: A Study via Existential Positive Queries.
CoRR, 2015

Parameter Compilation.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries.
Proceedings of the 18th International Conference on Database Theory, 2015

Learnability of Solutions to Conjunctive Queries: The Full Dichotomy.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
On the complexity of existential positive queries.
ACM Trans. Comput. Log., 2014

Tractability of quantified temporal constraints to the max.
Int. J. Algebra Comput., 2014

An Algebraic Hardness Criterion for Surjective Constraint Satisfaction.
CoRR, 2014

Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction.
Log. Methods Comput. Sci., 2014

The Complexity of Width Minimization for Existential Positive Queries.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

2013
Arc consistency and friends.
J. Log. Comput., 2013

Bounded rationality, strategy simplification, and equilibrium.
Int. J. Game Theory, 2013

Generic expression hardness results for primitive positive formula comparison.
Inf. Comput., 2013

The fine classification of conjunctive queries and parameterized logarithmic space complexity.
Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2013

Block-Sorted Quantified Conjunctive Queries.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
On the Complexity of MMSNP.
SIAM J. Discret. Math., 2012

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas.
Theory Comput. Syst., 2012

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction
Log. Methods Comput. Sci., 2012

Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction.
Proceedings of the 19th International Symposium on Temporal Representation and Reasoning, 2012

Meditations on Quantified Constraint Satisfaction.
Proceedings of the Logic and Program Semantics, 2012

2010
Peek arc consistency.
Theor. Comput. Sci., 2010

Quantified Equality Constraints.
SIAM J. Comput., 2010

The reducts of equality up to primitive positive interdefinability.
J. Symb. Log., 2010

Constraint satisfaction with succinctly specified relations.
J. Comput. Syst. Sci., 2010

Causal graphs and structurally restricted planning.
J. Comput. Syst. Sci., 2010

2009
Maximal infinite-valued constraint languages.
Theor. Comput. Sci., 2009

Qualitative Temporal and Spatial Reasoning Revisited.
J. Log. Comput., 2009

Existentially restricted quantified constraint satisfaction.
Inf. Comput., 2009

The complexity of constraint satisfaction games and QCSP.
Inf. Comput., 2009

A rendezvous of logic, complexity, and algebra.
ACM Comput. Surv., 2009

Relatively quantified constraint satisfaction.
Constraints An Int. J., 2009

On-the-Fly Macros.
Proceedings of the Logic, 2009

2008
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case.
SIAM J. Comput., 2008

Inverse NP Problems.
Comput. Complex., 2008

Quantified Constraint Satisfaction and the Polynomially Generated Powers Property.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007
Learning intersection-closed classes with signatures.
Theor. Comput. Sci., 2007

Act Local, Think Global: Width Notions for Tractable Planning.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

2006
Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra
CoRR, 2006

Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
Electron. Colloquium Comput. Complex., 2005

Periodic Constraint Satisfaction Problems: Tractable Subclasses.
Constraints An Int. J., 2005

The expressive rate of constraints.
Ann. Math. Artif. Intell., 2005

A Model for Generating Random Quantified Boolean Formulas.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Parameterized Compilability.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

Beyond Hypertree Width: Decomposition Methods Without Decompositions.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
Looking Algebraically at Tractable Quantified Boolean Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2004

Optimization, Games, and Quantified Constraint Satisfaction.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Quantified Constraint Satisfaction and Bounded Treewidth.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Owned Policies for Information Security.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Learnability of Relatively Quantified Generalized Formulas.
Proceedings of the Algorithmic Learning Theory, 15th International Conference, 2004

Collapsibility and Consistency in Quantified Constraint Satisfaction.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
A Coalgebraic Approach to Kleene Algebra with Tests.
Proceedings of the 6th International Workshop on Coalgebraic Methods in Computer Science, 2003

An Algorithm for SAT Above the Threshold.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Arithmetic Constant-Depth Circuit Complexity Classes.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

A Theory of Average-Case Compilability in Knowledge Representation.
Proceedings of the IJCAI-03, 2003

Inverse Circumscription.
Proceedings of the IJCAI-03, 2003

Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2001
Arithmetic Versions of Constant Depth Circuit Complexity Classes
Electron. Colloquium Comput. Complex., 2001

Polynomial Programs and the Razborov-Smolensky Method
Electron. Colloquium Comput. Complex., 2001

Formal Models of Heavy-Tailed Behavior in Combinatorial Search.
Proceedings of the Principles and Practice of Constraint Programming, 2001


  Loading...