Concise finite-domain representations for PDDL planning tasks

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[4]  室 章治郎.  Michael R.Garey/David S.Johnson 著, "COMPUTERS AND INTRACTABILITY A guide to the Theory of NP-Completeness", FREEMAN, A5判変形判, 338+xii, \5,217, 1979 , 1980 .

[5]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

[6]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[7]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[8]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[9]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .

[10]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[11]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[12]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[13]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

[14]  V. S. Subrahmanian,et al.  Complexity, Decidability and Undecidability Results for Domain-Independent Planning , 1995, Artif. Intell..

[15]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[16]  Henry Kautz,et al.  Pushing the envelope: planning , 1996 .

[17]  Craig A. Knoblock,et al.  Combining the Expressivity of UCPOP with the Efficiency of Graphplan , 1997, ECP.

[18]  Jussi Rintanen,et al.  A Planning Algorithm not based on Directional Search , 1998, KR.

[19]  Christer Bäckström,et al.  State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..

[20]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[21]  Lenhart K. Schubert,et al.  Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.

[22]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[23]  Peter van Beek,et al.  CPlan: A Constraint Programming Approach to Planning , 1999, AAAI/IAAI.

[24]  Jana Koehler,et al.  Handling of Inertia in a Planning System , 1999 .

[25]  Daniel S. Weld.  Recent Advances in AI Planning , 1999, AI Mag..

[26]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[27]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

[28]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[29]  Ulrich Scholz.  Extracting State Constraints from PDDL-like Planning Domains , 2000 .

[30]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

[31]  Jussi Rintanen,et al.  An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.

[32]  Malte Helmert,et al.  On the Implementation of MIPS , 2000 .

[33]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[34]  Malte Helmert,et al.  MIPS: The Model-Checking Integrated Planning System , 2001, AI Mag..

[35]  Subbarao Kambhampati,et al.  Planning as constraint satisfaction: Solving the planning graph by compiling it into CSP , 2001, Artif. Intell..

[36]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[37]  Sanjeev Khanna,et al.  Complexity classifications of Boolean constraint satisfaction problems , 2001, SIAM monographs on discrete mathematics and applications.

[38]  Malte Helmert,et al.  The Model Checking Integrated Planning System (MIPS) , 2001 .

[39]  Maria Fox,et al.  Extending {TIM} domain analysis to handle {ADL} constructs , 2002 .

[40]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[41]  Lenhart K. Schubert,et al.  Discovering State Constraints for Planning: DISCOPLAN , 2003 .

[42]  Jj Org Hoomann.  Where Ignoring Delete Lists Works: Local Search Topology in Planning Benchmarks , 2003 .

[43]  Malte Helmert,et al.  A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.

[44]  Subbarao Kambhampati,et al.  Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.

[45]  J. Urry.  Complexity , 2006, Interpreting Art.

[46]  Malte Helmert,et al.  The Fast Downward Planning System , 2006, J. Artif. Intell. Res..

[47]  Derek Long,et al.  Plan Constraints and Preferences in PDDL3 , 2006 .

[48]  Stephen F. Smith,et al.  Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, ICAPS 2006, Cumbria, UK, June 6-10, 2006 , 2006, ICAPS.

[49]  Jussi Rintanen,et al.  Compact Representation of Sets of Binary Constraints , 2006, ECAI.

[50]  Patrik Haslum,et al.  Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.

[51]  Yixin Chen,et al.  Long-Distance Mutual Exclusion for Propositional Planning , 2007, IJCAI.

[52]  Subbarao Kambhampati,et al.  A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems , 2007, ICAPS.

[53]  Patrik Haslum,et al.  Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.

[54]  Subbarao Kambhampati,et al.  An LP-Based Heuristic for Optimal Planning , 2007, CP.

[55]  Malte Helmert,et al.  Landmarks Revisited , 2008, AAAI.

[56]  Hector Geffner,et al.  Unifying the Causal Graph and Additive Heuristics , 2008, ICAPS.