Browse by Staff

Chen, Hubie and Valeriote, M. and Yoshida, Y. (2019) Constant-query testability of assignments to constraint satisfaction problems. SIAM Journal on Computing 48 (3), pp. 1022-1045. ISSN 1095-7111.

Chen, Hubie and Valeriote, M. (2019) Learnability of solutions to conjunctive queries. Journal of Machine Learning Research 20 (67), pp. 1-28. ISSN 1532-4435.

Bova, S. and Chen, Hubie (2018) How many variables are needed to express an existential positive query? Theory of Computing Systems 63 (152), pp. 1573-1594. ISSN 1432-4350.

Chen, Hubie and Mueller, M. (2017) One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. ACM Transactions on Computational Logic 18 (4), ISSN 1529-3785.

Chen, Hubie (2017) Proof complexity modulo the Polynomial Hierarchy: understanding alternation as a source of hardness. ACM Transactions on Computation Theory 9 (3), ISSN 1942-3454.

Chen, Hubie (2017) The Tractability Frontier of Graph-Like First-Order Query Sets. Journal of the ACM 64 (4), pp. 1-29. ISSN 000-45411.

Chen, Hubie and Dalmau, V. (2016) Decomposing quantified conjunctive (or disjunctive) formulas. SIAM Journal on Computing 45 (6), pp. 2066-2086. ISSN 0097-5397.

Chen, Hubie and Muller, M. (2015) The fine classification of conjunctive queries and parameterized logarithmic space. In: UNSPECIFIED (ed.) PODS '13 Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems. New York, U.S.: ACM Publications, pp. 309-320. ISBN 9781450320665.

Chen, Hubie (2014) The tractability frontier of graph-like first-order query sets. In: UNSPECIFIED (ed.) CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York, U.S.: ACM Publications. ISBN 9781450328869.

Chen, Hubie (2014) On the complexity of Existential Positive Queries. ACM Transactions on Computational Logic 15 (1), ISSN 1529-3785.

Chen, Hubie and Gimenez, O. (2007) Act local, think global: width notions for tractable planning. In: Boddy, M.S. and Fox, M. and Thiebaux, S. (eds.) ICAPS 2007: Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling. AAAI, pp. 73-80.

Bulatov, A.A. and Chen, Hubie and Dalmau, V. (2007) Learning intersection-closed classes with signatures. Theoretical Computer Science 382 (3), pp. 209-220. ISSN 0304-3975.

Bodirsky, M. and Chen, Hubie and Kara, J. and von Oertzen, T. (2007) Maximal infinite-valued constraint languages. In: Arge, L. and Cachin, C. and Jurdzinski, T. and Tarlecki, A. (eds.) ICALP 2007: Automata, Languages and Programming, 34th International Colloquium. Lecture Notes in Computer Science 4596. Springer, pp. 546-557. ISBN 9783540734192.

Bodirsky, M. and Chen, Hubie (2007) Qualitative temporal and spatial reasoning revisited. In: Duparc, J. and Henzinger, T.A. (eds.) Computer Science Logic: 21st International Workshop. Lecture Notes in Computer Science 4646. Springer, pp. 194-207. ISBN 9783540749141.

Bodirsky, M. and Chen, Hubie (2007) Quantified equality constraints. In: UNSPECIFIED (ed.) LICS 2007: 22nd IEEE Symposium on Logic in Computer Science. IEEE Computer Society, pp. 203-212. ISBN 0769529089.

Bodirsky, M. and Chen, Hubie (2006) Collapsibility in infinite-domain quantified constraint satisfaction. In: Zoltan, E. (ed.) CSL 2006: Computer Science Logic. Lecture Notes in Computer Science 4207. Springer, pp. 197-211. ISBN 9783540454588.

Chen, Hubie and Grohe, M. (2006) Constraint satisfaction with succinctly specified relations. In: Creignou, N. and Kolaitis, P.G. and Vollmer, H. (eds.) Complexity of Constraints. Dagstuhl Seminar Proceedings 06401. Internationales Begegnungs- und Forschungszentrum fuer Informatik.

Chen, Hubie (2006) Logic column 17: a rendezvous of logic, complexity, and algebra. CoRR ,

Chen, Hubie (2006) The complexity of quantified constraint satisfaction: collapsibility, sink algebras, and the three-element case. CoRR ,

Chen, Hubie (2006) A rendezvous of logic, complexity, and algebra. ACM SIGACT News 37 (4), pp. 85-114.

Chen, Hubie and Dalmau, V. (2005) Beyond hypertree width: decomposition methods without decompositions. In: van Beek, P. (ed.) CP 11th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 3709. Springer, pp. 167-181. (Unpublished)

Chen, Hubie (2005) Existentially restricted quantified constraint satisfaction. CoRR ,

Chen, Hubie (2005) Periodic constraint satisfaction problems: tractable subclasses. Constraints 10 (2), pp. 97-113. ISSN 1383-7133.

Chen, Hubie (2005) Quantified constraint satisfaction, maximal constraint languages, and symmetric polymorphisms. Electronic Colloquium on Computational Complexity 036 , ISSN 1433-8092.

Chen, Hubie (2005) The expressive rate of constraints. Annals of Mathematics and Artificial Intelligence 44 (4), pp. 341-352. ISSN 1012-2443.

Chen, Hubie (2004) Collapsibility and consistency in quantified constraint satisfaction. In: McGuinness, D.L. and Ferguson, G. (eds.) Proceedings of the Nineteenth National Conference on Artificial Intelligence. AAAI, pp. 155-160.

Bulatov, A.A. and Chen, Hubie and Dalmau, V. (2004) Learnability of relatively quantified generalized formulas. In: David, S. and Case, J. and Maruoka, A. (eds.) 15th International Conference: Algorithmic Learning Theory. Lecture Notes in Computer Science 3244. Springer, pp. 365-379. ISBN 9783540233565.

Chen, Hubie and Dalmau, V. (2004) Looking algebraically at tractable quantified Boolean formulas. In: UNSPECIFIED (ed.) SAT 2004: The Seventh International Conference on Theory and Applications of Satisfiability Testing. Springer. ISBN 9783540278290.

Chen, Hubie and Pal, M. and Kratochvil, J. (2004) Optimization, games, and quantified constraint satisfaction. In: Fiala, J. and Koubek, V. (eds.) 29th International Symposium: Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 3153. Springer, pp. 239-250. ISBN 9783540228233.

Chen, Hubie and Chong, S. (2004) Owned policies for information security. In: UNSPECIFIED (ed.) 17th IEEE Computer Security Foundations Workshop. IEEE Computer Society, pp. 126-138.

Chen, Hubie (2004) Quantified constraint satisfaction and 2-semilattice polymorphisms. In: Wallace, Mark (ed.) 10th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 3258. Springer, pp. 168-181. ISBN 9783540232414.

Chen, Hubie (2004) Quantified constraint satisfaction and bounded treewidth. In: Lopez de Mantara, R. and Saitta, L. (eds.) Proceedings of the 16th Eureopean Conference on Artificial Intelligence. IOS Press, pp. 161-165.

Chen, Hubie and Dalmau, V. (2004) Smart look-ahead arc consistency and the pursuit of CSP tractability. In: Wallace, M. (ed.) 10th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 3258. Springer, pp. 182-196. ISBN 9783540232414.

Chen, Hubie and Pucella, R. (2004) A coalgebraic approach to Kleene algebra with tests. Theoretical Computer Science 327 (1-2), pp. 23-44. ISSN 0304-3975.

Chen, Hubie and Pucella, R. (2004) A coalgebraic approach to Kleene algebra with tests. CoRR ,

Chen, Hubie (2004) The expressive rate of constraints. In: UNSPECIFIED (ed.) International Symposium on Artificial Intelligence and Mathematics. AI&M.

Chen, Hubie (2003) Arithmetic constant-depth circuit complexity classes. In: Rovan, B. and Vojtas, P. (eds.) 28th International Symposium: Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 2724. Springer, pp. 328-337. ISBN 9783540406716.

Chen, Hubie (2003) Inverse NP problems. In: Rovan, B. and Vojtas, P. (eds.) 28th International Symposium: Mathematical Foundations of Computer Science. Lecture Notes in Computer Science 2747. Springer, pp. 338-347. ISBN 9783540406716.

Chen, Hubie (2003) Inverse circumscription. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 449-454.

Chen, Hubie (2003) Periodic constraint satisfaction problems: polynomial-time algorithms. In: Rossi, F. (ed.) 9th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 2833. Springer, pp. 199-213. ISBN 9783540202028.

Chen, Hubie (2003) An algorithm for SAT above the threshold. In: Giunchiglia, E. and Tacchella, A. (eds.) 6th International Conference: Theory and Applications of Satisfiability Testing. Lecture Notes in Computer Science 2919. Springer, pp. 14-24. ISBN 9783540208518.

Chen, Hubie and Pucella, R. (2003) A coalgebraic approach to Kleene algebra with tests. Electronic Notes in Theoretical Computer Science 82 (1), pp. 94-109. ISSN 1571-0661.

Chen, Hubie (2003) A theory of average-case compilability in knowledge representation. In: Gottlob, G. and Walsh, T. (eds.) IJCAI-03: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp. 455-460.

Chen, Hubie (2001) Arithmetic versions of constant depth circuit complexity classes. Electronic Colloquium on Computational Complexity (095), ISSN 1433-8092.

Chen, Hubie and Gomes, C.P. and Selman, B. (2001) Formal models of heavy-tailed behavior in combinatorial search. In: Walsh, T. (ed.) 7th International Conference: Principles and Practice of Constraint Programming. Lecture Notes in Computer Science 2239. Springer, pp. 408-421. ISBN 9783540428633.

Chen, Hubie (2001) Polynomial programs and the Razborov-Smolensky method. Electronic Colloquium on Computational Complexity 8 (067), ISSN 1433-8092.