Browse by Person

2004

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 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.

2005

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)

2007

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.

15 November 2016

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