Uni-Logo

Lesegruppe Handlungsplanung und Suche: Archiv

Beschreibung

Diese Seite sammelt die in vergangenen Semestern in der Lesegruppe gelesenen Arbeiten. Für aktuelle Informationen zur Lesegruppe und Kontaktinformationen besuchen Sie bitte die Lesegruppenseite des jeweils aktuellen Semesters.

Papers

Termin Thema Ansprechpartner
07.05.2009 Vorbesprechung
14.05.2009 Patrik Haslum and Hector Geffner.
Heuristic Planning with Time and Resources.
In Proc. ECP 2001, pp. 121-132. 		Prof. Dr. Malte Helmert
21.05.2009 Kein Treffen (Christi Himmelfahrt)
28.05.2009 Richard E. Korf, Weixiong Zhang, Ignacio Thayer and Heath Hohwald.
Frontier Search.
In Journal of the ACM, 52(5):715-748, 2005. 		Dr. Sebastian Kupferschmid
04.06.2009 Kein Treffen (Pfingstpause)
11.06.2009 Kein Treffen (Fronleichnam)
18.06.2009 Patrik Haslum.
Improving Heuristics Through Relaxed Search.
In JAIR, 25:233-267, 2006. 		Prof. Dr. Malte Helmert
25.06.2009 Vorstellung Paper-Pool
02.07.2009 Andreas Junghanns, Jonathan Schaeffer.
Sokoban: Enhancing General Single-Agent Search Methods Using Domain Knowledge.
In Artificial Intelligence, 129(1-2):219-251, 2001. 		Dr. Robert Mattmüller
09.07.2009 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.

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. 		Dr. Sebastian Kupferschmid
16.07.2009 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.

Rong Zhou and Eric A. Hansen.
Breadth-first Heuristic Search.
In Artificial Intelligence, 170(4-5):385-408, 2006. 		Dr. Sebastian Kupferschmid
23.07.2009 Armand E. Prieditis.
Machine Discovery of Effective Admissible Heuristics.
In Machine Learning, 12:117-141, 1993. 		Prof. Dr. Malte Helmert
30.07.2009 Robert C. Holte.
Common Misconceptions Concerning Heuristic Search.
Second International Symposium on Combinatorial Search (SoCS 2009). 		Prof. Dr. Malte Helmert
08.10.2009 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. 		Prof. Dr. Malte Helmert
15.10.2009 kein Treffen (Oberseminar)
22.10.2009 abgesagt wegen DESIRE-Treffen
29.10.2009 Eric A. Hansen and Shlomo Zilberstein.
LAO*: A Heuristic Search Algorithm that Finds Solutions with Loops.
In Artificial Intelligence, 129(1-2):35-62, 2001. 		Prof. Dr. Malte Helmert
05.11.2009 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. 		Dr. Robert Mattmüller
12.11.2009 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. 		Dr. Thomas Keller
19.11.2009 Antti Valmari.
Stubborn sets for reduced state space generation.
In Advances in Petri Nets 1990, LNCS 483, pp. 491-515, Springer 1991. 		Dr. Sebastian Kupferschmid
26.11.2009 Edmund M. Clarke, Orna Grumberg and Doron A. Peled.
Partial Order Reduction.
Chapter 10 in Model Checking, pp. 141-170, MIT Press 2000. 		Dr. Sebastian Kupferschmid
03.12.2009 abgesagt wegen Dagstuhl-Seminar
10.12.2009 verschoben wegen ICAPS-Deadline
17.12.2009 verschoben wegen ICAPS-Deadline
24.12.2009 Weihnachtspause
31.12.2009 Weihnachtspause
07.01.2010 Weihnachtspause
14.01.2010 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. 		Dr. Patrick Eyerich
21.01.2010 verschoben wegen AAAI-Deadline
28.01.2010 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. 		Prof. Dr. Malte Helmert
04.02.2010 Tom Bylander.
The Computational Complexity of Propositional STRIPS Planning.
In Artificial Intelligence, 69(1-2):165-204, 1994. 		Dr. Gabriele Röger
11.02.2010 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. 		Prof. Dr. Malte Helmert
18.02.2010 kein Treffen (Blockseminar "Spiele")
25.02.2010 Fan Yang, Joseph C. Culberson, Robert Holte, Uzi Zahavi and Ariel Felner.
A General Theory of Additive State Space Abstractions.
In Journal of Artificial Intelligence Research, 32:631-662, 2008. 		Dr. Gabriele Röger
04.03.2010 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. 		Prof. Dr. Jan-Georg Smaus
11.03.2010 kein Treffen wegen CogX-Workshop
18.03.2010 kein Treffen wegen AVACS-Spring-School
25.03.2010 Marco Pistore and Moshe Y. Vardi.
The planning spectrum -- One, two, three, infinity.
In Journal of Artificial Intelligence Research, 30:101-132, 2007. 		Dr. Robert Mattmüller
01.04.2010 Guy L. Steele Jr.
Growing a Language.
Talk presented at the ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications, October 1998. 		Prof. Dr. Malte Helmert
08.04.2010 Treffen verschoben
15.04.2010 kein Treffen (Oberseminar)
21.04.2010 kein Treffen (Oberseminar)
28.04.2010 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.

Drew McDermott.
Using Regression-Match Graphs to Control Search in Planning.
In Artificial Intelligence, 109(1-2):111-159, 1999. 		Prof. Dr. Malte Helmert
05.05.2010 Carmel Domshlak, Jörg Hoffmann and Ashish Sabharwal.
Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
In Journal of Artificial Intelligence Research, 36:415-469, 2009.

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. 		Dr. Robert Mattmüller
12.05.2010 kein Treffen (ICAPS)
19.05.2010 kein Treffen (Dienstreisen/Urlaub)
26.05.2010 kein Treffen (Pfingstpause)
02.06.2010 Craig A. Knoblock.
Automatically Generating Abstractions for Planning.
In Artificial Intelligence, 68(2):243-302, 1994. 		Prof. Dr. Malte Helmert
09.06.2010 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. 		Dr. Sebastian Kupferschmid
16.06.2010 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.

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. 		Prof. Dr. Malte Helmert
23.06.2010 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. 		Prof. Dr. Malte Helmert
30.06.2010 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.

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. 		Dr. Gabriele Röger
07.07.2010 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. 		Moritz Göbelbecker
14.07.2010 Treffen verschoben
21.07.2010 kein Treffen (Abteilungsausflug)
28.07.2010 Frederick P. Brooks, Jr.
No Silver Bullet - Essence and Accidents of Software Engineering.
In Computer, 20(4):10-19, 1987. 		Moritz Göbelbecker
04.08.2010 Stuart Russell and Peter Norvig.
Solving Problems by Searching.
Artificial Intelligence: A Modern Approach (third edition), Chapter 3, pp. 64-119, Prentice Hall. 		Prof. Dr. Malte Helmert
11.08.2010 Stuart Russell and Peter Norvig.
Classical Planning.
Artificial Intelligence: A Modern Approach (third edition), Chapter 10, pp. 366-400, Prentice Hall. 		Dr. Robert Mattmüller
18.08.2010 kein Treffen (ECAI)
25.08.2010 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.

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. 		Prof. Dr. Malte Helmert
01.09.2010 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. 		Prof. Dr. Malte Helmert
08.09.2010 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. 		Prof. Dr. Malte Helmert
15.09.2010 Treffen verschoben
22.09.2010 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. 		Prof. Dr. Jan-Georg Smaus
29.09.2010 Treffen fällt aus
06.10.2010 Sridhar Hannenhalli and Pavel A. Pevzner.
Transforming Cabbage into Turnip: Polynomial Algorithm for Sorting Signed Permutations by Reversals.
In Journal of the ACM, 46:1(1-27), 1999. 		Prof. Dr. Malte Helmert
13.10.2010 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. 		Dr. Gabriele Röger
20.10.2010 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. 		Prof. Dr. Malte Helmert
27.10.2010 Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä.
Planning as satisfiability: parallel plans and algorithms for plan search;
Sections 1-3 (pp. 1031-1053).
In Artificial Intelligence, 170(12-13):1031-1080, 2006. 		Dr. Robert Mattmüller
03.11.2010 verschoben
10.11.2010 Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä.
Planning as satisfiability: parallel plans and algorithms for plan search;
Remaining sections.
In Artificial Intelligence, 170(12-13):1031-1080, 2006. 		Dr. Robert Mattmüller
17.11.2010 verschoben
24.11.2010 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. 		Prof. Dr. Malte Helmert
01.12.2010 Christopher Raphael.
Coarse-to-Fine Dynamic Programming.
In IEEE Transactions on Pattern Analysis and Machine Intelligence 23(12):1379-1390, 2001. 		Prof. Dr. Malte Helmert
08.12.2010 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. 		Dr. Robert Mattmüller
15.12.2010 Frank Hutter, Holger H. Hoos, Kevin Leyton-Brown, and Thomas Stützle.
ParamILS: An Automatic Algorithm Configuration Framework.
In Journal of Artificial Intelligence Research, 36:267-306, 2009. 		Dr. Robert Mattmüller
22.12.2010 Lin Xu, Frank Hutter, Holger H. Hoos, and Kevin Leyton-Brown.
SATzilla: Portfolio-based Algorithm Selection for SAT.
In Journal of Artificial Intelligence Research, 32:565-606, 2008. 		Dr. Robert Mattmüller
12.01.2011 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. 		Dr. Robert Mattmüller
19.01.2011 verschoben wegen IPC-Deadline
26.01.2011 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. 		Prof. Dr. Malte Helmert
02.02.2011 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. 		Prof. Dr. Malte Helmert
09.02.2011 verschoben wegen AAAI-Deadline
16.02.2011 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. 		Prof. Dr. Malte Helmert
23.02.2011 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. 		Prof. Dr. Malte Helmert
02.03.2011 Detlef Sieling and Ingo Wegener.
NC-Algorithms for Operations on Binary Decision Diagrams.
In Parallel Processing Letters 3(1):3-12, 1993. 		Prof. Dr. Malte Helmert
09.03.2011 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. 		Prof. Dr. Malte Helmert
16.03.2011 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. 		Prof. Dr. Jan-Georg Smaus
23.03.2011 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. 		Prof. Dr. Jan-Georg Smaus
30.03.2011 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. 		Dr. Robert Mattmüller
06.04.2011 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. 		Dr. Robert Mattmüller
13.04.2011 kein Treffen (Oberseminar)
20.04.2011 Edsger W. Dijkstra.
A Note on Two Problems in Connexion with Graphs.
In Numerische Mathematik, 1:269-271, 1959. 		Prof. Dr. Malte Helmert
27.04.2011 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. 		Prof. Dr. Malte Helmert
04.05.2011 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. 		Dr. Robert Mattmüller
10.05.2011 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. 		Prof. Dr. Malte Helmert
17.05.2011 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. 		Prof. Dr. Malte Helmert
24.05.2011 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. 		Prof. Dr. Malte Helmert
31.05.2011 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. 		Prof. Dr. Malte Helmert
07.06.2011 kein Treffen (ACAI Summer School)
14.06.2011 kein Treffen (ICAPS)
21.06.2011 You Xu.
Partial Order Reduction for Planning.
M.Sc. Thesis, School of Engineering of the Washington University, 2009. 		Prof. Dr. Malte Helmert
28.06.2011 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. 		Prof. Dr. Malte Helmert
05.07.2011 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. 		Prof. Dr. Malte Helmert
12.07.2011 Jason Wolfe and Stuart Russell.
Bounded Intention Planning.
In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), 2011. 		Prof. Dr. Malte Helmert
19.07.2011 kein Treffen (IJCAI)
26.07.2011 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. 		Dr. Robert Mattmüller
02.08.2011 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.
In Journal of Heuristics 1, pp. 33-42, 1995. 		Dr. Robert Mattmüller
09.08.2011 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. 		Prof. Dr. Malte Helmert
16.08.2011 Shahab Jabbari Arfaee, Sandra Zilles and Robert C. Holte.
Learning Heuristic Functions for Large State Spaces.
To appear in Artificial Intelligence, 2011. 		Prof. Dr. Malte Helmert
23.08.2011 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. 		Prof. Dr. Malte Helmert
30.08.2011 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. 		Prof. Dr. Malte Helmert
06.09.2011 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. 		Prof. Dr. Malte Helmert
13.09.2011 kein Treffen (AVACS-Begehung)
21.09.2011 Jussi Rintanen.
Regression for Classical and Nondeterministic Planning.
In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 568-572, 2008.

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. 		Prof. Dr. Malte Helmert
27.09.2011 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. 		Prof. Dr. Malte Helmert
04.10.2011 kein Treffen (KI-Konferenz)
11.10.2011 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. 		Prof. Dr. Malte Helmert
19.10.2011
25.10.2011		 Alfonso Gerevini, Alessandro Saetti and Ivan Serina.
An Approach to Efficient Planning with Numerical Fluents and Multi-Criteria Plan Quality.
In Artificial Intelligence, 172(8-9):899-944, 2008. 		Prof. Dr. Malte Helmert
02.11.2011 Carla P. Gomes, Bart Selman, Nuno Crato and Henry Kautz.
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems.
In Journal of Automated Reasoning 24: 67-100, 2000.

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. 		Prof. Dr. Malte Helmert
08.11.2011 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. 		Moritz Göbelbecker
15.11.2011 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. 		Prof. Dr. Malte Helmert
22.11.2011 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). 		Dr. Robert Mattmüller
29.11.2011 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. 		Prof. Dr. Malte Helmert
06.12.2011 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. 		Prof. Dr. Malte Helmert
13.12.2011 kein Treffen (ICAPS-Deadline)
20.12.2011 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. 		Prof. Dr. Malte Helmert
27.12.2011 kein Treffen (Weihnachtspause)
03.01.2012 kein Treffen (Weihnachtspause)
11.01.2012 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. 		Prof. Dr. Malte Helmert
18.01.2012 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. 		Prof. Dr. Malte Helmert
24.01.2012
16.02.2012		 Andrew Barto, Steven Bradtke and Satinder Singh.
Learning to act using real-time dynamic programming.
In Artificial Intelligence, Volume 76, Issues 1–2, pp. 35-74, 1995. 		Dr. Thomas Keller
23.02.2012 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. 		Dr. Thomas Keller
01.03.2012 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. 		Dr. Thomas Keller
08.03.2012 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. 		Dr. Gabriele Röger
15.03.2012 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. 		Prof. Dr. Malte Helmert
22.03.2012 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. 		Prof. Dr. Malte Helmert
29.03.2012 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. 		Prof. Dr. Malte Helmert
05.04.2012 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. 		Dr. Robert Mattmüller
12.04.2012 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. 		Dr. Robert Mattmüller
19.04.2012 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.

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. 		Prof. Dr. Malte Helmert
26.04.2012 Richard M. Wilson.
Graph Puzzles, Homotopy, and the Alternating Group.
Journal of Combinatorial Theory, Series B, 16:86-96, 1974. 		Prof. Dr. Malte Helmert
03.05.2012 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. 		Dr. Robert Mattmüller
10.05.2012 Patrik Haslum.
Narrative Planning: Compilations to Classical Planning.
Journal of Artificial Intelligence Research, 2012. Accepted for publication.

Mark O. Riedl and R. Michael Young.
Narrative Planning: Balancing Plot and Character.
Journal of Artificial Intelligence Research 39:217-268, 2010. 		Prof. Dr. Malte Helmert
17.05.2012 kein Treffen (Christi Himmelfahrt)
24.05.2012 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). 		Prof. Dr. Malte Helmert
31.05.2012 Martin Davis, George Logemann and Donald Loveland.
A Machine Program for Theorem-Proving.
Communications of the ACM 5(7):394-397, 1962. 		Prof. Dr. Malte Helmert
07.06.2010 kein Treffen (Fronleichnam)
14.06.2012 Neil Burch and Robert Holte.
Automatic Move Pruning Revisited.
In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), 2012.

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. 		Prof. Dr. Malte Helmert
21.06.2012 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). 		Dr. Gabriele Röger
28.06.2011 kein Treffen (ICAPS 2012)
05.07.2012 Agostino Dovier, Carla Piazza and Alberto Policriti.
An efficient algorithm for computing bisimulation equivalence.
Theoretical Computer Science 311:221-256, 2004. 		Prof. Dr. Malte Helmert
12.07.2012 Erez Karpas and Carmel Domshlak.
Optimal Search with Inadmissible Heuristics.
In Proceedings of the 22nd International Conference on Automated Planning and Scheduling. 		Dr. Thomas Keller
19.07.2012 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
26.07.2012 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. 		Dr. Robert Mattmüller
02.08.2012 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. 		Dr. Robert Mattmüller
09.08.2012 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. 		Prof. Dr. Malte Helmert
16.08.2012 Blai Bonet.
Deterministic POMDPs Revisited.
In Proceedings of the 25th Conference on Uncertainty in Artificial Intelligence (UAI 2009), pp. 59-66, 2009. 		Dr. Gabriele Röger
23.08.2012 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. 		Prof. Dr. Malte Helmert
30.08.2012 kein Treffen (ECAI 2012)
06.09.2012 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. 		Prof. Dr. Malte Helmert
13.09.2012 Hermann Kaindl and Gerhard Kainz.
Bidirectional Heuristic Search Reconsidered.
Journal of Artificial Intelligence Research (JAIR) 7:283-317, 1997. 		Prof. Dr. Malte Helmert
18.09.2012 Giovanni Manzini.
BIDA*: an improved perimeter search algorithm.
Artificial Intelligence 75:347-360, 1995. 		Prof. Dr. Malte Helmert
25.09.2012 Karem A. Sakallah and João Marques-Silva.
Anatomy and Empirical Evaluation of Modern SAT Solvers.
Bulletin of the EATCS 103:96-121, 2011. 		Prof. Dr. Malte Helmert
02.10.2012 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). 		Dr. Johannes Aldinger
09.10.2012 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). 		Dr. Patrick Eyerich
16.10.2012 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. 		Prof. Dr. Malte Helmert
23.10.2012 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. 		Prof. Dr. Malte Helmert
30.10.2012 Jürgen Eckerle.
Chapters 4 and 5 of: Heuristische Suche unter Speicherbeschränkungen.
Ph.D. thesis, Albert-Ludwigs-Universität Freiburg, 1997. 		Prof. Dr. Malte Helmert
06.11.2012 Stuart J. Russell.
Efficient Memory-Bounded Search Methods.
In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 1992), pp. 1-5, 1992. 		Prof. Dr. Malte Helmert
13.11.2012 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. 		Florian Pommerening
20.11.2012 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. 		Prof. Dr. Malte Helmert
27.11.2012 Ariel Felner, Richard E. Korf and Sarit Hanan.
Additive Pattern Database Heuristics.
Journal of Artificial Intelligence Research, 22:279-318, 2004. 		Dr. Gabriele Röger
04.12.2012 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. 		Prof. Dr. Malte Helmert
11.12.2012 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. 		Prof. Dr. Malte Helmert
18.12.2012 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. 		Dr. Patrick Eyerich
08.01.2013 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. 		Moritz Göbelbecker
15.01.2013 Thomas S. Ferguson.
Linear Programming: A Concise Introduction.
UCLA, unpublished document available online, Chapters 1-5. 		Prof. Dr. Malte Helmert
22.01.2013 Thomas S. Ferguson.
Linear Programming: A Concise Introduction.
UCLA, unpublished document available online, Chapters 6-8. 		Prof. Dr. Malte Helmert
05.02.2013 Jacques Desrosiers and Marco E. Lübbecke.
A Primer in Column Generation.
In Column Generation, pp. 1-32, Springer, 2005. 		Prof. Dr. Malte Helmert
12.02.2013 Peter Auer and Nicolo Cesa-Bianchi and Paul Fischer.
Finite-time Analysis of the Multiarmed Bandit Problem.
In Journal of Machine Learning, 47:235-256, 2002. 		Dr. Thomas Keller
19.02.2013 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. 		Dr. Gabriele Röger
26.02.2013 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. 		Dr. Thomas Keller
05.03.2013 Emil Keyder and Hector Geffner.
Heuristics for Planning with Action Costs Revisited.
In ECAI 2008 - 18th European Conference on Artificial Intelligence, IOS Press. 		Dr. Thomas Keller
12.03.2013 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. 		Prof. Dr. Malte Helmert
19.03.2013 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. 		Prof. Dr. Malte Helmert
26.03.2013 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. 		Prof. Dr. Malte Helmert
02.04.2013 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. 		Prof. Dr. Malte Helmert
09.04.2013 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. 		Prof. Dr. Malte Helmert
16.04.2013 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. 		Prof. Dr. Malte Helmert
23.04.2013 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. 		Prof. Dr. Malte Helmert
30.04.2013 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. 		Prof. Dr. Malte Helmert
07.05.2013 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. 		Prof. Dr. Malte Helmert
14.05.2013 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.

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. 		Dr. Gabriele Röger
21.05.2013 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. 		Dr. Thomas Keller
28.05.2013 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. 		Dr. Johannes Aldinger
04.06.2013 Patrik Haslum.
Heuristics for Bounded-Cost Search.
In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), to appear. 		Prof. Dr. Malte Helmert
11.06.2013 kein Treffen (ICAPS)
18.06.2013 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. 		Prof. Dr. Malte Helmert
26.06.2013 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. 		Dr. Gabriele Röger
10.07.2013 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. 		Dr. Robert Mattmüller
17.07.2013 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. 		Dr. Robert Mattmüller
24.07.2013 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. 		Dr. Robert Mattmüller
31.07.2013 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. 		Dr. Robert Mattmüller
07.08.2013 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. 		Dr. Robert Mattmüller
14.08.2013 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. 		Dr. Robert Mattmüller
21.08.2013 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). 		Dr. Robert Mattmüller
28.08.2013 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. 		Dr. Robert Mattmüller
04.09.2013 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. 		Dr. Robert Mattmüller
11.09.2013 Ronald L. Graham, Donald E. Knuth and Oren Patashnik.
Repetition: Concrete Mathematics: A Foundation for Computer Science (second edition).
Addison-Wesley, 1994. 		Dr. Robert Mattmüller
18.09.2013 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. 		Dr. Robert Mattmüller
25.09.2013 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. 		Prof. Dr. Malte Helmert
02.10.2013 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. 		Prof. Dr. Malte Helmert
09.10.2013 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). 		Dr. Gabriele Röger
16.10.2013 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). 		Dr. Johannes Aldinger
23.10.2013 Á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). 		Dr. Gabriele Röger
30.10.2013 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). 		Dr. Gabriele Röger
06.11.2013 kein Treffen (ICAPS-Deadline)
13.11.2013 Carmel Domshlak, Michael Katz, Sagi Lefler.
Landmark-enhanced abstraction heuristics.
Artificial Intelligence, 189:48-68. 		Dr. Gabriele Röger
20.11.2013 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). 		Dr. Robert Mattmüller
Mo, 15:00 25.11.2013 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). 		Dr. Johannes Aldinger
Di, 15:00 03.12.2013 Matteo Gagliolo and Jürgen Schmidhuber.
Dynamic Algorithm Portfolios.
In Proceedings of the Ninth International Symposium on Artificial Intelligence and Mathematics (AI&MATH 2006). 		Dr. Robert Mattmüller
11.12.2013 Dan Klein and Christopher D. Manning.
A* Parsing: Fast Exact Viterbi Parse Selection.
In Proceedings of Human Language Technologies (HLT-NAACL 2003). 		Dr. Gabriele Röger
18.12.2013 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. 		Dr. Johannes Aldinger
25.12.2013 kein Treffen (Weihnachtspause)
01.01.2014 kein Treffen (Weihnachtspause)
08.01.2014 kein Treffen (Weihnachtspause)
15.01.2014 kein Treffen
22.01.2014 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. 		Moritz Göbelbecker
29.01.2014 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. 		Prof. Dr. Malte Helmert
05.02.2014 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. 		Dr. Frank Hutter
12.02.2014 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
14:30 18.02.2014 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. 		Prof. Dr. Malte Helmert
25.02.2014 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. 		Dr. Gabriele Röger
04.03.2014 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. 		Dr. Johannes Aldinger
11.03.2014 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. 		Prof. Dr. Malte Helmert
18.03.2014 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. 		Prof. Dr. Malte Helmert
14:30 25.03.2014 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. 		Dr. Johannes Aldinger
01.04.2014 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. 		Dr. Johannes Aldinger
08.04.2014 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. 		Prof. Dr. Malte Helmert
15.04.2014 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. 		Jendrik Seipp
22.04.2014 kein Treffen (Osterpause)
29.04.2014 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. 		Prof. Dr. Malte Helmert
14:30 06.05.2014 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. 		Jendrik Seipp
13.05.2014 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. 		Florian Pommerening
16:00 20.05.2014 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. 		Dr. Johannes Aldinger
27.05.2014 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. 		Florian Pommerening
03.06.2014 Martin Suda.
Property Directed Reachability for Automated Planning.
Journal of Artificial Intelligence Research, 2014. To appear. 		Prof. Dr. Malte Helmert
10.06.2014 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. 		Prof. Dr. Malte Helmert
16:00 17.06.2014 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é Simon
24.06.2014 kein Treffen (ICAPS)
01.07.2014 kein Treffen (ICAPS)
08.07.2014 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. 		Dr. Johannes Aldinger
15.07.2014 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. 		Silvan Sievers
22.07.2014 Vitaly Mirkis and Carmel Domshlak.
Landmarks in Oversubscription Planning.
In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), 2014, to appear. 		Dr. Gabriele Röger
29.07.2014 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. 		Florian Pommerening
16:00 05.08.2014 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. 		Silvan Sievers
13.08.2014 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. 		Jendrik Seipp
27.08.2014 Sandip Aine, Siddharth Swaminathan, Venkatraman Narayanan, Victor Hwang, and Maxim Likhachev.
Multi-Heuristic A*.
In Proceedings of Robotics: Science and Systems (RSS 2014), 2014. 		Dr. Gabriele Röger
03.09.2014 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. 		Jendrik Seipp
10.09.2014 Christopher Wilt and Wheeler Ruml.
Speedy versus Greedy Search.
In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014), 2014. 		Prof. Dr. Malte Helmert
17.09.2014 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. 		Dr. Gabriele Röger
24.09.2014 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. 		Prof. Dr. Malte Helmert
01.10.2014 Rina Dechter.
Constraint Processing (Chapters 1 and 2).
Morgan Kaufmann, 2003. 		Dr. Gabriele Röger
08.10.2014 Rina Dechter.
Constraint Processing (Chapter 3).
Morgan Kaufmann, 2003. 		Florian Pommerening
29.10.2014 Rina Dechter.
Constraint Processing (Chapter 4).
Morgan Kaufmann, 2003. 		Florian Pommerening
05.11.2014 Rina Dechter.
Constraint Processing (Chapter 5).
Morgan Kaufmann, 2003. 		Dr. Gabriele Röger
12.11.2014 kein Treffen
19.11.2014 kein Treffen
26.11.2014 Rina Dechter.
Constraint Processing (Chapter 6).
Morgan Kaufmann, 2003. 		Dr. Gabriele Röger
3.12.2014 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. 		Dr. Robert Mattmüller
10.12.2014 kein Treffen
16:15 17.12.2014 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. 		Dr. Gabriele Röger
8.1.2014 kein Treffen
15.1.2015 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. 		Dr. Johannes Aldinger
22.1.2015 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. 		Prof. Dr. Malte Helmert
29.1.2014 kein Treffen
5.2.2014 kein Treffen
16:15 12.2.2015 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). 		Dr. Johannes Aldinger
26.2.2015 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). 		Dr. Gabriele Röger
5.3.2014 kein Treffen
12.3.2015 Lars Kotthoff.
Algorithm Selection for Combinatorial Search Problems: A Survey.
AI Magazine 2014. 		Marius Lindauer
19.3.2015 Michael Bowling, Neil Burch, Michael Johanson and Oskari Tammelin.
Heads-up Limit Hold'em Poker is Solved.
Science (January 2015). 		Dr. Johannes Aldinger
26.3.2015 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). 		Dr. Florian Geißer
02.04.2015 kein Treffen
16:15 09.04.2015 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. 		Dr. Gabriele Röger
16.04.2015 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. 		Prof. Dr. Malte Helmert
23.04.2015 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. 		Jendrik Seipp
30.04.2015 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. 		Dr. Gabriele Röger
07.05.2015 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. 		Prof. Dr. Malte Helmert
14.05.2015 kein Treffen - Christi Himmelfahrt
13:30 21.05.2015 Jussi Rintanen.
Planning as satisfiability: Heuristics.
Artificial Intelligence 193 (2012): 45-86. 		Florian Pommerening
28.05.2015 Sam Bayless, Noah Bayless, Holger H. Hoos and Alan J. Hu.
SAT Modulo Monotonic Theories.
In Proc. AAAI 2015. 		Prof. Dr. Malte Helmert
04.06.2015 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). 		Dr. Gabriele Röger
11.06.2015 kein Treffen (ICAPS)
18.06.2015 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). 		Dr. Frank Hutter
25.06.2015 Christopher Wilt and Wheeler Ruml.
Building a Heuristic for Greedy Search.
In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). 		Prof. Dr. Malte Helmert
16:30 02.07.2015 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). 		Salomé Simon
09.07.2015 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). 		Dr. Florian Geißer
16.07.2015 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. 		Prof. Dr. Malte Helmert
23.07.2015 Álvaro Torralba and Jörg Hoffmann.
Simulation-Based Admissible Dominance Pruning.
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). 		Dr. Gabriele Röger
30.07.2015 Á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). 		Silvan Sievers
06.08.2015 Á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
13.08.2015 Randal E. Bryant.
Graph-Based Algorithms for Boolean Function Manipulation.
IEEE Transactions on Computers, Vol. C-35, No. 8 (1986). 		Dr. Gabriele Röger
20.08.2015 Daniel Gnad, Jörg Hoffmann and Carmel Domshlak.
From Fork Decoupling to Star-Topology Decoupling.
TechReport. 		Martin Wehrle
27.08.2015 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). 		Dr. Florian Geißer
02.09.2015 Nir Lipovetzky, Hector Geffner.
Width and Serialization of Classical Planning Problems.
Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012). 		Dr. Johannes Aldinger
16:30 09.09.2015 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). 		Salomé Simon
16.09.2015 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. 		Dr. Florian Geißer
23.09.2015 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). 		Dr. Florian Geißer
30.09.2015 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. 		Prof. Dr. Malte Helmert
07.10.2015 Holger Bast, Stefan Funke and Domagoj Matijevic.
TRANSIT: Ultrafast Shortest-Path Queries with Linear-Time Preprocessing.
9th DIMACS Implementation Challenge, 2006. 		Dr. Gabriele Röger
14.10.2015 kein Treffen
21.10.2015 Akihiro Kishimoto, Alex Fukunaga and Adi Botea.
Evaluation of a simple, scalable, parallel best-first search strategy.
Artificial Intelligence 195:222-248, 2013. 		Prof. Dr. Malte Helmert
28.10.2015 kein Treffen
04.11.2015 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). 		Silvan Sievers
11.11.2015 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. 		Dr. Thomas Keller
18.11.2015 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. 		Dr. Florian Geißer
25.11.2015 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. 		Dr. Johannes Aldinger
02.12.2015 Yiming Wang, Austin Buchanan and Sergiy Butenko.
On imposing connectivity constraints in integer programs.
Preprint, 2015. 		Florian Pommerening
09.12.2015 kein Treffen
16.12.2015 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. 		Florian Pommerening
23.12.2015 kein Treffen
30.12.2015 kein Treffen
06.01.2016 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. 		Prof. Dr. Malte Helmert
13.01.2016 Ben Strasser, Adi Botea and Daniel Harabor.
Compressing Optimal Paths with Run Length Encoding.
Journal of Artificial Intelligence Research 54:593-629, 2015. 		Prof. Dr. Malte Helmert
20.01.2016 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. 		Prof. Dr. Malte Helmert
27.01.2016 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. 		Florian Pommerening
03.02.2016 kein Treffen
10.02.2016 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. 		Jendrik Seipp
17.02.2016 kein Treffen
25.02.2016 David Silver et al.
Mastering the game of Go with deep neural networks and tree search.
Nature 529, pp. 484-489, 2016. 		Dr. Robert Mattmüller
03.03.2016 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. 		Prof. Dr. Malte Helmert
10.03.2016 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. 		Manuel Heusner
17.03.2016 kein Treffen
24.03.2016 kein Treffen
31.03.2016 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. 		Florian Pommerening
07.04.2016 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. 		Prof. Dr. Malte Helmert
14.04.2016 Adnan Darwiche and Pierre Marquis.
A Knowledge Compilation Map.
JAIR 17:229-264, 2002. 		Prof. Dr. Malte Helmert