Reading Group on Planning and Search: Archive

This page collects all papers read in the reading group since its inception. For further information on the reading group, please consult the main reading group page.

Papers

Date Topic Contact
2018-01-04
in Freiburg
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 10).
MIT Press, 1999.
Malte Helmert
2017-12-28 No meeting
2017-12-21
in Basel (!)
Hans L. Bodlaender.
A partial k-arboretum of graphs with bounded treewidth.
Theoretical Computer Science 209:1-45, 1998.
Malte Helmert
2017-12-14
in Basel
Hans L. Bodlaender.
A partial k-arboretum of graphs with bounded treewidth.
Theoretical Computer Science 209:1-45, 1998.
Malte Helmert
2017-12-07
in Freiburg
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 9).
MIT Press, 1999.
Malte Helmert
2017-11-30 No meeting
2017-11-23 Postponed
2017-11-16 No meeting
2017-11-09
in Freiburg
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 8).
MIT Press, 1999.
Malte Helmert
2017-11-02
in Basel
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 7).
MIT Press, 1999.
Malte Helmert
2017-10-26
in Freiburg
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 6).
MIT Press, 1999.
Florian Pommerening
2017-10-19 No meeting
2017-10-12
in Freiburg
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 5).
MIT Press, 1999.
Silvan Sievers
2017-10-05
in Basel
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapter 4).
MIT Press, 1999.
Florian Pommerening
2017-09-28
in Freiburg
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Chapters 2 and 3).
MIT Press, 1999.
Manuel Heusner
2017-09-21
in Basel
Edmund M. Clarke, Jr., Orna Grumberg and Doron A. Peled.
Model Checking (Front Matter and Chapter 1).
MIT Press, 1999.
Malte Helmert
2017-09-14
in Freiburg
Jörg Hoffmann.
Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks.
Journal of Artificial Intelligence Research 24:685-758, 2005. (PDF)
Manuel Heusner
2017-08-31
in Freiburg
Guillem Francès and Hector Geffner.
Modeling and Computation in Planning: Better Heuristics for More Expressive Languages.
In Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling (ICAPS 2015). (PDF)
Florian Geißer
2017-08-10
in Basel
Santiago Franco, Alvaro Torralba, Levi Lelis and Mike Barley.
On Creating Complementary Pattern Databases.
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017).
Silvan Sievers
2017-08-03
in Freiburg
Simon Stahlberg.
Tailoring Pattern Databases for Unsolvable Planning Instances.
In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 17). (PDF)
Gabriele Röger
2017-07-20
in Freiburg
Álvaro Torralba.
From Qualitative to Quantitative Dominance Pruning for Optimal Planning.
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 17). (PDF)
Silvan Sievers
2017-07-13
in Basel
Salomé Eriksson, Gabriele Röger, and Malte Helmert.
Unsolvability Certificates for Classical Planning.
In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017). (PDF)
Silvan Sievers
2017-07-06
in Freiburg
Gaojian Fan, Martin Müller, and Robert Holte.
Additive Merge-and-Shrink Heuristics for Diverse Action Costs.
In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), 2017. (PDF)
Silvan Sievers
2017-06-29
in Basel
Gaojian Fan, Martin Müller, and Robert Holte.
The Two-Edged Nature of Diverse Action Costs.
In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 2017. (PDF)
Silvan Sievers
2017-06-08
in Freiburg
Michael Katz, Nir Lipovetzky, Dany Moshkovic, and Alexander Tuisov.
Adapting Novelty to Classical Planning as Heuristic Search.
In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 2017. (PDF)
Silvan Sievers
2017-06-01
in Basel
Maximilian Fickert and Jörg Hoffmann.
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement.
In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 2017. (PDF)
Jendrik Seipp
2017-05-25 No meeting (Ascension Day)
2017-05-18
in Basel
Manuel Heusner, Thomas Keller and Malte Helmert.
Understanding the Search Behaviour of Greedy Best-First Search.
Proceedings of the Tenth International Symposium on Combinatorial Search (SoCS 2017), 2017. (PDF)
Manuel Heusner
2017-05-11
in Basel
Jingwei Chen, Robert C. Holte, Sandra Zilles and Nathan R. Sturtevant.
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions.
arXiv:1703.03868 [cs.AI], 2017. (PDF)
Malte Helmert
2017-05-05
in Basel
Jürgen Eckerle, Jingwei Chen, Nathan R. Sturtevant, Sandra Zilles and Robert Holte.
Sufficient Conditions for Node Expansion in Bidirectional Heuristic Search.
In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017), 2017.
Malte Helmert
2017-04-28 No meeting (Fast Downward sprint)
2017-04-21
in Basel
Marcel Steinmetz and Joerg Hoffmann.
State Space Search Nogood Learning: Online Refinement of Critical-Path Dead-End Detectors in Planning.
Artificial Intelligence 245:1-37, 2017.
Gabriele Röger
2017-04-07
in Basel
Silvan Sievers, Martin Wehrle, and Malte Helmert.
Generalized Label Reduction for Merge-and-Shrink Heuristics.
Journal paper draft.
Silvan Sievers
2017-03-31
in Freiburg
Felipe Trevizan, Sylvie Thiébaux and Patrik Haslum.
Occupation Measure Heuristics for Probabilistic Planning.
In Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling (ICAPS 2017). (PDF)
Florian Pommerening
2017-03-24 Meeting deferred to April 7th
2017-03-10
in Basel
Serdar Kadioglu and Meinolf Sellmann.
Dialectic Search.
Principles and Practice of Constraint Programming (CP 2009), 2009.
Jendrik Seipp
2017-03-03
in Freiburg
Jussi Rintanen.
Schematic Invariants by Reduction to Ground Invariants.
In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 2017. (PDF)
Gabriele Röger
2017-02-24
in Basel
Nir Lipovetzky and Hector Geffner.
Best-First Width Search: Exploration and Exploitation in Classical Planning.
In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 2017. (PDF)
Jendrik Seipp
2017-02-17
in Freiburg
Jendrik Seipp, Thomas Keller and Malte Helmert.
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 2017. (PDF)
Jendrik Seipp
2017-02-10 no meeting (AAAI 2017)
2017-02-03
in Freiburg
Jussi Rintanen.
Expressive Equivalence of Formalisms for Planning with Sensing.
In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling (ICAPS 2003). (PDF)
Florian Geißer
2017-01-27
in Basel
Lihong Li and Thomas J. Walsh and Michael L. Littman.
Towards a Unified Theory of State Abstraction for MDPs.
In Proceedings of the 9th International Symposium on Artificial Intelligence and Mathematics (ISAIM 2006). (PDF)
Florian Geißer
2017-01-20
in Freiburg
Andrey Kolobov, Mausam, Daniel S. Weld.
Discovering hidden structure in factored MDPs.
Artificial Intelligence Journal, Volume 189 (2012) 19-47.
Salomé Simon
2017-01-13 No meeting (not enough people)
2017-01-06
in Basel
Edmund Clarke, Orna Grumberg, Somesh Jha, Yuan Lu and Helmut Veith.
Counterexample-Guided Abstraction Refinement for Symbolic Model Checking.
Journal of the ACM 50:1(752-794), 2003.
Jendrik Seipp
2016-12-16
in Basel
Florian Pommerening, Malte Helmert and Blai Bonet.
Higher-Dimensional Potential Heuristics for Optimal Classical Planning.
In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), 2017. (PDF)
Florian Pommerening
2016-12-09
in Freiburg
Franc Ivankovic and Patrik Haslum.
Optimal Planning with Axioms.
In Proc. IJCAI 2015, pp. 1580-1586, 2015. (PDF)
Malte Helmert
2016-12-02 No meeting (Basel seminar)
2016-11-25 No meeting (Dies Academicus)
2016-11-18 No meeting (ICAPS deadline)
2016-11-11
in Freiburg
Christopher Wilt and Wheeler Ruml.
Effective Heuristics for Suboptimal Best-First Search.
JAIR 57:273-306, 2016. (PDF)
Malte Helmert
2016-11-04
in Basel
Matthias Heizmann, Jochen Hoenicke and Andreas Podelski.
Software Model Checking for People who Love Automata.
In Proceedings of the 25th International Conference on Computer Aided Verification (CAV 2013). (PDF)
Martin Wehrle
2016-10-28
in Freiburg
Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers and Martin Wehrle.
Heuristics and Symmetries in Classical Planning.
In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015). (PDF)
Gabriele Röger
2016-10-21
in Basel
Blai Bonet and Hector Geffner.
Action Selection for MDPs: Anytime AO* Versus UCT.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012). (PDF)
Thomas Keller
2016-10-14
in Freiburg
Martin Zinkevich, Michael Johanson, Michael Bowling and Carmelo Piccione.
Regret Minimization in Games with Incomplete Information.
In Proc. NIPS 2007. (PDF)
Malte Helmert
2016-10-07
in Basel
Toby Walsh.
The Singularity May Never Be Near.
In CoRR abs/1602.06462, 2016. (PDF)
Malte Helmert
2016-09-30
in Freiburg
Paul Beame, Henry Kautz and Ashish Sabharwal.
Towards Understanding and Harnessing the Potential of Clause Learning.
Journal of Artificial Intelligence Research 22:319-351, 2004. (PDF)
Salomé Eriksson
2016-09-23
Friday; in Basel
John Hooker.
Projection, Inference, and Consistency.
In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 4175-4179, 2016. (PDF)
Malte Helmert
2016-09-15
in Freiburg
Jendrik Seipp, Florian Pommerening and Malte Helmert.
New Optimization Functions for Potential Heuristics.
In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp.193-201, 2015. (PDF)
Thomas Keller
2016-09-08
in Freiburg
AI100 Standing Committee and Study Panel.
Artificial Intelligence and Life in 2030.
Stanford University. 2016. (paper)
Florian Pommerening
2016-09-01
in Basel
Malte Helmert.
Concise finite-domain representations for PDDL planning tasks.
Artificial Intelligence 173 (5-6), pp. 503-535, 2009. (PDF)
Silvan Sievers
2016-08-25
in Freiburg
Christian Muise, Vaishak Belle, Sheila A. McIlraith.
Computing Contingent Plans via Fully Observable Non-Deterministic Planning.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2322-2329, 2014. (PDF)
Florian Pommerening
2016-08-18 No meeting
2016-08-11
in Freiburg
Jeanette Daum, Álvaro Torralba, Jörg Hoffmann, Patrik Haslum, Ingo Weber.
Practical Undoability Checking via Contingent Planning.
In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016), 2016. (PDF)
Salomé Eriksson
2016-08-03
Wednesday 15:00 in Basel
Tadao Murata.
Petri Nets: Properties, Analysis and Applications.
In Proceedings of the IEEE Vol. 77, No. 4, 1989. (PDF)
Florian Pommerening
2016-07-28 Nir Lipovetzky, Christian Muise and Hector Geffner.
Traps, Invariants, and Dead-Ends.
In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016), 2016. (PDF)
Malte Helmert
2016-07-21 Álvaro Torralba, Carlos Linares López, Daniel Borrajo.
Abstraction Heuristics for Symbolic Bidirectional Search.
In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI 2016), 2016. (PDF)
Robert Mattmüller
2016-06-30 Jan Tožička, Jan Jakubův, Martin Svatoš and Antonín Komenda.
Recursive Polynomial Reductions for Classical Planning.
In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016), pp. 317-325, 2016. (PDF)
Malte Helmert
2016-06-23 no meeting
2016-06-16 no meeting (ICAPS)
2016-06-09 Masataro Asai and Alex Fukunaga.
Tiebreaking Strategies for A* Search: How to Explore the Final Frontier.
In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), pp. 673-679, 2016. (PDF)
Malte Helmert
2016-06-02
16:15 in Basel
Dimitri Klimenko, Hanna Kurniawati and Marcus Gallagher.
A Stochastic Process Model of Classical Search.
arXiv:1511.08574v1 [cs.AI], 2015. (PDF)
Manuel Heusner
2016-05-26
16:15 in Basel
Richard Valenzano and Fan Xie.
On the Completeness of Best-First Search Variants That Use Random Exploration.
In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), pp. 784-790, 2016. (PDF)
Malte Helmert
2016-05-19 no meeting
2016-05-12
16:15 in Basel
Geoff Gordon.
Linear Programming, Lagrange Multipliers, and Duality.
Tutorial. (PDF)
Florian Pommerening
2016-04-28 Tim Schmidt and Rong Zhou.
Representing Pattern Databases with Succinct Data Structures.
Proceedings of the Fourth International Symposium on Combinatorial Search (SoCS 2011), pp. 142-149, 2011. (PDF)
Malte Helmert
2016-04-21 Malte Helmert, Gabriele Röger and Silvan Sievers.
On the Expressive Power of Non-Linear Merge-and-Shrink Representations.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 106-114, 2015. (PDF)
Malte Helmert
2016-04-14 Adnan Darwiche and Pierre Marquis.
A Knowledge Compilation Map.
JAIR 17:229-264, 2002. (PDF)
Malte Helmert
2016-04-07
16:15 in Basel
Yexiang Xue, Arthur Choi and Adnan Darwiche.
Basing Decisions on Sentences in Decision Diagrams.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), pp. 842-849, 2012. (PDF)
Malte Helmert
2016-03-31
in Basel
Hubie Chen and Omer Gimenez.
Act Local, Think Global: Width Notions for Tractable Planning.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 73-80, 2007. (PDF)
Florian Pommerening
2016-03-24 no meeting
2016-03-17 no meeting
2016-03-10 Hootan Nakhost and Martin Müller.
A Theoretical Framework for Studying Random Walk Planning.
Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), pp. 57-64, 2012. (PDF)
Manuel Heusner
2016-03-03
in Basel
Robert C. Holte, Ariel Felner, Guni Sharon and Nathan R. Sturtevant.
Bidirectional Search That Is Guaranteed to Meet in the Middle.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), 2016. (PDF)
Malte Helmert
2016-02-25 David Silver et al.
Mastering the game of Go with deep neural networks and tree search.
Nature 529, pp. 484-489, 2016. (PDF)
Robert Mattmüller
2016-02-17 no meeting
2016-02-10 Marcel Steinmetz and Jörg Hoffmann.
Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence (AAAI 2016), 2016. (PDF)
Jendrik Seipp
2016-02-03 no meeting
2016-01-27 Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck.
A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks.
Proceedings of the Tenth International Symposium on Experimental Algorithms (SEA 2011), pp. 230-241, 2011. (PDF)
Florian Pommerening
2016-01-20 Chris Rayner, Michael Bowling and Nathan Sturtevant.
Euclidean Heuristic Optimization.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 81-86, 2011. (PDF)
Malte Helmert
2016-01-13 Ben Strasser, Adi Botea and Daniel Harabor.
Compressing Optimal Paths with Run Length Encoding.
Journal of Artificial Intelligence Research 54:593-629, 2015. (PDF)
Malte Helmert
2016-01-06
in Basel
Adi Botea.
Ultra-Fast Optimal Pathfinding without Runtime Search.
Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2011), pp. 122-127. (PDF)
Malte Helmert
2015-12-30 no meeting
2015-12-23 no meeting
2015-12-16 Toby Davies, Adrian Pearce, Peter Stuckey, and Harald Søndergaard.
Fragment-based planning using column generation.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 83-91. (PDF)
Florian Pommerening
2015-12-09 no meeting
2015-12-02 Yiming Wang, Austin Buchanan and Sergiy Butenko.
On imposing connectivity constraints in integer programs.
Preprint, 2015. (PDF)
Florian Pommerening
2015-11-25 Patrick Cousot and Radhia Cousot.
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints.
Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM 1977. (PDF)
Johannes Aldinger
2015-11-18 Gianfranco Ciardo and Radu Siminiceanu.
Using Edge-Valued Decision Diagrams for Symbolic Generation of Shortest Paths.
Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design. (PDF)
Florian Geißer
2015-11-11 S.R.K. Branavan, David Silver and Regina Barzilay.
Learning to Win by Reading Manuals in a Monte-Carlo Framework.
Journal of Artificial Intelligence Research 43:661-704, 2012. (PDF)
Thomas Keller
2015-11-04 David Churchill and Michael Buro.
Build Order Optimization in StarCraft.
Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE 2011). (PDF)
Silvan Sievers
2015-10-28 no meeting
2015-10-21 Akihiro Kishimoto, Alex Fukunaga and Adi Botea.
Evaluation of a simple, scalable, parallel best-first search strategy.
Artificial Intelligence 195:222-248, 2013.
Malte Helmert
2015-10-14 no meeting
2015-10-07 Holger Bast, Stefan Funke and Domagoj Matijevic.
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing.
9th DIMACS Implementation Challenge, 2006. (PDF)
Gabriele Röger
2015-09-30 André G. Pereira, Marcus Ritt and Luciana S. Buriol.
Optimal Sokoban solving using pattern databases with specific domain knowledge.
Artificial Intelligence 227:52-70, 2015.
Malte Helmert
2015-09-23 Florian Pommerening and Malte Helmert.
A Normal Form for Classical Planning Tasks.
In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). (PDF)
Florian Geißer
2015-09-16 Robert Geisberger, Peter Sanders, Dominik Schultes and Daniel Delling.
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.
7th Workshop on Experimental Algorithms (WEA 2008), Springer LNCS 5038, pp. 319-333. (PDF)
Florian Geißer
2015-09-09
16:30 in Basel
Doron Nussbaum, Alper Yörükçü.
Moving Target Search with Subgoal Graphs.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling (ICAPS 2015). (PDF)
Salomé Eriksson
2015-09-02 Nir Lipovetzky, Hector Geffner.
Width and Serialization of Classical Planning Problems.
Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012). (PDF)
Johannes Aldinger
2015-08-27 Nir Lipovetzky, Miquel Ramirez and Hector Geffner.
Classical Planning with Simulators: Results on the Atari Video Games.
Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF)
Florian Geißer
2015-08-20 Daniel Gnad, Jörg Hoffmann and Carmel Domshlak.
From Fork Decoupling to Star-Topology Decoupling.
TechReport. (PDF)
Martin Wehrle
2015-08-13 Randal E. Bryant.
Graph-Based Algorithms for Boolean Function Manipulation.
IEEE Transactions on Computers, Vol. C-35, No. 8 (1986).
Gabriele Röger
2015-08-06 Álvaro Torralba.
Chapter 2 of Symbolic Search and Abstraction Heuristics for Cost-Optimal Planning.
Universidad Carlos III de Madrid, PhD dissertation, June 2015.
Silvan Sievers
2015-07-30 Álvaro Torralba and Peter Kissmann.
Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink.
Proceedings of the 8th Annual Symposium on Combinatorial Search (SOCS 2015). (PDF)
Silvan Sievers
2015-07-23 Álvaro Torralba and Jörg Hoffmann.
Simulation-Based Admissible Dominance Pruning.
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF)
Gabriele Röger
2015-07-16 Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski and Roland Wessäly.
On Cut-Based Inequalities for Capacitated Network Design Polyhedra.
Networks 57(2):141-156, 2011.
Malte Helmert
2015-07-09 Florian Geißer, Thomas Keller and Robert Mattmüller.
Delete Relaxations for Planning with State-Dependent Action Costs.
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF)
Florian Geißer
2015-07-02
16:30 in Basel
Tomáš Balyo and Roman Bartak.
No One SATPlan Encoding To Rule Them All.
In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). (PDF)
Salomé Eriksson
2015-06-25 Christopher Wilt and Wheeler Ruml.
Building a Heuristic for Greedy Search.
In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). (PDF)
Malte Helmert
2015-06-18 Mauro Vallati, Frank Hutter, Lukáš Chrpa and Thomas L. McCluskey.
On the Effective Configuration of Planning Domain Models.
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). (PDF)
Frank Hutter
2015-06-11 no meeting (ICAPS)
2015-06-04
in Basel
Venkatraman Narayanan, Sandip Aine, Maxim Likhachev.
Improved Multi-Heuristic A* for Searching with Uncalibrated Heuristics.
In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). (PDF)
Gabriele Röger
2015-05-28 Sam Bayless, Noah Bayless, Holger H. Hoos and Alan J. Hu.
SAT Modulo Monotonic Theories.
In Proc. AAAI 2015. (PDF)
Malte Helmert
2015-05-21
13:30
Jussi Rintanen.
Planning as satisfiability: Heuristics.
Artificial Intelligence 193 (2012): 45-86. (PDF)
Florian Pommerening
2015-05-14 no meeting
2015-05-07 Toby O. Davies, Adrian R. Pearce, Peter J. Stuckey and Nir Lipovetzky.
Sequencing Operator Counts.
In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). To appear. (PDF)
Malte Helmert
2015-04-30 Daniel Gnad and Jörg Hoffmann.
Beating LM-cut with h^max (Sometimes): Fork-Decoupled State Space Search.
In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). To appear. (PDF)
Gabriele Röger
2015-04-23 Vidal Alcázar and Álvaro Torralba.
A Reminder about the Importance of Computing and Exploiting Invariants in Planning.
In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). To appear. (PDF)
Jendrik Seipp
2015-04-16 Peter E. Hart, Nils J. Nilsson and Bertram Raphael.
A Formal Basis for the Heuristic Determination of Minimum Cost Paths.
IEEE Transactions of Systems Science and Cybernetics 4(2):100-107, 1968.

Peter E. Hart, Nils J. Nilsson and Bertram Raphael.
Correction To "A Formal Basis for the Heuristic Determination of Minimum Cost Paths".
ACM SIGART Bulletin 37:28-29, 1972.
Malte Helmert
2015-04-09
16:15 in Basel
Fan Xie, Martin Müller and Robert Holte.
Understanding and Improving Local Exploration for GBFS.
In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015). to appear. (PDF)
Gabriele Röger
2015-04-02 no meeting
2015-03-26 Florian Pommerening, Malte Helmert, Gabriele Röger and Jendrik Seipp.
From Non-Negative to General Operator Cost Partitioning.
In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015). (PDF)
Florian Geißer
2015-03-19 Michael Bowling, Neil Burch, Michael Johanson and Oskari Tammelin.
Heads-up Limit Hold'em Poker is Solved.
Science (January 2015). (PDF)
Johannes Aldinger
2015-03-12 Lars Kotthoff.
Algorithm Selection for Combinatorial Search Problems: A Survey.
AI Magazine 2014. (PDF)
Marius Lindauer
2015-02-26 Robert P. Goldman and Ugur Kuter.
Measuring Plan Diversity: Pathologies in Existing Approaches and a New Plan Distance Metric.
In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI 2015). (PDF)
Gabriele Röger
2015-02-12
16:15 in Basel
Giuseppe De Giacomo, Riccardo De Masellis and Marco Montalli.
Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014). (PDF)
Johannes Aldinger
2015-01-22 John N. Hooker.
Decision Diagrams and Dynamic Programming.
In Proceedings of the Tenth International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2013), pp. 94-110, 2013. (PDF)
Malte Helmert
2015-01-15 Carlos Ansótegui, Maria Luisa Bonet and Jordi Levy.
A New Algorithm for Weighted Partial MaxSAT.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 3-8, AAAI Press 2010. (PDF)
Johannes Aldinger
2014-12-17
16:15 in Basel
Donald E. Knuth.
A Generalization of Dijkstra’s Algorithm.
Information Processing Letters Vol. 6, No. 1, 1977, pp. 1-5.

Alan J. Perlis.
Epigrams on Programming.
SIGPLAN Notices, Vol. 17, No. 9, 1982, pp. 7-13.
Gabriele Röger
2014-12-10 no meeting
2014-12-03 Thomas Keller and Florian Geißer.
Better Be Lucky Than Good: Exceeding Expectations in MDP Evaluation..
In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015). To appear. (PDF)
Robert Mattmüller
2014-11-26 Rina Dechter.
Constraint Processing (Chapter 6).
Morgan Kaufmann, 2003.
Gabriele Röger
2014-11-19 no meeting
2014-11-12 no meeting
2014-11-05 Rina Dechter.
Constraint Processing (Chapter 5).
Morgan Kaufmann, 2003.
Gabriele Röger
2014-10-29 Rina Dechter.
Constraint Processing (Chapter 4).
Morgan Kaufmann, 2003.
Florian Pommerening
2014-10-08 Rina Dechter.
Constraint Processing (Chapter 3).
Morgan Kaufmann, 2003.
Florian Pommerening
2014-10-01 Rina Dechter.
Constraint Processing (Chapters 1 and 2).
Morgan Kaufmann, 2003.
Gabriele Röger
2014-09-24 Christer Bäckström.
Parameterising the Complexity of Planning by the Number of Paths in the Domain-transition Graphs.
Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), pp. 33-38, 2014. (PDF)
Malte Helmert
2014-09-17
in Basel
John Slaney.
Set-theoretic duality: A fundamental feature of combinatorial optimisation.
Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), pp. 843-848, 2014. (PDF)
Gabriele Röger
2014-09-10 Christopher Wilt and Wheeler Ruml.
Speedy versus Greedy Search.
In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014), 2014. (PDF)
Malte Helmert
2014-09-03 Jussi Rintanen and Charles Orgill Gretton.
Computing Upper Bounds on Lengths of Transition Sequences.
In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2013), 2013. (PDF)
Jendrik Seipp
2014-08-27 Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, and Maxim Likhachev.
Multi-Heuristic A*.
In Proceedings of Robotics: Science and Systems (RSS 2014), 2014. (PDF)
Gabriele Röger
2014-08-13 Mehdi Samadi, Maryam Siabani, Ariel Felner and Robert Holte.
Compressing Pattern Databases with Learning.
In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI'08), Patras, Greece, 2008. (PDF)
Jendrik Seipp
2014-08-05
16:00 in Basel
J. Hoffmann, P. Kissmann, and A. Torralba.
`Distance'? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability.
Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), Prague, Czech Republic, August 2010. (PDF)
Silvan Sievers
2014-07-29 Tatsuya Imai and Alex Fukunaga.
A Practical, Integer-Linear Programming Model for the Delete-Relaxation in Cost-Optimal Planning.
In Proceedings of the 6th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2014), pp. 71-79, 2014. (PDF)
Florian Pommerening
2014-07-22 Vitaly Mirkis and Carmel Domshlak.
Landmarks in Oversubscription Planning.
In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), 2014, to appear. (PDF)
Gabriele Röger
2014-07-15 Gaojian Fan, Martin Müller and Robert Holte.
Non-Linear Merging Strategies for Merge-and-Shrink Based on Variable Interactions.
In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014), 2014, to appear. (PDF)
Silvan Sievers
2014-07-08 Sergiy Bogomolov, Daniele Magazzeni, Andreas Podelski and Martin Wehrle.
Planning as Model Checking in Hybrid Domains.
In Proceedings of the Twenty-Eigth AAAI Conference on Artificial Intelligence (AAAI 2014), 2014, to appear. (PDF)
Johannes Aldinger
2014-07-01 no meeting (ICAPS)
2014-06-24 no meeting (ICAPS)
2014-06-17
16:00 in Basel
Joao Marques-Silva, Ines Lynce and Sharad Malik.
Conflict-Driven Clause Learning SAT Solvers.
Handbook of Satisfiability, IOS Press, 2009, 131-153.
Salomé Eriksson
2014-06-10 Hector J. Levesque.
On our best behaviour.
Artificial Intelligence 2014. To appear.

Uri Alon.
How To Choose a Good Scientific Problem.
Molecular Cell 35:726-728, 2009.
Malte Helmert
2014-06-03 Martin Suda.
Property Directed Reachability for Automated Planning.
Journal of Artificial Intelligence Research, 2014. To appear.
Malte Helmert
2014-05-27 Lei Zhang, Chong-Jun Wang and Jun-Yuan Xie.
Cost optimal planning with LP-based multi-valued landmark heuristic.
In Proceedings of the 2014 International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS 2014), 2014. (PDF)
Florian Pommerening
2014-05-20
16:00 in Basel
Avitan Gefen and Ronen Brafman.
Pruning Methods For Optimal Delete-free Planning Using Domination-Free Reachability.
In Proceedings of the 5th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2013), pp. 69-77, 2013. (PDF)
Johannes Aldinger
2014-05-13 Matthew Hatem and Wheeler Ruml.
External Memory Best-First Search for Multiple Sequence Alignment.
In Proceedings of the Twenty-Seventh Conference on Artificial Intelligence (AAAI-2013). 2013. (PDF)
Florian Pommerening
2014-05-06
14:30 in Basel
Richard Valenzano, Nathan R. Sturtevant, Jonathan Schaeffer and Fan Xie.
A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014, to appear. (PDF)
Jendrik Seipp
2014-04-29 Fan Xie, Martin Müller and Robert Holte.
Adding Local Exploration to Greedy Best-First Search in Satisficing Planning.
In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI 2014), 2014, to appear. (PDF)
Malte Helmert
2014-04-22 no meeting (Easter break)
2014-04-15 Fan Xie, Martin Müller, Robert Holte and Tatsuya Imai.
Type-based Exploration with Multiple Search Queues for Satisficing Planning.
In Proceedings of the Twenty-Eigth AAAI Conference on Artificial Intelligence (AAAI 2014), 2014, to appear. (PDF)
Jendrik Seipp
2014-04-08 Simone Santini.
We Are Sorry to Inform You....
Computer 38(12):126-128, 2005.

Leslie Lamport.
Euclid Writes an Algorithm: A Fairytale.
In Festschrift celebrating the 60th birthday of Manfred Broy, 2011. (PDF)
Malte Helmert
2014-04-01 Blai Bonet and Menkes van den Briel.
Flow-based Heuristics for Optimal Planning: Landmarks and Merges.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014, to appear. (PDF)
Johannes Aldinger
2014-03-25
14:30 in Basel
Vidal Alcazar, Daniel Borrajo, Susana Fernández and Raquel Fuentetaja.
Revisiting Regression in Planning.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), 2013. (PDF)
Johannes Aldinger
2014-03-18 Vidal Alcázar, Susana Fernández and Daniel Borrajo.
Analyzing the Impact of Partial States on Duplicate Detection and Collision of Frontiers.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014. (PDF)
Malte Helmert
2014-03-11 Ken L. McMillan.
Interpolation and SAT-Based Model Checking.
In Proceedings of the 15th International Conference on Computer Aided Verification (CAV 2003), pp. 1-13, Springer-Verlag 2003. (PDF)
Malte Helmert
2014-03-05 no meeting
2014-03-04 Knot Pipatsrisawat and Adnan Darwiche.
A Lower Bound on the Size of Decomposable Negation Normal Form.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 345-350, AAAI Press 2010. (PDF)
Johannes Aldinger
2014-02-25 Menkes van den Briel, J. Benton, Subbarao Kambhampati and Thomas Vossen.
An LP-Based Heuristic for Optimal Planning.
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP-2007), pp. 651-665, 2007. (PDF)
Gabriele Röger
2014-02-18
14:30 in Basel
Husain Aljazzar and Stefan Leue.
K*: Heuristics-Guided, On-the-Fly k Shortest Paths Search.
In Preproceedings of 6th Workshop on Model Checking and Artificial Intelligence, held at AAAI 2010, Atlanta. (PDF)
Malte Helmert
2014-02-12 Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet.
LP-based Heuristics for Cost-optimal Planning.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014, to appear.
Florian Pommerening
2014-02-05 Chris Fawcett, Mauro Vallati, Frank Hutter, Jörg Hoffmann, Holger H. Hoos and Kevin Leyton-Brown.
Improved Features for Runtime Prediction of Domain-Independent Planners.
In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), 2014, to appear.
Frank Hutter
2014-02-05 no meeting
2014-01-29 Mehdi Sadeqi, Robert C. Holte and Sandra Zilles.
Using Coarse State Space Abstractions to Detect Mutex Pairs.
In Proceedings of the Tenth Symposium on Abstraction, Reformulation, and Approximation (SARA 2013), pp. 104-111, 2013. (PDF)
Malte Helmert
2014-01-29 no meeting
2014-01-22 Roni Stern, Tamar Kulberis, Ariel Felner and Robert Holte.
Using Lookaheads with Optimal Best-First Search.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 185-190, AAAI Press 2010. (PDF)
Moritz Göbelbecker
2014-01-15 no meeting
2014-01-08 no meeting (Christmas break)
2014-01-08 no meeting
2014-01-01 no meeting (Christmas break)
2013-12-25 no meeting (Christmas break)
2013-12-18 Barry O'Sullivan.
Automated Modelling and Solving in Constraint Programming.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 1493-1497, AAAI Press 2010. (PDF)
Johannes Aldinger
2013-12-11 Dan Klein and Christopher D. Manning.
A* Parsing: Fast Exact Viterbi Parse Selection.
In Proceedings of Human Language Technologies (HLT-NAACL 2003). (PDF)
Gabriele Röger
2013-12-03
Di, 15:00
Matteo Gagliolo and Jürgen Schmidhuber.
Dynamic Algorithm Portfolios.
In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics (AI&MATH 2006). (PDF)
Robert Mattmüller
2013-11-25
Mo, 15:00
Matthew Streeter and Stephen F. Smith.
New Techniques for Algorithm Portfolio Design.
In Proceedings of the 24th Conference on Uncertainty in Artificial Intelligence (UAI 2008). (PDF)
Johannes Aldinger
2013-11-20 Christian Muise, Sheila A. McIlraith, and J. Christopher Beck.
Improved Non-deterministic Planning by Exploiting State Relevance.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). (PDF)
Robert Mattmüller
2013-11-13 Carmel Domshlak, Michael Katz, Sagi Lefler.
Landmark-enhanced abstraction heuristics.
Artificial Intelligence 189:48-68.
Gabriele Röger
2013-11-06 no meeting (ICAPS deadline)
2013-10-30 Letao Wang, Jorge A. Baier, Sheila A. McIlraith.
Viewing Landmarks as Temporally Extended Goals.
In Proceedings of the ICAPS Workshop on Heuristics for Domain Independent Planning (HDIP 2009). (PDF)
Gabriele Röger
2013-10-23 Álvaro Torralba, Carlos Linares López, Daniel Borrajo.
Symbolic Merge-and-Shrink for Cost-Optimal Planning.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). (PDF)
Gabriele Röger
2013-10-16 Hootan Nakhost and Martin Müller.
Towards a second generation random walk planner: an experimental exploration.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). (PDF)
Johannes Aldinger
2013-10-09 Patrik Haslum.
Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). (PDF)
Gabriele Röger
2013-10-02 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 9.1-9.3 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-09-25 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 8.1-8.3 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-09-18 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 7.5-7.7 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-09-11 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Repetition: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-09-04 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 7.3-7.4 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-08-28 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 7.1-7.2 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-08-21 Blai Bonet.
An Admissible Heuristic for SAS+ Planning Obtained from the State Equation.
In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013). (PDF)
Robert Mattmüller
2013-08-14 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Section 6.7 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-08-07 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 6.5-6.6 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-07-31 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 6.3-6.4 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-07-24 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 6.1-6.2 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-07-17 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 5.5-5.6 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-07-10 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 5.3-5.4 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Robert Mattmüller
2013-06-26 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 5.1-5.2 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Gabriele Röger
2013-06-18 Christopher Wilt and Wheeler Ruml.
Robust Bidirectional Search via Heuristic Improvement.
In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2013), to appear. (PDF)
Malte Helmert
2013-06-11 no meeting (ICAPS)
2013-06-04 Patrik Haslum.
Heuristics for Bounded-Cost Search.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), to appear. (PDF)
Malte Helmert
2013-05-28 Thomas Keller and Malte Helmert.
Trial-based Heuristic Tree Search for Finite Horizon MDPs.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), to appear. (PDF)
Johannes Aldinger
2013-05-21 Michael Katz, Jörg Hoffmann and Carmel Domshlak.
Who Said we Need to Relax All Variables?.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), to appear. (PDF)
Thomas Keller
2013-05-14 Martin Wehrle, Malte Helmert, Yusra Alkhazraji and Robert Mattmüller.
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), to appear. (PDF)

David Leo Wright Hall, Alon Cohen, David Burkett and Dan Klein.
Faster Optimal Planning with Partial-Order Pruning.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), to appear. (PDF)
Gabriele Röger
2013-05-07 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 4.6-4.9 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-04-30 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 4.1-4.5 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-04-23 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 3.4-3.5 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-04-16 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 3.1-3.3 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-04-09 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 2.5-2.7 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-04-02 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Sections 2.1-2.4 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-03-26 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Preface and Chapter 1 of: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994.
Malte Helmert
2013-03-19 David C. Uthus, Patricia J. Riddle and Hans W. Guesgen.
Solving the traveling tournament problem with iterative-deepening A*.
Journal of Scheduling 15(5):601-614, 2012.
Malte Helmert
2013-03-12 Emil Keyder and Hector Geffner.
Trees of Shortest Paths vs. Steiner Trees: Understanding and Improving Delete Relaxation Heuristics.
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1734-1739, 2009. (PDF)
Malte Helmert
2013-03-05 Emil Keyder and Hector Geffner.
Heuristics for Planning with Action Costs Revisited.
In ECAI 2008 - 18th European Conference on Artificial Intelligence, IOS Press. (PDF)
Thomas Keller
2013-02-26 Patrik Haslum and Hector Geffner.
Admissible Heuristics for Optimal Planning.
In Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS 2000), AAAI Press 2000. (PS)
Thomas Keller
2013-02-19 Ronen I. Brafman and Carmel Domshlak.
Factored Planning: How, When, and When Not.
In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), AAAI Press 2006. (PDF)
Gabriele Röger
2013-02-12 Peter Auer and Nicolo Cesa-Bianchi and Paul Fischer.
Finite-time Analysis of the Multiarmed Bandit Problem.
Journal of Machine Learning 47:235-256, 2002. (PDF)
Thomas Keller
2013-02-05 Jacques Desrosiers and Marco E. Lübbecke.
A Primer in Column Generation.
In Column Generation, pp. 1-32, Springer, 2005.
Malte Helmert
2013-01-22 Thomas S. Ferguson.
Linear Programming: A Concise Introduction.
UCLA, unpublished document available online, Chapters 6-8. (PDF)
Malte Helmert
2013-01-15 Thomas S. Ferguson.
Linear Programming: A Concise Introduction.
UCLA, unpublished document available online, Chapters 1-5. (PDF)
Malte Helmert
2013-01-08 Héctor Palacios, Hector Geffner.
From Conformant into Classical Planning: Efficient Translations that May Be Complete Too.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 264-271, AAAI Press 2007. (PDF)
Moritz Göbelbecker
2012-12-18 Amanda Coles, Andrew Coles, Maria Fox, Derek Long.
Forward-Chaining Partial-Order Planning.
In Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 42-49, AAAI Press 2010. (PDF)
Patrick Eyerich
2012-12-11 Andrey Kolobov, Mausam, Dan Weld.
SixthSense: Fast and Reliable Recognition of Dead Ends in MDPs.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 1108-1114, AAAI Press 2010. (PDF)
Malte Helmert
2012-12-04 Adnan Darwiche.
SDD: A New Canonical Representation of Propositional Knowledge Bases.
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 819-826, 2011. (PDF)
Malte Helmert
2012-11-27 Ariel Felner, Richard E. Korf and Sarit Hanan.
Additive Pattern Database Heuristics.
Journal of Artificial Intelligence Research, 22:279-318, 2004. (PDF)
Gabriele Röger
2012-11-20 Blai Bonet and Malte Helmert.
Strengthening Landmark Heuristics via Hitting Sets.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 329-334, 2010. (PDF)
Malte Helmert
2012-11-13 Lei Zhang and Fahiem Bacchus.
MAXSAT Heuristics for Cost Optimal Planning.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), 2012. (PDF)
Florian Pommerening
2012-11-06 Stuart J. Russell.
Efficient Memory-Bounded Search Methods.
In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 1992), pp. 1-5, 1992.
Malte Helmert
2012-10-30 Jürgen Eckerle.
Chapters 4 and 5 of: Heuristische Suche unter Speicherbeschränkungen.
Ph.D. thesis, Albert-Ludwigs-Universität Freiburg, 1997.
Malte Helmert
2012-10-23 Ariel Felner, Meir Goldenberg, Guni Sharon, Roni Stern, Tal Beja, Nathan Sturtevant, Jonathan Schaeffer and Robert C. Holte.
Partial-Expansion A* with Selective Node Generation.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), pp. 471-477, 2012. (PDF)
Malte Helmert
2012-10-16 Guy Gueta, Cormac Flanagan, Eran Yahav and Mooly Sagiv.
Cartesian Partial-Order Reduction.
In Proceedings of the 14th International SPIN Workshop (SPIN 2007), pp. 95-112, 2007. (PDF)
Malte Helmert
2012-10-09 Blai Bonet and Hector Geffner.
Action Selection for MDPs: Anytime AO* Versus UCT.
In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012). (PDF)
Patrick Eyerich
2012-10-02 Felipe Trevizan and Manuela Veloso.
Short-Sighted Stochastic Shortest Path Problems.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012). (PDF)
Johannes Aldinger
2012-09-25 Karem A. Sakallah and João Marques-Silva.
Anatomy and Empirical Evaluation of Modern SAT Solvers.
Bulletin of the EATCS 103:96-121, 2011.
Malte Helmert
2012-09-18 Giovanni Manzini.
BIDA*: an improved perimeter search algorithm.
Artificial Intelligence 75:347-360, 1995.
Malte Helmert
2012-09-13 Hermann Kaindl and Gerhard Kainz.
Bidirectional Heuristic Search Reconsidered.
Journal of Artificial Intelligence Research (JAIR) 7:283-317, 1997. (PDF)
Malte Helmert
2012-09-06 Levi H. S. Lelis, Sandra Zilles and Robert C. Holte.
Fast and Accurate Predictions of IDA*'s Performance.
In Proceedings of the Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI 2012), pp. 514-520, AAAI Press 2012. (PDF)
Malte Helmert
2012-08-30 no meeting (ECAI 2012)
2012-08-23 Hootan Nakhost and Martin Müller.
A Theoretical Framework for Studying Random Walk Planning.
In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), pp. 57-64, AAAI Press 2012. (PDF)
Malte Helmert
2012-08-16 Blai Bonet.
Deterministic POMDPs Revisited.
In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI 2009), pp. 59-66, 2009. (PDF)
Gabriele Röger
2012-08-09 Ethan Burns, Matthew Hatem, Michael J. Leighton and Wheeler Ruml.
Implementing Fast Heuristic Search Code.
In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), pp. 25-32, AAAI Press 2012. (PDF)
Malte Helmert
2012-08-02 Jordan Thayer, Roni Stern, and Levi Lelis.
Are We There Yet? -- Estimating Search Progress.
In Proceedings of the 5th Annual Symposium on Combinatorial Search (SoCS 2012), AAAI Press 2012. (PDF)
Robert Mattmüller
2012-07-26 Emil Keyder, Silvia Richter, and Malte Helmert.
Sound and Complete Landmarks for And/Or Graphs.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 335-340, IOS Press 2010. (PDF)
Robert Mattmüller
2012-07-19 Avitan Gefen and Ronen I. Brafman.
Pruning Methods for Optimal Delete-Free Planning.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling.
Martin Wehrle
2012-07-12 Erez Karpas and Carmel Domshlak.
Optimal Search with Inadmissible Heuristics.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling. (PDF)
Thomas Keller
2012-07-05 Agostino Dovier, Carla Piazza and Alberto Policriti.
An efficient algorithm for computing bisimulation equivalence.
Theoretical Computer Science 311:221-256, 2004.
Malte Helmert
2012-06-21 Peter Gregory, Derek Long, Maria Fox, J. Christopher Beck.
Planning Modulo Theories: Extending the Planning Paradigm.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (to appear). (PDF)
Gabriele Röger
2012-06-14 Neil Burch and Robert Holte.
Automatic Move Pruning Revisited.
In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), 2012. (PDF)

Raz Nissim, Udi Apsel and Ronen Brafman.
Tunneling and Decomposition-Based State Reduction for Optimal Planning.
In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), 2012. (PDF)
Malte Helmert
2012-05-31 Martin Davis, George Logemann and Donald Loveland.
A Machine Program for Theorem-Proving.
Communications of the ACM 5(7):394-397, 1962.
Malte Helmert
2012-05-24 Niklas Eén and Niklas Sörensson.
An Extensible SAT-solver.
In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), 2003 (extended version). (PDF)
Malte Helmert
2012-05-17 no meeting (Ascension Day)
2012-05-10 Patrik Haslum.
Narrative Planning: Compilations to Classical Planning.
Journal of Artificial Intelligence Research, 2012. Accepted for publication. (PDF)

Mark O. Riedl and R. Michael Young.
Narrative Planning: Balancing Plot and Character.
Journal of Artificial Intelligence Research 39:217-268, 2010. (PDF)
Malte Helmert
2012-05-03 Alfonso Gerevini, Ugur Kuter, Dana S. Nau, Alessandro Saetti and Nathaniel Waisbrot.
Combining Domain-Independent Planning and HTN Planning: The Duet Planner.
In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 573-577, IOS Press 2008. (PDF)
Robert Mattmüller
2012-04-26 Richard M. Wilson.
Graph Puzzles, Homotopy, and the Alternating Group.
Journal of Combinatorial Theory, Series B, 16:86-96, 1974.
Malte Helmert
2012-04-19 Ryan Luna and Kostas E. Bekris.
Push and Swap: Fast Cooperative Path-Finding with Completeness Guarantees.
In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 294-300, 2011. (PDF)

Ryan Luna and Kostas E. Bekris.
Efficient and complete centralized multi-robot path planning.
In Proceedings of the 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2011), pp. 3268-3275, 2011. (PDF)
Malte Helmert
2012-04-12 Krishnendu Chatterjee, Thomas A. Henzinger, Ranjit Jhala, and Rupak Majumdar.
Counterexample-guided Planning.
In Proceedings of the 21st International Conference on Uncertainty in Artificial Intelligence (UAI 2005), pp. 104-111. (PDF)
Robert Mattmüller
2012-04-05 Patrik Haslum.
Incremental Lower Bounds for Additive Cost Planning Problems.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), to appear.
Robert Mattmüller
2012-03-29 Patrik Haslum, John Slaney and Sylvie Thiébaux.
Minimal Landmarks for Optimal Delete-Free Planning.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), to appear. (PDF)
Malte Helmert
2012-03-22 Emil Keyder, Jörg Hoffmann and Patrik Haslum.
Semi-Relaxed Plan Heuristics.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), to appear. (PDF)
Malte Helmert
2012-03-15 Reuven Bar-Yehuda.
One for the Price of Two: A Unified Approach for Approximating Covering Problems.
In Proceedings of the 1st International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 1998), pp. 49-62.
Malte Helmert
2012-03-08 Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevini, Subbarao Kambhampati, Minh Binh Do, Ivan Serina.
Domain Independent Approaches for Finding Diverse Plans.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2016-2022. (PDF)
Gabriele Röger
2012-03-01 H. Brendan Mcmahan and Maxim Likhachev and Geoffrey J. Gordon.
Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees.
In Proceedings of the 22nd International Conference on Machine Learning (ICML 2005), pp. 569-576. (PDF)
Thomas Keller
2012-02-23 Blai Bonet and Héctor Geffner.
Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming.
In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS 2003), pp. 12-31. (PDF)
Thomas Keller
2012-01-24

16.02.2012
Andrew Barto, Steven Bradtke and Satinder Singh.
Learning to act using real-time dynamic programming.
Artificial Intelligence 76(1-2):35-74, 1995. (PDF)
Thomas Keller
2012-01-18 Blai Bonet and Héctor Geffner.
Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and its application to MDPs.
In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS 2006), pp. 42-51. (PDF)
Malte Helmert
2012-01-11 Larry A. Taylor and Richard E. Korf.
Pruning Duplicate Nodes in Depth-First Search.
In Proceedings of the 11th National Conference on Artificial Intelligence (AAAI 1993), pp. 756-761, 1993.

Larry A. Taylor.
Pruning Duplicate Nodes in Depth-First Search.
Technical Report CSD-920049, University of California, Los Angeles, USA, 1992.

Neil Burch and Robert C. Holte.
Automatic Move Pruning in General Single-Player Games.
In Proceedings of the Fourth International Symposium on Combinatorial Search (SoCS 2011), pp. 31-38, 2011.
Malte Helmert
2012-01-03 no meeting (Christmas break)
2011-12-27 no meeting (Christmas break)
2011-12-20 Antti Valmari and Henri Hansen.
Can Stubborn Sets Be Optimal?.
In Proceedings of the 31st International Conference on Applications and Theory of Petri Nets (PETRI NETS 2010), pp. 43-62.
Malte Helmert
2011-12-13 no meeting (ICAPS deadline)
2011-12-06 Jaco Geldenhuys, Henri Hansen and Antti Valmari.
Exploring the Scope for Partial Order Reduction.
In Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis (ATVA 2009), pp. 39-53. (PDF)
Malte Helmert
2011-11-29 Doron Peled.
All from One, One for All: on Model Checking Using Representatives.
In Proceedings of the 5th International Conference on Computer Aided Verification (CAV 1993), pp. 409-423. (PDF)
Malte Helmert
2011-11-22 Tommi Junttila and Petteri Kaski.
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs.
In Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX 2007). (PDF)
Robert Mattmüller
2011-11-15 Nir Pochter, Aviv Zohar and Jeffrey S. Rosenschein.
Exploiting Problem Symmetries in State-Based Planners.
In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 1004-1009, AAAI Press 2011. (PDF)
Malte Helmert
2011-11-08 Nir Lipovetzky and Hector Geffner.
Searching for Plans with Carefully Designed Probes.
In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS 2011), pp. 154-161, 2011. (PDF)
Moritz Göbelbecker
2011-11-02 Carla P. Gomes, Bart Selman, Nuno Crato and Henry Kautz.
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems.
Journal of Automated Reasoning 24:67-100, 2000. (PDF)

Carla P. Gomes, Bart Selman and Henry Kautz.
Boosting Combinatorial Search Through Randomization.
In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI 1998), pp. 431-437, 1998. (PDF)
Malte Helmert
2011-10-19

25.10.2011
Alfonso Gerevini, Alessandro Saetti and Ivan Serina.
An Approach to Efficient Planning with Numerical Fluents and Multi-Criteria Plan Quality.
Artificial Intelligence 172(8-9):899-944, 2008. (PDF)
Malte Helmert
2011-10-11 Karthekeyan Chandrasekaran, Richard Karp, Erick Moreno-Centeno and Santosh Vempala.
Algorithms for Implicit Hitting Set Problems.
Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 614-629.
Malte Helmert
2011-10-04 no meeting (KI conference)
2011-09-27 Saddek Bensalem, Yassine Lakhnech and Hassen Saïdi.
Powerful Techniques for the Automatic Generation of Invariants.
In Proceedings of the 8th International Conference on Computer Aided Verification (CAV 1996), pp. 323-335, 1996. (PDF)
Malte Helmert
2011-09-21 Jussi Rintanen.
Regression for Classical and Nondeterministic Planning.
In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 568-572, 2008. (PDF)

Jussi Rintanen.
A Planning Algorithm not based on Directional Search.
In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR 1998), pp. 617-624, 1998. (PDF)
Malte Helmert
2011-09-13 no meeting (AVACS evaluation)
2011-09-06 Vidal Alcázar, Manuela Veloso and Daniel Borrajo.
Adapting a Rapidly-Exploring Random Tree for Automated Planning.
In Proceedings of the Fourth International Symposium on Combinatorial Search (SoCS 2011), pp. 2-9, AAAI Press 2011. (PDF)
Malte Helmert
2011-08-30 Tatsuya Imai and Akihiro Kishimoto.
A Novel Technique for Avoiding Plateaus of Greedy Best-First Search in Satisficing Planning.
In Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2011), pp. 985-991, 2011. (PDF)
Malte Helmert
2011-08-23 Neha Rungta and Eric G. Mercer.
Generating Counter-Examples Through Randomized Guided Search.
In Proceedings of the 14th International SPIN Workshop (SPIN 2007), pp. 39-57, 2007.
Malte Helmert
2011-08-16 Shahab Jabbari Arfaee, Sandra Zilles and Robert C. Holte.
Learning Heuristic Functions for Large State Spaces.
Preprint. To appear in Artificial Intelligence, 2011.
Malte Helmert
2011-08-09 Mehdi Samadi, Ariel Felner and Jonathan Schaeffer.
Learning from Multiple Heuristics.
In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 357-362, AAAI Press 2008. (PDF)
Malte Helmert
2011-08-02 J. N. Hooker.
Needed: An Empirical Science of Algorithms.
In Operations Research 42, pp. 201-212, 1994.

J. N. Hooker.
Testing Heuristics: We Have It All Wrong.
Journal of Heuristics 1:33-42, 1995.
Robert Mattmüller
2011-07-26 Jeffrey Long, Nathan R. Sturtevant, Michael Buro and Timothy Furtak.
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 134-140, AAAI Press 2010. (PDF)
Robert Mattmüller
2011-07-19 no meeting (IJCAI)
2011-07-12 Jason Wolfe and Stuart Russell.
Bounded Intention Planning.
In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 2011. (PDF)
Malte Helmert
2011-07-05 Amanda Coles and Andrew Coles.
Completeness-Preserving Pruning for Optimal Planning.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 965-966, 2010.

Amanda Coles and Andrew Coles.
Problem-Structure-Based Pruning for Cost-Optimal Planning.
Technical Report, University of Strathclyde, 2010. (PDF)
Malte Helmert
2011-06-28 Avitan Gefen and Ronen I. Brafman.
The Minimal Seed Set Problem.
In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS 2011), pp. 319-322, 2011. (PDF)
Malte Helmert
2011-06-28 no meeting (ICAPS 2012)
2011-06-21 You Xu.
Partial Order Reduction for Planning.
M.Sc. Thesis, School of Engineering of the Washington University, 2009.
Malte Helmert
2011-06-14 no meeting (ICAPS)
2011-06-07 no meeting (ACAI Summer School)
2011-05-31 Yixin Chen and Guohui Yao.
Completeness and Optimality Preserving Reduction for Planning.
In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1659-1664, 2009. (PDF)
Malte Helmert
2011-05-24 Yixin Chen, You Xu and Guohui Yao.
Stratified Planning.
In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1665-1670, 2009. (PDF)
Malte Helmert
2011-05-17 David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie and Barbara M. Smith.
Symmetry Definitions for Constraint Satisfaction Problems.
Constraints 11(2-3):115-137, 2006.
Malte Helmert
2011-05-10 Siddharth Srivastava, Neil Immerman and Shlomo Zilberstein.
Computing Applicability Conditions for Plans with Loops: New Results.
Preproceedings of 6th Workshop on Model Checking and Artificial Intelligence, held at AAAI 2010, Atlanta. (PDF)
Malte Helmert
2011-05-04 Chu-Min Li and Zhe Quan.
An Efficient Branch-and-Bound Algorithm Based on MaxSAT for the Maximum Clique Problem.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 128-133, AAAI Press 2010. (PDF)
Robert Mattmüller
2011-04-27 Jörg Hoffmann, Ingo Weber and Frank Michael Kraft.
SAP Speaks PDDL.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 1096-1101, AAAI Press 2010. (PDF)
Malte Helmert
2011-04-20 Edsger W. Dijkstra.
A Note on Two Problems in Connexion with Graphs.
In Numerische Mathematik, 1:269-271, 1959.
Malte Helmert
2011-04-13 no meeting (Oberseminar)
2011-04-06 Shaowei Cai, Kaile Su and Qingliang Chen.
EWLS: A New Local Search for Minimum Vertex Cover.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 45-50, AAAI Press 2010. (PDF)
Robert Mattmüller
2011-03-30 Blai Bonet.
Efficient Algorithms to Rank and Unrank Permutations in Lexicographic Order.
In Proceedings of the Workshop on Search in Artificial Intelligence and Robotics at AAAI 2008. (PDF)
Robert Mattmüller
2011-03-23 Teresa M. Breyer and Richard E. Korf.
1.6-Bit Pattern Databases.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 39-44, AAAI Press 2010. (PDF)
Jan-Georg Smaus
2011-03-16 Marijn Heule and Toby Walsh.
Symmetry within Solutions.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 77-82, AAAI Press 2010. (PDF)
Jan-Georg Smaus
2011-03-09 Nir Pochter, Aviv Zohar, Jeffrey S. Rosenschein and Ariel Felner.
Search Space Reduction Using Swamp Hierarchies.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 155-160, AAAI Press 2010. (PDF)
Malte Helmert
2011-03-02 Detlef Sieling and Ingo Wegener.
NC-Algorithms for Operations on Binary Decision Diagrams.
In Parallel Processing Letters 3(1):3-12, 1993.
Malte Helmert
2011-02-23 Robert Geisberger and Dennis Schieferdecker.
Heuristic Contraction Hierarchies with Approximation Guarantee.
In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 31-38, AAAI Press 2010. (PDF)
Malte Helmert
2011-02-16 Daniel Delling, Peter Sanders, Dominik Schultes and Dorothea Wagner.
Engineering Route Planning Algorithms.
In Algorithmics of Large and Complex Networks, LNCS 5515, pp. 117-139, Springer 2009.
Malte Helmert
2011-02-09 postponed due to AAAI deadline
2011-02-02 Ruoyun Huang, Yixin Chen and Weixiong Zhang.
A Novel Transition Based Encoding Scheme for Planning as Satisfiability.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 89-94, AAAI Press 2010. (PDF)
Malte Helmert
2011-01-26 Vidal Alcázar, Daniel Borrajo and Carlos Linares López.
Using Backwards Generated Goals for Heuristic Planning.
In Proceedings of the Twentieth Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 2-9, AAAI Press 2010. (PDF)
Malte Helmert
2011-01-19 postponed due to IPC deadline
2011-01-12 Lin Xu, Holger H. Hoos and Kevin Leyton-Brown.
Hydra: Automatically Configuring Algorithms for Portfolio-Based Selection.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 210-216, AAAI Press 2010. (PDF)
Robert Mattmüller
2010-12-22 Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown.
SATzilla: Portfolio-based Algorithm Selection for SAT.
Journal of Artificial Intelligence Research 32:565-606, 2008. (PDF)
Robert Mattmüller
2010-12-15 Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, and Thomas Stützle.
ParamILS: An Automatic Algorithm Configuration Framework.
Journal of Artificial Intelligence Research 36:267-306, 2009. (PDF)
Robert Mattmüller
2010-12-08 Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann and Kevin Tierney.
ISAC — Instance-Specific Algorithm Configuration.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 751-756, IOS Press 2010. (PDF)
Robert Mattmüller
2010-12-01 Christopher Raphael.
Coarse-to-Fine Dynamic Programming.
In IEEE Transactions on Pattern Analysis and Machine Intelligence 23(12):1379-1390, 2001. (PDF)
Malte Helmert
2010-11-24 Bradford Larsen, Ethan Burns, Wheeler Ruml and Robert C. Holte.
Searching Without a Heuristic: Efficient Use of Abstraction.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 114-120, AAAI Press 2010. (PDF)
Malte Helmert
2010-11-17 postponed
2010-11-10 Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä.
Planning as satisfiability: parallel plans and algorithms for plan search;
Remaining sections.

Artificial Intelligence 170(12-13):1031-1080, 2006.
Robert Mattmüller
2010-11-03 postponed
2010-10-27 Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä.
Planning as satisfiability: parallel plans and algorithms for plan search;
Sections 1-3 (pp. 1031-1053).

Artificial Intelligence 170(12-13):1031-1080, 2006.
Robert Mattmüller
2010-10-20 Jussi Rintanen.
Heuristics for Planning with SAT.
In Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP 2010), LNCS 6308, pp. 414-428, Springer-Verlag 2010.

Jussi Rintanen.
Heuristic Planning with SAT: Beyond Strict Depth-First Search.
In Proceedings of the Twenty-Third Australasian Joint Conference on Artificial Intelligence (AI 2010), 2010. (PDF)
Malte Helmert
2010-10-13 Shahab Jabbari Arfaee, Sandra Zilles and Robert C. Holte.
Bootstrap Learning of Heuristic Functions.
In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 52-60, AAAI Press 2010. (PDF)
Gabriele Röger
2010-10-06 Sridhar Hannenhalli and Pavel A. Pevzner.
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals.
Journal of the ACM, 46(1):1-27, 1999. (PDF)
Malte Helmert
2010-09-29 meeting cancelled
2010-09-22 Teresa M. Breyer and Richard E. Korf.
Independent Additive Heuristics Reduce Search Multiplicatively.
In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 33-38, AAAI Press 2010. (PDF)
Jan-Georg Smaus
2010-09-15 meeting postponed
2010-09-08 Knot Pipatsrisawat and Adnan Darwiche.
On Decomposability and Interaction Functions.
In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 9-14, IOS Press 2010. (PDF)
Malte Helmert
2010-09-01 Yuima Akagi, Akihiro Kishimoto and Alex Fukunaga.
On Transposition Tables for Single-Agent Search and Planning: Summary of Results.
In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 2-9, AAAI Press 2010. (PDF)
Malte Helmert
2010-08-25 Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet and Sven Koenig.
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1007-1012, 2007. (PDF)

Stefan Edelkamp.
Automated Creation of Pattern Database Search Heuristics.
Proceedings of the 4th Workshop on Model Checking and Artificial Intelligence (MOCHART 2006), LNCS 4428, pp. 35-50, 2007.
Malte Helmert
2010-08-18 no meeting (ECAI)
2010-08-11 Stuart Russell and Peter Norvig.
Classical Planning.
Artificial Intelligence: A Modern Approach (third edition), Chapter 10, pp. 366-400, Prentice Hall.
Robert Mattmüller
2010-08-04 Stuart Russell and Peter Norvig.
Solving Problems by Searching.
Artificial Intelligence: A Modern Approach (third edition), Chapter 3, pp. 64-119, Prentice Hall.
Malte Helmert
2010-07-28 Frederick P. Brooks, Jr.
No Silver Bullet - Essence and Accidents of Software Engineering.
In Computer, 20(4):10-19, 1987.
Moritz Göbelbecker
2010-07-21 no meeting (excursion)
2010-07-14 meeting postponed
2010-07-07 Patrik Haslum, Blai Bonet, and Hector Geffner.
New Admissible Heuristics for Domain-Independent Planning.
In Proceedings of the Twentieth AAAI Conference on Artificial Intelligence (AAAI 2005), pp. 1163-1168, AAAI Press 2005. (PDF)
Moritz Göbelbecker
2010-06-30 David A. Furcy.
ITSA*: Iterative Tunneling Search with A*.
In Proceedings of the AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, pp. 21-26, 2006. (PDF)

Hootan Nakhost and Martin Müller.
Action Elimination and Plan Neighborhood Graph Search: Two Algorithms for Plan Improvement.
In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 121-128, AAAI Press 2010. (PDF)
Gabriele Röger
2010-06-23 David Furcy and Sven Koenig.
Limited Discrepancy Beam Search.
In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 125-131, Professional Book Center 2005. (PDF)
Malte Helmert
2010-06-16 William D. Harvey and Matthew L. Ginsberg.
Limited Discrepancy Search.
In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 607-613, Morgan Kaufmann 1995. (PDF)

Richard E. Korf.
Improved Limited Discrepancy Search.
In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 1996), pp. 286-291, AAAI Press 1996. (PDF)
Malte Helmert
2010-06-09 Patrik Haslum.
Reducing Accidental Complexity in Planning Problems.
In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1898-1903, 2007. (PDF)
Sebastian Kupferschmid
2010-06-07 no meeting (Corpus Christi)
2010-06-02 Craig A. Knoblock.
Automatically Generating Abstractions for Planning.
Artificial Intelligence 68(2):243-302, 1994. (PDF)
Malte Helmert
2010-05-26 no meeting (Pentecost break)
2010-05-19 no meeting (travel/vacation)
2010-05-12 no meeting (ICAPS)
2010-05-05 Carmel Domshlak, Jörg Hoffmann and Ashish Sabharwal.
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
Journal of Artificial Intelligence Research 36:415-469, 2009. (PDF)

Jörg Hoffmann, Ashish Sabharwal and Carmel Domshlak.
Friends or Foes? An AI Planning Perspective on Abstraction and Search.
In Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS 2006), pp. 294-303, AAAI Press 2006. (PDF)
Robert Mattmüller
2010-04-28 Drew McDermott.
A Heuristic Estimator for Means-Ends Analysis in Planning.
In Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS 1996), pp. 142-149. AAAI Press 1996. (PDF)

Drew McDermott.
Using Regression-Match Graphs to Control Search in Planning.
Artificial Intelligence 109(1-2):111-159, 1999. (PDF)
Malte Helmert
2010-04-21 no meeting (Oberseminar)
2010-04-15 no meeting (Oberseminar)
2010-04-08 meeting postponed
2010-04-01 Guy L. Steele Jr.
Growing a Language.
Talk presented at the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, October 1998. (PDF)
Malte Helmert
2010-03-25 Marco Pistore and Moshe Y. Vardi.
The planning spectrum -- One, two, three, infinity.
Journal of Artificial Intelligence Research 30:101-132, 2007. (PDF)
Robert Mattmüller
2010-03-18 no meeting because of AVACS Spring School
2010-03-11 no meeting because of CogX workshop
2010-03-04 Carlos Linares López.
Multi-valued Pattern Databases.
In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 540-544, IOS Press 2008. (PDF)
Jan-Georg Smaus
2010-02-25 Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi and Ariel Felner.
A General Theory of Additive State Space Abstractions.
Journal of Artificial Intelligence Research 32:631-662, 2008. (PDF)
Gabriele Röger
2010-02-18 no meeting ("Games" seminar)
2010-02-11 Yaxin Liu, Sven Koenig and David Furcy.
Speeding Up the Calculation of Heuristics for Heuristic Search-Based Planning.
In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI 2002), pp. 484-491. AAAI Press 2002. (PDF)
Malte Helmert
2010-02-04 Tom Bylander.
The Computational Complexity of Propositional STRIPS Planning.
Artificial Intelligence 69(1-2):165-204, 1994. (PDF)
Gabriele Röger
2010-01-28 Sylvain Gelly and David Silver.
Combining Online and Offline Knowledge in UCT.
In Proceedings of the 24th International Conference on Machine Learning (ICML '07), pp. 273-280. ACM 2007. (PDF)
Malte Helmert
2010-01-21 cancelled due to AAAI deadline
2010-01-14 Levente Kocsis and Csaba Szepesvári.
Bandit based Monte-Carlo Planning.
In Proceedings of the 15th European Conferenceon Machine Learning (ECML'06), pp. 282-293, Springer 2006. (PDF)
Patrick Eyerich
2010-01-07 Christmas break
2009-12-31 Christmas break
2009-12-24 Christmas break
2009-12-17 cancelled due to ICAPS deadline
2009-12-10 cancelled due to ICAPS deadline
2009-12-03 cancelled because of Dagstuhl seminar
2009-11-26 Edmund M. Clarke, Orna Grumberg and Doron A. Peled.
Partial Order Reduction.
Chapter 10 in Model Checking, pp. 141-170, MIT Press 2000. (PDF)
Sebastian Kupferschmid
2009-11-19 Antti Valmari.
Stubborn sets for reduced state space generation.
In Advances in Petri Nets 1990, LNCS 483, pp. 491-515, Springer 1991. (PDF)
Sebastian Kupferschmid
2009-11-12 Malte Helmert and Carmel Domshlak.
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?.
In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 162-169, 2009. (PDF)
Thomas Keller
2009-11-05 Ronen I. Brafman and Carmel Domshlak.
Factored Planning: How, When, and When Not.
In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI 2006), AAAI Press 2006. (PDF)
Robert Mattmüller
2009-10-29 Eric A. Hansen and Shlomo Zilberstein.
LAO*: A Heuristic Search Algorithm that Finds Solutions with Loops.
Artificial Intelligence 129(1-2):35-62, 2001. (PDF)
Malte Helmert
2009-10-22 cancelled because of DESIRE meeting
2009-10-15 no meeting (Oberseminar)
2009-10-08 Erez Karpas and Carmel Domshlak.
Cost-optimal Planning with Landmarks.
In Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1728-1733, 2009. (PDF)
Malte Helmert
2009-07-30 Robert C. Holte.
Common Misconceptions Concerning Heuristic Search.
Second International Symposium on Combinatorial Search (SoCS 2009). (PDF)
Malte Helmert
2009-07-23 Armand E. Prieditis.
Machine Discovery of Effective Admissible Heuristics.
In Machine Learning, 12:117-141, 1993. (PDF)
Malte Helmert
2009-07-16 Rong Zhou and Eric A. Hansen.
Breadth-first Heuristic Search.
In Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 92-100. AAAI Press 2004. (PDF)

Rong Zhou and Eric A. Hansen.
Breadth-first Heuristic Search.
Artificial Intelligence 170(4-5):385-408, 2006. (PDF)
Sebastian Kupferschmid
2009-07-09 Robert C. Holte, M. B. Perez, Robert M. Zimmer and Alan J. MacDonald.
Hierarchical A*: Searching Abstraction Hierarchies Efficiently.
In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), pp. 530-535. AAAI Press 1996. (PDF)

Robert C. Holte, Jeffery Grajkowski and Brian Tanner.
Hierarchical Heuristic Search Revisited.
In Proceedings of the 6th International Symposium on Abstraction, Reformulation and Approximation (SARA 2005), pp. 121-133. Springer-Verlag 2005. (PDF)
Sebastian Kupferschmid
2009-07-02 Andreas Junghanns, Jonathan Schaeffer.
Sokoban: Enhancing General Single-Agent Search Methods Using Domain Knowledge.
Artificial Intelligence 129(1-2):219-251, 2001. (PDF)
Robert Mattmüller
2009-06-25 Paper pool presentation
2009-06-18 Patrik Haslum.
Improving Heuristics Through Relaxed Search.
In JAIR, 25:233-267, 2006. (PDF)
Malte Helmert
2009-06-11 No meeting (Corpus Christi)
2009-06-04 No meeting (Pentecost break)
2009-05-28 Richard E. Korf, Weixiong Zhang, Ignacio Thayer and Heath Hohwald.
Frontier Search.
Journal of the ACM 52(5):715-748, 2005. (PDF)
Sebastian Kupferschmid
2009-05-21 No meeting (Ascension Day)
2009-05-14 Patrik Haslum and Hector Geffner.
Heuristic Planning with Time and Resources.
In Proc. ECP 2001, pp. 121-132. (PDF)
Malte Helmert
2009-05-07 First meeting