Hubie (Hubert) Chen

Departament de Tecnologies de la Informació i les Comunicacions
Universitat Pompeu Fabra
Barcelona, Spain

E-Mail Address: please use my gmail address if possible. Otherwise, please try (five-letter first name)(dot)(last name)(at)(three-letter abbreviation of university)(dot)(edu).

Affiliations: Theoretical Computer Science group at UPF | Artificial Intelligence group at UPF

Full List of Publications

Recent/Selected Publications

• Hubie Chen.
  Bounded Rationality, Strategy Simplification, and Equilibrium.
  arXiv:1002.4577
  

• Hubie Chen and Omer Gimenez.
  On-the-fly Macros.
  16th Workshop on Logic, Language, Information and Computation (WOLLIC), 2009, Tokyo, Japan.
  

• Manuel Bodirsky, Hubie Chen, and Michael Pinsker.
  The reducts of equality up to primitive positive interdefinability.
  arXiv:0810.2270
  Journal of Symbolic Logic.
  

• Hubie Chen.
  A Rendezvous of Logic, Complexity, and Algebra.
  ACM Computing Surveys, Volume 42, Issue 1, December 2009.
  Earlier version appeared as: SIGACT News Logic Column, December 2006. (See Errata.)
  

• Hubie Chen and Omer Gimenez.
  Causal Graphs and Structurally Restricted Planning.
  Journal of Computer and System Sciences.
  Conference version appeared in: International Conference on Automated Planning & Scheduling (ICAPS), 2008, Sydney, Australia.
  

• Hubie Chen.
  Quantified Constraint Satisfaction and the Polynomially Generated Powers Property.
  35th International Colloquium on Automata, Languages and Programming (ICALP), 2008, Reykjavik, Iceland.
  

• Manuel Bodirsky and Hubie Chen.
  Qualitative Temporal and Spatial Reasoning Revisited.
  Journal of Logic and Computation, 19(6):1359-1383, 2009.
  Conference version appeared in: Computer Science Logic (CSL), 2007, Lausanne, Switzerland.
  

• Manuel Bodirsky and Hubie Chen.
  Quantified Equality Constraints.
  Twenty-Second Annual IEEE Symposium on Logic in Computer Science (LICS), 2007, Wroclaw, Poland.
  

• Hubie Chen and Victor Dalmau.
  Beyond Hypertree Width: Decomposition Methods Without Decompositions.
  Eleventh International Conference on Principles and Practice of Constraint Programming, 2005, Sitges, Spain.

Some talks

• What is a tractable class? Dagstuhl 2009.
  
• Arc Consistency and Friends. CanaDAM 2009, Montreal.
  
• Causal Graphs and Structurally Restricted Planning. ICAPS 2008, Sydney.
  
• Quantifying Chandra-Merlin. Logic and Algorithms, 2008, Edinburgh.
  
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. ICALP 2008, Reykjavik.
  

Quotes
Erdos-Bacon number
Proof that P does not equal NP
Links: Memorable Quotes from "It's My Turn", Papers with cute titles, The word processor is a stupid and grossly inefficient tool