Skip to main content

Compiling Default Theory into Extended Logic Programming

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1952))

Abstract

In this paper we demonstrate how a default theory, expres- sed through a set of conditional defaults that the agent possesses, can be traduced into extended logic programs. Additionally, the proposed trans- lation allows to evaluate the degree of epistemic surprise of a proposition (or a conjunction of propositions) øon a meta-logical level.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. J. Alferes and L. M. Pereira. Reasoning with Logic Programming. Springer-Verlag, 1996.

    Google Scholar 

  2. J. Delgrande and T. Schaub. Compiling specificity into approaches to nonmonotonic reasoning. Artificial Intelligence, 90(1–2):301–348, Dec. 1997.

    Article  MathSciNet  Google Scholar 

  3. H. Geffner. Default Reasoning. MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  4. A. V. Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620–650, July 1991.

    MathSciNet  Google Scholar 

  5. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. A. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference on Logic Programming, pages 1070–1080, Cambridge, Massachusetts, 1988. The MIT Press.

    Google Scholar 

  6. M. Gelfond and V. Lifschitz. Logic Program with Classical Negation. In D. H. D. Warren and P. Szeredi, editors, Proceedings of the 7th Int. Conf. on Logic Programming, pages 579–597. MIT, June 1990.

    Google Scholar 

  7. M. Goldszmidt and J. Pearl. Qualitative probabilities for default reasoning, belief revision, and causal modeling. Artificial Intelligence, 84(1–2):57–112, 1996.

    Article  MathSciNet  Google Scholar 

  8. L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, Proceedings of the 10th European Conference on Artificial Intelligence, pages 102–106, Vienna, Austria, Aug. 1992. John Wiley & Sons.

    Google Scholar 

  9. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2): 81–132, Apr. 1980.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Borges Garcia, B., Pereira Lopes, G., Varejão, F. (2000). Compiling Default Theory into Extended Logic Programming. In: Monard, M.C., Sichman, J.S. (eds) Advances in Artificial Intelligence. IBERAMIA SBIA 2000 2000. Lecture Notes in Computer Science(), vol 1952. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44399-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-44399-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41276-2

  • Online ISBN: 978-3-540-44399-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics