Advertisement

A deductive database approach to planning in uncertain environments

  • V. S. Subrahmanian
  • Charlie Ward
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1154)

Abstract

We present a formal model for reasoning about probabilistic information in STRIPS style planning. We then show that all probabilistic planning problems expressible in this model may be represented as equivalent probabilistic logic programs, yielding a sound and complete method for finding such plans.

Keywords

Logic Program Logic Programming Ground Atom Deductive Database Probabilistic Planning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Barbara, H. Garcia-Molina and D. Porter. (1991) A Probabilistic Relational Data Model, IEEE Trans. on Knowledge and Data Engineering.Google Scholar
  2. 2.
    Émile Borel. (1965) Elements of the Theory of Probability, Translated by John E. Freund. Prentice-Hall Inc.Google Scholar
  3. 3.
    A. Brogi, V.S. Subrahmanian and C. Zaniolo. The Logic of Total and Partial Order Plans: A Deductive Database Approach, accepted for publication in: Annals of Math and Artificial Intelligence.Google Scholar
  4. 4.
    D. Chapman. (1987) Planning for conjunctive goals, Artificial Intelligence, 32, 3, pps 333–378.Google Scholar
  5. 5.
    J. Chomicki. (1990) Polynomial-time computable queries in Temporal Deductive Databases, PODS'90.Google Scholar
  6. 6.
    R. Cavallo and M. Pittarelli. (1987) The Theory of Probabilistic Databases, Proc. VLDB 1987.Google Scholar
  7. 7.
    D. Dubois and H. Prade. (1988) Default Reasoning and Possibility Theory, Artificial Intelligence, 35, pp 243–257.Google Scholar
  8. 8.
    R. Fagin, J. Y. Halpern and N. Megiddo. (1989) A Logic for Reasoning About Probabilities, Information and Computation.Google Scholar
  9. 9.
    K. Erol and D.S. Nau and V.S. Subrahmanian. (1995) Complexity, Decidability and Undecidability Results for Domain-Independent Planning. Artificial Intelligence Journal, 76, 1–2, pps 75–88, 1995.Google Scholar
  10. 10.
    Fenstad, J.E., The structure of probabilities defined on first-order languages, Studies in inductive logic and probabilities, volume 2, University of California Press, (Ed. R.C. Jeffrey), 1980, pp. 251–262.Google Scholar
  11. 11.
    M. Gelfond and V. Lifschitz. (1993) Representing action and change by logic programs, Journal of Logic programming, 17, pps 301–322.Google Scholar
  12. 12.
    U. Guntzer, W. Kiessling and H. Thone. (1991) New Directions for Uncertainty Reasoning in Deductive Databases, Proc. 1991 ACM SIGMOD, pp 178–187.Google Scholar
  13. 13.
    W. Kiessling, H. Thone and U. Guntzer. (1992) Database Support for Problematic Knowledge, Proc. EDBT-92, pps 421–436, Springer LNCS Vol. 580.Google Scholar
  14. 14.
    M. Kifer and A. Li. (1988) On the Semantics of Rule-Based Expert Systems with Uncertainty, 2-nd Intl. Conf. on Database Theory, Springer Verlag LNCS 326, (eds. M. Gyssens, J. Paredaens, D. Van Gucht), Bruges, Belgium, pp. 102–117.Google Scholar
  15. 15.
    M. Kifer and E. Lozinskii. (1989) RI: A Logic for Reasoning with Inconsistency, 4-th Symposium on Logic in Computer Science, Asilomar, CA, pp. 253–262.Google Scholar
  16. 16.
    N. Kushmerick, S. Hanks and D.S. Weld. (1995) An algorithm for probabilistic planning. Artificial Intelligence Journal, 76, 1–2, Special Volume on Planning and Scheduling, pp 239–286.Google Scholar
  17. 17.
    Lakshmanan, Laks V.S. An epistemic foundation for logic programming with uncertainty. Technical report, Concordia University, Montreal, Canada, 1994. Preliminary version to appear in 14th Conf. on the Foundations of Software Technology and Theoretical Computer Science, December 1994.Google Scholar
  18. 18.
    Lakshmanan, Laks V.S. and Sadri, F. Probabilistic deductive databases. In Proc. International Logic Programming Symposium, pages 254–268, Ithaca, NY, November 1994. MIT Press.Google Scholar
  19. 19.
    Lakshmanan, Laks V.S. and Sadri, F. Modeling uncertainty in deductive databases. In Proc. Int. Conf. on Database Expert Systems and Applications (DEXA '94), Athens, Greece, September 1994. Springer Verlag. Lecture Notes in Computer Science, vol. 856.Google Scholar
  20. 20.
    R. Ng and V.S. Subrahmanian. (1993) Probabilistic Logic Programming, Information and Computation, 101, 2, pps 150–201, 1993.Google Scholar
  21. 21.
    R. Ng and V.S. Subrahmanian. (1995) Stable Semantics for Probabilistic Deductive Databases, Information and Computation, 110, 1, pps 42–83.Google Scholar
  22. 22.
    J. Pinto and R. Reiter. (1993) Temporal Reasoning in Logic Programming: A Case for the Situation Calculus, Proc. 1993 Intl. Conf. on Logic Programming, pps 203–221, MIT Press.Google Scholar
  23. 23.
    H. Schmidt, W. Kiessling, U. Guntzer and R. Bayer. (1987) Combining Deduction by Uncertainty with the Power of Magic, Proc. DOOD-89, pps 205–224, Kyoto, Japan.Google Scholar
  24. 24.
    V.S. Subrahmanian. (1995) Invited Talk, 1995 Intl. Conf. on Uncertainty in AI, Montreal, Canada, Aug. 1995.Google Scholar
  25. 25.
    V.S. Subrahmanian and C. Zaniolo. Relating Stable Models and AI Planning Domains, accepted for publication in: Proc. 1995 Intl. Conf. on Logic Programming, Tokyo, Japan.Google Scholar
  26. 26.
    Peter Walley. (1991) Statistical reasoning with imprecise probabilities. Chapman and Hall.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • V. S. Subrahmanian
    • 1
    • 2
  • Charlie Ward
    • 1
    • 2
  1. 1.Department of Computer ScienceUniversity of MarylandCollege ParkUSA
  2. 2.Institute for Advanced Computer StudiesUniversity of MarylandCollege ParkUSA

Personalised recommendations