Publications

Export 261 results:
Author [ Title(Desc)] Type Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
B
Lipovetzky, N., and Geffner, H., Best-first Width Search: Exploration and Exploitation in Classical Planning, Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI'17), 2017.
Chen, H., and Dalmau, V., Beyond Hypertree Width: Decomposition Methods Without Decompositions, CP, 2005, pp. 167-181.
Dalmau, V., Boolean Formulas are Hard to Learn for most Gate Bases, ALT, 1999, pp. 301-312.
Nivel, E., Thórisson, K. R., Steunebrink, B. R., Dindo, H., Pezzulo, G., Rodriguez, M., Hernandez, C., Ognibene, D., Schmidhuber, J., Sanz, R., and , Bounded Recursive Self-Improvement, arXiv preprint arXiv:1312.6764, 2013.
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.
C
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.
Jonsson, A., and Barto, A., Causal Graph Based Decomposition of Factored MDPs, Journal of Machine Learning Research, vol. 7, 2006, pp. 2259-2301.
Carvalho, C., Dalmau, V., Markovic, P., and Maróti, M., CD(4) has bounded width, CoRR, vol. abs/0709.1934, 2007.
Carvalho, C., Dalmau, V., Markovic, P., and Maróti, M., CD(4) has bounded width, Algebra Universalis, vol. 60, 2009, pp. 293-307.
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.
Lipovetzky, N., Ramírez, M., and Geffner, H., Classical Planning with Simulators: Results on the Atari Video Games, Proc. IJCAI 2015, 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 resolution width, J. Comput. Syst. Sci., vol. 74, 2008, pp. 323-334.
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., Albore, A., and Geffner, H., Compiling contingent planning into classical planning: New translations and results, Models and Paradigms for Planning under Uncertainty: a Broad Perspective, 2014, p. 65.
Palacios, H., and Geffner, H., Compiling uncertainty away in conformant planning problems with bounded width, Journal of Artificial Intelligence Research, vol. 35, 2009, p. 623.
Palacios, H., and Geffner, H., Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes), Proc. of AAAI-06, 2006.

Pages