Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 1999: Logic Programming and Nonmonotonic Reasoning pp 247–261Cite as

Default Reasoning via Blocking Sets

  • Conference paper
  • First Online:

  • 267 Accesses

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

Abstract

. We present a new approach to reasoning with default logic that aims at Reiter’s original approach, whenever there is no source for incoherence. We accomplish this by shifting the emphasis from the application of individual default rules to that of the joint application of a default rule together with rules supporting this application. This allows for reasoning in an incremental yet compositional fashion, without giving up the expressiveness needed for knowledge representation. Technically, our approach differs from others in that it guarantees the existence of extensions without requiring semi-monotonicity.

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

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. C. Baral and V. Subrahmanian. Duality between alternative semantics of logic programs and nonmonotonic formalisms. In First International Workshop on Logic Programming and Nonmonotonic Reasoning, pages 69–86. MIT Press, 1991.

    Google Scholar 

  2. G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50(2):183–205, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. G. Brewka and G. Gottlob. Well-founded semantics for default logic,. Fundamenta Informaticae,, 31(3-4):221–236, 1997.

    MATH  MathSciNet  Google Scholar 

  4. P. Cholewiński, V. Marek, A. Mikitiuk, and M. Truszczy_nski. Experimenting with nonmonotonic reasoning. In Proceedings of the International Conference on Logic Programming. MIT Press, 1995.

    Google Scholar 

  5. J. Delgrande, T. Schaub, and W. Jackson. Alternative approaches to default logic. Artificial Intelligence, 70(1-2):167–237, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  6. Y. Dimopoulos. The computational value of joint consistency. In L. Pereira and D. Pearce, editors, European Workshop on Logics in Arti_cial Intelligence (JELIA’94), volume 838 of Lecture Notes in Artificial Intelligence, pages 50–65. Springer Verlag, 1994.

    Google Scholar 

  7. D. Etherington. Reasoning with Incomplete Information: Investigations of Non-Monotonic Reasoning. PhD thesis, Department of Computer Science, University Default Reasoning via Blocking Sets 261 of British Columbia, Vancouver, BC, 1986. Revised Version appeared as: Research Notes in AI, Pitman.

    Google Scholar 

  8. C. Froidevaux and J. Mengin. Default logic: A unified view. Computational Intelligence, 10(3):331–369, 1994.

    Article  Google Scholar 

  9. L. Giordano and A. Martinelli. On cumulative default logics. Artificial Intelligence, 66(1):161–179, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Gottlob. Complexity results for nonmonotonic logics. Journal of Logic and Computation, 2(3):397–425, June 1992.

    Article  MATH  MathSciNet  Google Scholar 

  11. F. Lévy. Computing extensions of default theories. In R. Kruse and P. Siegel, editors, Proceedings of the European Conference on Symbolic and Quantitative Approaches for Uncertainty, volume 548 of Lecture Notes in Computer Science, pages 219–226. Springer Verlag, 1991.

    Google Scholar 

  12. T. Linke and T. Schaub. An approach to query-answering in Reiter’s default logic and the underlying existence of extensions problem. In J. Dix, L. Fariñas del Cerro and U. Furbach, editors, Logics in Artificial Intelligence, Proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, volume 1489 of Lecture Notes in Artificial Intelligence, pages 233–247. Springer Verlag, 1998.

    Google Scholar 

  13. Th. Linke. New Foundations for Automation of Default Reasoning. Dissertation, University of Bielefeld, 1999.

    Google Scholar 

  14. W. Lukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.

    Article  MathSciNet  Google Scholar 

  15. W. Marek and M. Truszczyński. Nonmonotonic logic: context-dependent reasoning. Artifical Intelligence. Springer Verlag, 1993.

    Google Scholar 

  16. W. Marek and M. Truszczyński. Normal form results for default logics. In G. Brewka, K. Jantke, and P. Schmitt, editors, Nonmonotonic and Inductive Logic, volume 659 of Lecture Notes in Artificial Intelligence, pages 153–174. Springer Verlag,1993.

    Google Scholar 

  17. A. Mikitiuk and M. Truszczyński. Rational default logic and disjunctive logic programming. In A. Nerode and L. Pereira, editors, Proceedings of the Second International Workshop on logic Programming and Non-monotonic Reasoning., pages 283–299. MIT Press, 1993.

    Google Scholar 

  18. I. Niemelä. Towards efficient default reasoning. In C. Mellish, editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 312–318.Morgan Kaufmann Publishers, 1995.

    Google Scholar 

  19. H. Przymusinska and T. Przymusinski. Stationary default extensions. Fundamenta Informaticae, 21(1-2):76–87, 1994.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  21. V. Risch. Analytic tableaux for default logics. Journal of Applied Non-Classical Logics, 6(1):71–88, 1996.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Potsdam, Institut für Informatik, Postfach, 60 15 53, D-14415, Potsdam

    Thomas Linke & Torsten Schaub

Authors
  1. Thomas Linke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at El Paso, El Paso, TX, 79916, USA

    Michael Gelfond

  2. Institut für Informationssysteme 184/2, Technische Universität Wien, Favoritenstrβe 9-11, A-1040, Vienna, Austria

    Nicola Leone  & Gerald Pfeifer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Linke, T., Schaub, T. (1999). Default Reasoning via Blocking Sets. In: Gelfond, M., Leone, N., Pfeifer, G. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 1999. Lecture Notes in Computer Science(), vol 1730. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46767-X_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-46767-X_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66749-0

  • Online ISBN: 978-3-540-46767-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation