Skip to main content

USA-Smart: Improving the Quality of Plans in Answer Set Planning

  • Conference paper
Practical Aspects of Declarative Languages (PADL 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3057))

Included in the following conference series:

Abstract

In this paper we show how CR-Prolog, a recent extension of A-Prolog, was used in the successor of USA-Advisor (USA-Smart) in order to improve the quality of the plans returned. The general problem that we address is that of improving the quality of plans by taking in consideration statements that describe “most desirable” plans. We believe that USA-Smart proves that CR-Prolog provides a simple, elegant, and flexible solution to this problem, and can be easily applied to any planning domain. We also discuss how alternative extensions of A-Prolog can be used to obtain similar results.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In: Doherty, P., McCarthy, J., Williams, M.-A. (eds.) International Symposium on Logical Formalization of Commonsense Reasoning, March 2003. AAAI 2003 Spring Symposium Series (2003)

    Google Scholar 

  2. Balduccini, M., Gelfond, M., Nogueira, M., Watson, R.: The USAAdvisor: A Case Study in Answer Set Planning. In: Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, September 2001, pp. 439–442 (2001)

    Google Scholar 

  3. Balduccini, M., Mellarkod, V.S.: CR-Prolog2: CR-Prolog with Ordered Disjunction. In: ASP 2003 Answer Set Programming: Advances in Theory and Implementation, September 2003. CEUR Workshop Proceedings, vol. 78 (2003)

    Google Scholar 

  4. Brewka, G.: Logic programming with ordered disjunction. In: Proceedings of AAAI 2002 (2002)

    Google Scholar 

  5. Brewka, G., Niemela, I., Syrjanen, T.: Implementing ordered disjunction using answer set solvers for normal programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, p. 444. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  6. Calimeri, F., Dell’Armi, T., Eiter, T., Faber, W., Gottlob, G., Ianni, G., Ielpa, G., Koch, C., Leone, N., Perri, S., Pfeifer, G., Polleres, A.: The dlv system. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, p. 537. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Dimopoulos, Y., Koehler, J., Nebel, B.: Encoding planning problems in nonmonotonic logic programs. In: Steel, S. (ed.) ECP 1997. LNCS, vol. 1348, pp. 169–181. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  8. Eiter, T., Faber, W., Leone, N., Pfeifer, G., Polleres, A.: Answer set planning under action costs. Journal of Artificial Intelligence Research 19, 25–71 (2003)

    MATH  MathSciNet  Google Scholar 

  9. Erdogan, S., Lifschitz, V.: Definitions in answer set programming. In: Proceedings of LPNMR-7 (January 2004)

    Google Scholar 

  10. Gelfond, M.: Representing knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol. 2408, pp. 413–451. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. In: New Generation Computing, pp. 365–385 (1991)

    Google Scholar 

  12. Heljanko, K.: Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri nets. Fundamenta Informaticae 37(3), 247–268 (1999)

    MATH  MathSciNet  Google Scholar 

  13. Lifschitz, V.: Action Languages, Answer Sets, and Planning. The Logic Programming Paradigm: a 25-Year Perspective, pp. 357–373. Springer, Berlin (1999)

    Google Scholar 

  14. Lin, F., Zhao, Y.: Assat: Computing answer sets of a logic program by sat solvers. In: Proceedings of AAAI 2002 (2002)

    Google Scholar 

  15. Niemela, I., Simons, P., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)

    Article  MathSciNet  Google Scholar 

  16. Nogueira, M.: Building Knowledge Systems in A-Prolog. PhD thesis, University of Texas at El Paso (May 2003)

    Google Scholar 

  17. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog decision support system for the Space Shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Pontelli, E., Balduccini, M., Bermudez, F.: Non-monotonic reasoning on beowulf platforms. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 37–57. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Soininen, T., Niemela, I.: Developing a declarative rule language for applications in product configuration. In: Proceedings of the First International Workshop on Practical Aspects of Declarative Languages (May 1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Balduccini, M. (2004). USA-Smart: Improving the Quality of Plans in Answer Set Planning. In: Jayaraman, B. (eds) Practical Aspects of Declarative Languages. PADL 2004. Lecture Notes in Computer Science, vol 3057. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24836-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24836-1_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22253-8

  • Online ISBN: 978-3-540-24836-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics