Equivalence and Tractability Results for SAS+ Planning

This specification discloses a copying apparatus having an original feeding mechanism for feeding originals by moving the originals on the surface of an original supporting member, characterized in that discharging means acts on the original supporting member from that side thereof opposite to the original supporting side of the original supporting member to discharge the original supporting surface.

[1]  P. Hayes.  The frame problem and related problems in artificial intelligence , 1971 .

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

[3]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection and Plan Validation , 1992, AAAI.

[4]  Tom Bylander,et al.  Tractability and artificial intelligence , 1991, J. Exp. Theor. Artif. Intell..

[5]  Craig A. Knoblock,et al.  A Theory of Abstraction for Hierarchical Planning , 1990 .

[6]  Allen Newell,et al.  GPS, a program that simulates human thought , 1995 .

[7]  Lennart Ljung,et al.  Facing the Challenge of Computer Science in the Industrial Applications of Control , 1991 .

[8]  Bernhard Nebel,et al.  On the Computational Complexity of Planning and Story Understanding , 1992, ECAI.

[9]  Christer Bäckström,et al.  Planning in polynomial time: the SAS‐PUBS class , 1991, Comput. Intell..

[10]  Christer Bäckström.  A Representation of Coordinated Actions Characterized by Interval Valued Conditions , 1988, ISMIS.

[11]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[12]  Ron Shamir,et al.  Algorithms and Complexity for Reasoning about Time , 1992, AAAI.

[13]  Erik Sandewall,et al.  A Representation of Action Structures , 1986, AAAI.

[14]  Christer Backstrom,et al.  Computational Complexity of Reasoning about Plans , 1992 .

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

[16]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[17]  Christer Bäckström,et al.  Parallel Non-Binary Planning in Polynomial Time , 1991, IJCAI.

[18]  C. Backstrom,et al.  On the planning problem in sequential control , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[19]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[20]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

[21]  Panos J. Antsaklis,et al.  A system and control theoretic perspective on artificial intelligence planning systems , 1989, Appl. Artif. Intell..