Publications

Export 261 results:
Author Title [ Type(Desc)] Year
Conference Paper
Nivel, E., Thórisson, K. R., Steunebrink, B. R., Dindo, H., Pezzulo, G., Rodrıguez, M., Hernández, C., Ognibene, D., Schmidhuber, J., Sanz, R., and , “Bounded Seed-AGI”, AGI 2014: Quebec City, QC, Canada, Springer Berlin/Heidelberg, 2014, pp. 85–96.
Albore, A., Alechina, N., Bertoli, P., Ghidini, C., and Logan, B., “Bounded-Resource Reasoning As (Strong Or Classical) Planning”, Ninth Workshop on Computational Logic in Multi-Agent System, Dreden, Germany: 2008. Paper CLIMA (2.15 MB)
Vidal, V., and Geffner, H., “Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming”, Proceedings of 19th Nat. Conf. on Artificial Intelligence (AAAI-04), D. McGuiness and Ferguson, G., AAAI Press/MIT Press, 2004, pp. 570-577. Paper AIJ 2006 (291.11 KB)
Hoffmann, J., and Geffner, H., “Branching Matters: Alternative Branching in Graphplan”, Proc. $13^{th}$ Int. Conf. on Automated Planning and Scheduling (ICAPS-2003), E. Giunchiglia, Muscettolla, N., and Nau, D., AAAI Press, 2003, pp. 22–31.
Lipovetzky, N., Ramírez, M., and Geffner, H., “C3: Planning with consistent causal chains”, Int. Planning Competition Booklet (IPC-6), 2008.
Carvalho, C., Dalmau, V., and Krokhin, A. A., “Caterpillar Duality for Constraint Satisfaction Problems”, LICS, 2008, pp. 307-316.
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.
Bonet, B., and Geffner, H., “Causal belief decomposition for planning with sensing: completeness results and practical approximation”, Proceedings of the Twenty-Third international joint conference on Artificial Intelligence, AAAI Press, 2013, pp. 2275–2281.
Lipovetzky, N., Ramírez, M., and Geffner, H., “Classical Planning Algorithms on the Atari Video Games”, Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.
Dalmau, V., and Pearson, J., “Closure Functions and Width 1 Problems”, CP, 1999, pp. 159-173.
Atserias, A., and Dalmau, V., “A Combinatorial Characterization of ResolutionWidth”, IEEE Conference on Computational Complexity, 2003, pp. 239-247.
Bailey, D. D., Dalmau, V., and Kolaitis, P. G., “Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems”, AAAI/IAAI, 2002, pp. 620-626.
Albore, A., Palacios, H., and Geffner, H., “Compiling Away Uncertainty in Non-Deterministic Conformant Planning Problems”, 19th European Conf. on Artificial Intelligence (ECAI-10), Lisbon, Portugal: 2010. Paper ECAI 2010 (145.87 KB)
Palacios, H., and Geffner, H., “Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)”, Proc. of AAAI-06, 2006.
Jiménez, S., and Jonsson, A., “Computing Plans with Control Flow and Procedures using a Classical Planner”, Proceedings of the 8th International Annual Symposium on Combinatorial Search (SoCS'15), 2015.
Dalmau, V., Kolaitis, P. G., and Vardi, M. Y., “Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics”, CP, 2002, pp. 310-326.
Dalmau, V., “Constraint Satisfaction Problems in Non-deterministic Logarithmic Space”, ICALP, 2002, pp. 414-425.
Lotinac, D., and Jonsson, A., “Constructing Hierarchical Task Models Using Invariance Analysis”, Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI'16), 2016.
Gómez, V., Azar, M. Gheshlaghi, and Kappen, H. J., “Correcting Multivariate Auto-Regressive Models for the Influence of Unobserved Common Input”, Artificial Intelligence Research and Development - Proceedings of the 19th International Conference of the Catalan Association for Artificial Intelligence, Barcelona, Catalonia, Spain, October 19-21, 2016, 2016, pp. 177–186.
Bodirsky, M., and Dalmau, V., “Datalog and Constraint Satisfaction with Infinite Templates”, STACS, 2006, pp. 646-659.
Nunes, C., Jonsson, A., Camara, O., and Bijnens, B., “A Decision Tree Approach for Imprecise Data”, Proceedings of the 11th Women in Machine Learning Workshop (WiML'16), 2016.
Bulatov, A. A., Dalmau, V., and Thurley, M., “Descriptive complexity of approximate counting CSPs”, CSL, 2013, pp. 149-164.
Dalmau, V., Egri, L., Hell, P., Larose, B., and Rafiey, A., “Descriptive Complexity of List H-coloring Problems in Logspace: a Refined Dichotomy”, Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015.
Dalmau, V., “A Dichotomy Theorem for Learning Quantified Boolean Formulas”, COLT, 1997, pp. 193-200.
Bodirsky, M., Dalmau, V., Martin, B., and Pinsker, M., “Distance Constraint Satisfaction Problems”, MFCS, 2010, pp. 162-173.

Pages