Skip to main content
SpringerLink
Log in

Using Abstrips Abstractions -- Where do We Stand?

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Many experimental and theoretical results have been provided which analyze the effects of Abstrips abstractions in search problems. Some of these results are positive, i.e. show gains in efficiency; some are negative and seem to contradict, at least partially, the positive results. The aim of this note is to provide an analysis of how Abstrips abstractions work, and use it to provide an explanation of the main results which can be found in the literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Bundy, A., Giunchiglia, F., Sebastiani, R. & Walsh, T. (1996a). Calculating Criticalities. Artificial Intelligence 88(1–2).

  • Bundy, A., Giunchiglia, F., Sebastiani, R. & Walsh, T. (1996b). Computing Abstraction Hierarchies by Numerical Simulation. In Proc. of the 13th National Conference on Artificial Intelligence.

  • Bundy, A., Giunchiglia, F. & Walsh, T. (1990). Building Abstractions. In Working Notes of AAAI Workshop on Automatic Generation of Approximations and Abstractions. DAI Research Paper no. 506, University of Edinburgh. Also IRST-Technical Report 9007-02.

  • Bäckström, C. & Jonsson, P. (1995). Planning with Abstraction Hierarchies can be Exponentially Less Efficient. In Proc. of the 14th International Joint Conference on Artificial Intelligence, 1599-1604.

  • Bacchus, F. & Yang, Q. (1994). Downward Refinement and the Efficiency of Hierarchical Problem Solving. Artificial Intelligence 71: 43-100.

    Google Scholar 

  • Green, C. (1969). Application of Theorem Proving to Problem Solving. In Proc. of the 1st International Joint Conference on Artificial Intelligence, 219-239.

  • Giunchiglia, Fausto & Villafiorita, Adolfo (1996). ABSFOL: A Proof Checker with Abstraction. In McRobbie, M.A. and Slaney, J.K. (eds.) Proceedings of the 13th Conference on Automated Deduction (CADE-13), volume 1104 of Lecture Notes in Artificial Intelligence, 136-150. Springer: New Brunswick, New Jersey, USA Also IRST-Technical Report 9602-20, IRST, Italy and DIST-Technical Report 96-0036, DIST, University of Genova, Italy.

    Google Scholar 

  • Giunchiglia, F. & Walsh, T. (1991a). Mapping Back. Technical Report 9111-02, IRST, Trento, Italy. Revised version of IRST-Technical Report no. 8911-16. Also DAI Research Paper, University of Edinburgh.

    Google Scholar 

  • Giunchiglia, F. & Walsh, T. (1991b). Using Abstraction. In Proc. of the 8th Conference of the Society for the Study of Artificial Intelligence and Simulation of Behaviour. Leeds, UK. Also IRST-Technical Report 9010-08 and DAI Research Paper 515, University of Edinburgh.

  • Giunchiglia, F. & Walsh, T. (1992a). A Theory of Abstraction. Artificial Intelligence 57(2–3): 323-390. Also IRST-Technical Report 9001-14, IRST, Trento, Italy.

    Google Scholar 

  • Giunchiglia, F. & Walsh, T. (1992b). Tree Subsumption: Reasoning with Outlines. In Proc. 10th European Conference on Artificial Intelligence ECAI-92, 77-81, Vienna, Austria. Also IRST-Technical Report 9205-01, IRST, Trento, Italy.

  • Knoblock, C.A. (1991a). Automatically Generating Abstractions for Problem Solving. PhD thesis, School of Computer Science.

  • Knoblock, C.A. (1991b). Search Reduction in Hierarchical Problem Solving. In Proc. of the 9th National Conference on Artificial Intelligence, 686-691.

  • Knoblock, C.A. (1992). An Analysis of ABSTRIPS. In Hendler, J. (ed.) Artificial Intelligence Planning Systems, Proceedings of the First International Conference. Maryland.

  • Knoblock, C.A. (1994). Automatically Generating Abstractions for Planning. Artificial Intelligence 68: 243-302.

    Google Scholar 

  • Lifschitz, V. (1986). On the Semantics of Strips. In Georgeff, M. and Lansky, A. (eds.) Reasoning about Actions and Plans, Proceedings of the 1986 Workshop, 1-9. Morgan Kaufmann Publ. Inc.

  • Plaisted, D. (1990). Mechanical Theorem Solving. In Formal Techniques in Artificial Intelligence. Elsevier Science Publishers B.V.

  • Sacerdoti, E.D. (1973). Planning in a Hierarchy of Abstraction Spaces. In Proceedings of the 3rd International Joint Conference on Artificial Intelligence.

  • Smith, D.E. & Peot, M.A. (1992). A Critical Look at Knoblock's Hierarchy Mechanism. In Proc. 1st International Conference Artificial Intelligence Planning Systems (AIPS-92), 307-308.

  • Yang, Q., Tenenberg, J.D. & Woods, S. (1996). On the Implementation and Evaluation of AbTweak. Computational Intelligence 12.

Download references

Author information

Authors and Affiliations

  1. IRST, Povo, 38100 Trento, Italy

    Fausto Giunchiglia

  2. Mechanized Reasoning Group, DISA, University of Trento, Via Inama 5, 38100, Trento, Italy

    Fausto Giunchiglia

Authors
  1. Fausto Giunchiglia
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Giunchiglia, F. Using Abstrips Abstractions -- Where do We Stand?. Artificial Intelligence Review 13, 201–213 (1999). https://doi.org/10.1023/A:1006507609248

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1006507609248

Search

Navigation