Blocks World revisited

[1]  Patrik Haslum,et al.  Extending TALplanner with Concurrency and Resources , 2000, ECAI.

[2]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[3]  Patrick Doherty,et al.  TALplanner: an empirical investigation of a temporal logic-based forward chaining planner , 1999, Proceedings. Sixth International Workshop on Temporal Representation and Reasoning. TIME-99.

[4]  Bart Selman,et al.  The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework , 1998, AIPS.

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

[6]  Enrico Giunchiglia,et al.  Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability , 1998, AAAI/IAAI.

[7]  John K. Slaney,et al.  On the Hardness of Decision and Optimisation Problems , 1998, ECAI.

[8]  Michael D. Ernst,et al.  Automatic SAT-Compilation of Planning Problems , 1997, IJCAI.

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

[10]  John K. Slaney,et al.  Linear Time Near-Optimal Planning in the Blocks World , 1996, AAAI/IAAI, Vol. 2.

[11]  Fahiem Bacchus,et al.  Using temporal logic to control search in a forward chaining planner , 1996 .

[12]  T. Slavin.  VIRTUAL PORT OF CALL , 1996 .

[13]  Christer Bäckström,et al.  Five years of tractable planning , 1996 .

[14]  S. Kambhampati,et al.  Universal classical planner: an algorithm for unifying state-space and plan-space planning , 1996 .

[15]  Subbarao Kambhampati,et al.  Learning search control rules for plan-space planners: factors affecting the performance , 1996 .

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

[17]  Marcel Schoppers,et al.  Estimating Reaction Plan Size , 1994, AAAI.

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

[19]  Bart Selman,et al.  Near-Optimal Plans, Tractability, and Reactivity , 1994, KR.

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

[21]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..

[22]  Stephen V. Chenoweth.  On the NP-ardness of blocks world , 1991 .

[23]  Dana S. Nau,et al.  Complexity Results for Blocks-World Planning , 1991, AAAI.

[24]  Jaime G. Carbonell,et al.  Learning effective search control knowledge: an explanation-based approach , 1988 .

[25]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

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

[27]  R. A. Silverman,et al.  Special functions and their applications , 1966 .