Publications

Export 261 results:
Author Title Type [ Year(Asc)]
2006
Palacios, H., and Geffner, H., Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes), Proc. of AAAI-06, 2006.
Bodirsky, M., and Dalmau, V., Datalog and Constraint Satisfaction with Infinite Templates, STACS, 2006, pp. 646-659.
Dalmau, V., Generalized Majority-Minority Operations are Tractable, Logical Methods in Computer Science, vol. 2, 2006.
Ognibene, D., Mannella, F., Pezzulo, G., and Baldassarre, G., Integrating reinforcement-learning, accumulator models, and motor-primitives to study action selection and reaching in monkeys, Proceedings of the 7th International Conference on Cognitive Modelling-ICCM06, 2006, pp. 214–219.
Ognibene, D., Rega, A., and Baldassarre, G., A model of reaching that integrates reinforcement learning and population encoding of postures, From Animals to Animats 9: Proceedings of the Ninth International Conference on the Simulation of Adaptive Behavior (SAB2006), Springer Berlin/Heidelberg, 2006, pp. 381–393.
Albore, A., Alechina, N., Bertoli, P., Ghidini, C., Logan, B., and Serafini, L., Model-Cheching Memory Requirements Of Resource-Bounded Reasoners, Proc. of 21st National Conference on Artificial Intelligence (AAAI-06), Boston, Massachusetts: 2006. Paper AAAI (522.37 KB)
Albore, A., and Bertoli, P., Safe LTL Assumption-Based Planning, Proc. Int. Conf. on Automated Planning & Scheduling (ICAPS-06), Lake District, UK: 2006. Paper ICAPS (273.72 KB)
Bulatov, A. A., and Dalmau, V., A Simple Algorithm for Mal'tsev Constraints, SIAM J. Comput., vol. 36, 2006, pp. 16-27.
Rega, A., Ognibene, D., Gigliotta, O., and Baldassarre, G., Un sistema robotico occhio-braccio per lo studio dei processi neurali sottostanti a compiti di reaching costruito presso il LARAL, WIVA, 2006.
Albore, A., Beaudry, E., Bertoli, P., and Kabanza, F., Using a contingency planner within a robot architecture, Workshop on Planning, Learning and Monitoring with Uncertainty and Dynamic Domains (ECAI'06), 2006.
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