Skip to main content

Exten: A system for computing default logic extensions

  • Knowledge Representation II
  • Conference paper
  • First Online:
PRICAI'96: Topics in Artificial Intelligence (PRICAI 1996)

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

Included in the following conference series:

Abstract

This paper descirbes Exten, an object-oriented system for default reasoning. Its current functionality includes the computation of extensions for various default logics.

The efficiency of the system is strongly increased by applying pruning techniques to the search tree. We motivate and present these techniques, and demonstrate that they can cut down the size of the search tree significantly. Quite importantly, they complement very well the recently developed stratification method [4] which has proven to be powerful and has been implemented in our system.

Exten supports experimentation with default logics allowing the user to set various parameters. Also it has been designed to be open to future enhancements, which are supported by its object-oriented design. Exten is part of our long-term effort to develop an integrated toolkit for intelligent information management based on nonmonotonic reasoning and belief revision methods.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Antoniou. Nonmonotonic Reasoning with Incomplete and Changing Informtion. MIT Press 1996 (forthcoming)

    Google Scholar 

  2. R. Ben-Eliyahu and I. Niemela (eds.). Applications and Implementations of Nonmonotonic Reasoning Systems. Proceedings of the IJCAI-95 Workshop.

    Google Scholar 

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

    Google Scholar 

  4. P. Cholewinski. Stratified Default Logic. In Proc. Computer Science Logic 1994, Springer LNCS 933, 456–470

    Google Scholar 

  5. P. Cholewinski, W. Marek, A. Mikitiuk and M. Truszczynski. Experimenting with default logic. In Proc. ICLP-95, MIT Press 1995

    Google Scholar 

  6. A. P. Courtney. Towards a Default Logic Workbench: Computing Extensions. Honours Thesis, Basser Department of Computer Science, University of Sydney 1995

    Google Scholar 

  7. J.P. Delgrande, T. Schaub and W.K. Jackson. Alternative Approaches to default logic. Artificial Intelligence 70 (1994): 167–237

    Google Scholar 

  8. S.P. Engelson, R. Feldman, M. Koppel, A. Nerode and J.B. Remmel. Frost: A forward chaining rule ordering system for reasoning with nonmonotonic rule systems. In [2]

    Google Scholar 

  9. M. Hopkins. Orderings and Extensions. In Proc. ESQUARU'93, Springer 1993, LNAI 747

    Google Scholar 

  10. E. Koutsofinos and S.C. North. Dot. Bell Laboratories, http://www.research.att.com/orgs/ssr/book/reuse

    Google Scholar 

  11. T. Linke and T. Schaub. Lemma Handling in Default Logic Theorem Proving. In Proc. Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Springer 1995, LNAI 946, 285–292

    Google Scholar 

  12. W. Lukaszewicz. Considerations of default logic: an alternative approach. Computational Intelligence 4, 1(1988): 1–16

    Google Scholar 

  13. A. Mikitiuk and M. Truszczynski. Constrained and rational default logics. In Proc. International Joint Conference on Artificial Intelligence 1995

    Google Scholar 

  14. I. Niemela and P. Simmons. Evaluating an algorithm for default reasoning. In [2].

    Google Scholar 

  15. D. Poole. A Logical Framework for Default Reasoning. Artificial Intelligence 36 (1988): 27–47

    Google Scholar 

  16. R. Reiter. A logic for default reasoning. Artificial Intelligence 13(1980): 81–132

    Google Scholar 

  17. V. Risch and C. Schwind. Tableau-Based Characterization and Theorem Proving for Default Logic. Journal of Automated Reasoning 13 (1994): 223–242

    Google Scholar 

  18. T. Schaub. A new methodology for query-answering in default logics via structure-oriented theorem proving. Journal of Automated Reasoning 1995 (forthcoming)

    Google Scholar 

  19. K. Schlechta. Directly Sceptical Inheritance cannot Capture the Intersection of Extensions. In Proc. GMD Workshop on Nonmonotonic Reasoning, GMD 1989

    Google Scholar 

  20. K. Wallace. Proof Truncation Techniques in Model Elimination Tableau-Based Theorem Proving. Ph.D. Thesis, Department of Computer Science, University of Newcastle 1994

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Norman Foo Randy Goebel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Courtney, A.P., Antoniou, G., Foo, N.Y. (1996). Exten: A system for computing default logic extensions. In: Foo, N., Goebel, R. (eds) PRICAI'96: Topics in Artificial Intelligence. PRICAI 1996. Lecture Notes in Computer Science, vol 1114. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61532-6_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-61532-6_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61532-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics