Publications pertinent to automated planning as graph-based search and to parallel approaches include: Fast Planning through Planning Graph Analysis by Avrim L. Blum and Merrick L. Furst, Planning as Heuristic Search by Blai Bonet and Héctor Geffner, Parallel Search Algorithms for Graphs and Trees by Ratan K. Ghosh, Exploiting the Computational Power of the Graphics Card: Optimal State Space Planning on the GPU by Damian Sulewski, Stefan Edelkamp and Peter Kissmann, Parallel State Space Search on the GPU by Stefan Edelkamp and Damian Sulewski, Scalable GPU Graph Traversal by Duane Merrill, Michael Garland and Andrew Grimshaw, Efficient Parallel Graph Exploration on Multi-Core CPU and GPU by Sungpack Hong, Tayo Oguntebi and Kunle Olukotun.
Publications pertinent to parallel implementations of breadth-first, depth-first, best-first and IDA* search include: Parallel Breadth-first Search Algorithms for Trees and Graphs by Ratan K. Ghosh and G. P. Bhattacharjee, Parallel Algorithms for Depth-First Search by Jon Freeman, Parallel Depth-first Search in General Directed Graphs by Alok Aggarwal, Richard J. Anderson, and Ming-Yang Kao, Parallel Best-First Search of State-Space Graphs: A Summary of Results Vipin Kumar, K. Ramesh, and V. Nageshwara Rao and A Parallel Implementation of Iterative-deepening-a* by V. Nageshwara Rao, Vipin Kumar and K. Ramesh.
Publications pertinent to planning as constraint satisfaction and to parallel approaches include: Constraint-based Scheduling and Planning by Philippe Baptiste, Philippe Laborie, Claude Le Pape and Wim Nuijten, Planning as Constraint Satisfaction: Solving the Planning Graph by Compiling it into CSP by Minh Binh Do and Subbarao Kambhampati, Parallelism in Constraint Programming by Carl Christian Rolf, Combining Parallel Search and Parallel Consistency in Constraint Programming by Carl Christian Rolf and Krzysztof Kuchcinski and Towards Full Parallelization of Constraint Programming by Carl Christian Rolf and Krzysztof Kuchcinski.
Publications pertinent to planning as satisfiability and to parallel approaches include: Planning as Satisfiability by Henry A. Kautz and Bart Selman, Planning and SAT by Jussi Rintanen, Planning as Satisfiability: Parallel Plans and Algorithms for Plan Search by Jussi Rintanen, Keijo Heljanko and Ilkka Niemelä and An Overview of Parallel SAT Solving by Ruben Martins, Vasco Manquinho and Inês Lynce.
Publications pertinent to planning and stable models and to parallel approaches include: Relating Stable Models and AI Planning Domains by V. S. Subrahmanian and Carlo Zaniolo and Computing Stable Models in Parallel by Raphael A.Finkel, Victor W. Marek, Neil Moore and Miroslaw Truszczynski.
Publications pertinent to planning and answer set programming and to parallel approaches include: Answer Set Planning by Vladimir Lifschitz, Action Languages, Answer Sets, and Planning by Vladimir Lifschitz, Answer Set Programming and Plan Generation by Vladimir Lifschitz and Construction and Optimization of a Parallel Engine for Answer Set Programming by Enrico Pontelli and Omar El-Khatib.
Publications pertinent to parallel logic programming systems include: Parallel Execution of Prolog Programs: A Survey by Gopal Gupta, Enrico Pontelli, Khayri AM Ali, Mats Carlsson and Manuel V. Hermenegildo and Parallel Logic Programming Systems by Jacques Chassin De Kergommeaux and Philippe Codognet.