Publications

Export 261 results:
Author Title Type [ Year(Desc)]
2004
Dalmau, V., and Jonsson, P., The complexity of counting homomorphisms seen from the other side, Theor. Comput. Sci., vol. 329, 2004, pp. 315-323.
Klaus, J., Miesenberger, K., Zagler, W. L., and Burger, D., Computers Helping People with Special Needs, 9th International Conference, ICCHP 2004, Paris, France, July 7-9, 2004, Proceedings, Lecture Notes in Computer Science, vol. 3118, 2004.
Dalmau, V., Krokhin, A. A., and Larose, B., First-Order Definable Retraction Problems for Posets and Reflexive Graph, LICS, 2004, pp. 232-241.
Albore, A., and Bertoli, P., Generating Safe Assumption-Based Plans for Partially Observable, Nondeterministic Domains, Proceedings of the National Conference on Artificial Intelligence (AAAI), Palo Alto, USA: AAAI Press, 2004, pp. 495–500.
Bulatov, A. A., Chen, H., and Dalmau, V., Learnability of Relatively Quantified Generalized Formulas, ALT, 2004, pp. 365-379.
Martin, M., and Geffner, H., Learning Generalized Policies from Planning Examples Using Concept Languages, Appl. Intelligence, vol. 20, 2004, pp. 9–19.
Chen, H., and Dalmau, V., Looking Algebraically at Tractable Quantified Boolean Formulas, SAT, 2004, pp. 71-79.
Aguilera, S., Jiménez, S., Bolaños, D., Torre, M. - S., and Colás, J., A New Mobile Text Telephony System Based on GPRS Communications, Computers Helping People with Special Needs, 9th International Conference, {ICCHP} 2004, Paris, France, July 7-9, 2004, Proceedings, 2004, pp. 1160–1166.
Chen, H., and Dalmau, V., (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability, CP, 2004, pp. 182-196.
Campos, E., Granados, A., Jiménez, S., and Garrido, J., Tutor Informatico: Increasing the Selfteaching in Down Syndrome People, Computers Helping People with Special Needs, 9th International Conference, {ICCHP} 2004, Paris, France, July 7-9, 2004, Proceedings, 2004, pp. 202–205.
2005
Bonet, B., and Geffner, H., An algorithm better than AO*?, Proc. AAAI-05, 2005.
Chen, H., and Dalmau, V., Beyond Hypertree Width: Decomposition Methods Without Decompositions, CP, 2005, pp. 167-181.
Jonsson, A., and Barto, A., A Causal Approach to Hierarchical Decomposition of Factored MDPs, Proceedings of the 22nd International Conference on Machine Learning (ICML'05), 2005, pp. 401-408.
Jonsson, A., Johns, J., Mehranian, H., Arroyo, I., Woolf, B., Barto, A., Fisher, D., and Mahadevan, S., Evaluating the Feasibility of Learning Student Models from Data, Proceedings of the Workshop on Educational Data Mining at AAAI'05, 2005, pp. 1-6.
Chen, H., and Dalmau, V., From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction, CSL, 2005, pp. 232-247.
Pezzulo, G., Ognibene, D., Calvi, G., and Lalia, D., Fuzzy-based schema mechanisms in akira, null, IEEE, 2005, pp. 146–152.
Dalmau, V., Generalized Majority-Minority Operations are Tractable, LICS, 2005, pp. 438-447.
Bonet, B., and Geffner, H., Learning in DFS: A Unified Approach to Heuristic Search in Deterministic, Non-Deterministic, Probabilistic, and Game Tree Settings, Proc. Int. Conf. on Automated Planning & Scheduling (ICAPS-06), 2005.
Dalmau, V., Linear datalog and bounded path duality of relational structures, Logical Methods in Computer Science, vol. 1, 2005.
Gama, J., Camacho, R., Brazdil, P., Jorge, A., and Torgo, L., Machine Learning: ECML 2005, 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings, Lecture Notes in Computer Science, vol. 3720, 2005.
Jiménez, S., Fernández, F., and Borrajo, D., Machine Learning of Plan Robustness Knowledge About Instances, Machine Learning: {ECML} 2005, 16th European Conference on Machine Learning, Porto, Portugal, October 3-7, 2005, Proceedings, 2005, pp. 609–616.
Haslum, P., Bonet, B., and Geffner, H., New admissible heuristics for optimal planning, Proc. AAAI-05, 2005.
Dalmau, V., A new tractable class of constraint satisfaction problems, Ann. Math. Artif. Intell., vol. 44, 2005, pp. 61-85.
Palacios, H., Bonet, B., Darwiche, A., and Geffner, H., Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations, Proc. Int. Conf. on Automated Planning & Scheduling (ICAPS-05), 2005.
Vidal, V., and Geffner, H., Solving simple planning problems with more inference and no search, Proc. of the 11th Int. Conf. on Principles and Practice of Constraint Programming (CP-05), Springer, 2005.

Pages