PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

EPrints submitted by Hubert Ming Chen

Click here to see user's record.

Number of EPrints submitted by this user: 18

A Coalgebraic Approach to Kleene Algebra with Tests
Hubert Ming Chen and Riccardo Pucella
Theoretical Computer Science Volume 327, Number 1-2, pp. 23-44, 2004.

Learnability of Relatively Quantified Generalized Formulas.
Andrei Bulatov, Hubert Ming Chen and Victor Dalmau
The 15th International Conference on Algorithmic Learning Theory (ALT) 2004.

(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability.
Hubert Ming Chen and Victor Dalmau
Tenth International Conference on Principles and Practice of Constraint Programming 2004.

Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms.
Hubert Ming Chen
Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. 2004.

Quantified Constraint Satisfaction and Bounded Treewidth.
Hubert Ming Chen
16th European Conference on Artificial Intelligence (ECAI) 2004.

Optimization, Games, and Quantified Constraint Satisfaction.
Hubert Ming Chen and Martin Pal
29th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2004.

Collapsibility and Consistency in Quantified Constraint Satisfaction.
Hubert Ming Chen
Nineteenth National Conference on Artificial Intelligence (AAAI) 2004.

Looking Algebraically at Tractable Quantified Boolean Formulas.
Hubert Ming Chen and Victor Dalmau
Seventh International Conference on Theory and Applications of Satisfiability Testing 2004.

The Expressive Rate of Constraints.
Hubert Ming Chen
Eighth International Symposium on Artificial Intelligence and Mathematics 2004.

Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms
Hubert Ming Chen
22nd International Symposium on Theoretical Aspects of Computer Science (STACS) 2005.

Parameterized Compilability
Hubert Ming Chen
Nineteenth International Joint Conference on Artificial Intelligence (IJCAI) 2005.

A Model for Generating Random Quantified Boolean Formulas
Hubert Ming Chen and Yannet Interian
Nineteenth International Joint Conference on Artificial Intelligence (IJCAI) 2005.

Periodic Constraint Satisfaction Problems: Tractable Subclasses
Hubert Ming Chen
Constraints Volume 10, Number 2, pp. 97-113, 2005.

The Expressive Rate of Constraints
Hubert Ming Chen
Annals of Mathematics and Artificial Intelligence Volume 44, Number 4, pp. 341-352, 2005.

From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction
Hubert Ming Chen and Victor Dalmau
Computer Science Logic (CSL) 2005.

Beyond Hypertree Width: Decomposition Methods Without Decompositions
Hubert Ming Chen and Victor Dalmau
Eleventh International Conference on Principles and Practice of Constraint Programming 2005.

Collapsibility in Infinite-Domain Quantified Constraint Satisfaction.
Hubert Ming Chen and Manuel Bodirsky
In: CSL 2006, Szeged, Hungary(2006).

Generic Expression Hardness Results for Primitive Positive Formula Comparison.
Simone Bova, Hubert Ming Chen and Matthew Valeriote
ICALP 2011 Volume ICALP 2011, 2011.