Publications
“Boltzmann exploration done right”, Advances in Neural Information Processing Systems 30 (NIPS), 2017, pp. 6287–6296.
, “Boolean Formulas are Hard to Learn for most Gate Bases”, ALT, 1999, pp. 301-312.
, “Bounded Seed-AGI”, AGI 2014: Quebec City, QC, Canada, Springer Berlin/Heidelberg, 2014, pp. 85–96.
“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)
, 
“Branching and Pruning: An Optimal Temporal POCL Planner based on Constraint Programming”, Proceedings of 19th Nat. Conf. on Artificial Intelligence (AAAI-04), , AAAI Press/MIT Press, 2004, pp. 570-577.
Paper AIJ 2006 (291.11 KB)
, 
“Branching Matters: Alternative Branching in Graphplan”, Proc. $13^{th}$ Int. Conf. on Automated Planning and Scheduling (ICAPS-2003), , AAAI Press, 2003, pp. 22–31.
, “C3: Planning with consistent causal chains”, Int. Planning Competition Booklet (IPC-6), 2008.
, “Caterpillar Duality for Constraint Satisfaction Problems”, LICS, 2008, pp. 307-316.
, “A Causal Approach to Hierarchical Decomposition of Factored MDPs”, Proceedings of the 22nd International Conference on Machine Learning (ICML'05), 2005, pp. 401-408.
, “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.
, “Classical Planning Algorithms on the Atari Video Games”, Workshops at the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015.
, “Closure Functions and Width 1 Problems”, CP, 1999, pp. 159-173.
, “A Combinatorial Characterization of ResolutionWidth”, IEEE Conference on Computational Complexity, 2003, pp. 239-247.
, “Comparing Phase Transitions and Peak Cost in PP-Complete Satisfiability Problems”, AAAI/IAAI, 2002, pp. 620-626.
, “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)
, 
“Compiling Uncertainty Away: Solving Conformant Planning Problems using a Classical Planner (Sometimes)”, Proc. of AAAI-06, 2006.
, “Computing Plans with Control Flow and Procedures using a Classical Planner”, Proceedings of the 8th International Annual Symposium on Combinatorial Search (SoCS'15), 2015.
, “Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics”, CP, 2002, pp. 310-326.
, “Constraint Satisfaction Problems in Non-deterministic Logarithmic Space”, ICALP, 2002, pp. 414-425.
, “Constructing Hierarchical Task Models Using Invariance Analysis”, Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI'16), 2016.
, “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.
, “Datalog and Constraint Satisfaction with Infinite Templates”, STACS, 2006, pp. 646-659.
, “A Datalog Framework for Modeling Relationship-based Access Control Policies”, Proceedings of the 22nd ACM on Symposium on Access Control Models and Technologies, ACM, 2017, pp. 91–102.
, “A Decision Tree Approach for Imprecise Data”, Proceedings of the 11th Women in Machine Learning Workshop (WiML'16), 2016.
, “Deliberative Platform Design: The Case Study of the Online Discussions in Decidim Barcelona”, Social Informatics: 9th International Conference, SocInfo 2017, Oxford, UK, September 13-15, 2017, Proceedings, Part II, , Cham: Springer International Publishing, 2017, pp. 277–287.
,