Skip to main content
SpringerLink
Log in

Towards programming in default logic

  • Communications Session 2B Logic for AI
  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 1996)

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

Included in the following conference series:

Abstract

In this paper we describe a fragment of default logic suitable for encoding problems from other domains. We investigate a subclass of first order open default theories, which we call extensional default theories. This class of default theories allows easy and compact encodings of problems for experimenting with default reasoning systems. Because most existing systems for default reasoning assume that all input defaults are closed or propositional we show how to transform an extensional default theory to a closed first order default theory or a propositional default theory with same extensions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Antoniou, E. Langetepe, and V. Sperschneider. New proofs in default logic theory. Annals of Mathematics and Artificial Intelligence, 12:215–230, 1994.

    Google Scholar 

  2. R. Ben-Eliyahu and L. Palopoli. Reasoning with minimal models: Efficient algorithms and applications. In Proceedings of KR '94, San Francisco, CA, 1994. Morgan Kaufmann.

    Google Scholar 

  3. C. Bell, A. Nerode, R. Ng, W. Pugh, and V.S. Subrahmanian. Implementing stable semantics by linear programming. In A. Nerode and L. Pereira, editors, Logic programming and non-monotonic reasoning. MIT Press, 1993.

    Google Scholar 

  4. P. Cholewiński. Reasoning with stratified default theories. In Proceedings of LP-NMR'95. Berlin: Springer-Verlag, 1995. Lecture Notes in Computer Science 928.

    Google Scholar 

  5. P. Cholewiński. Stratified default theories. In Proceedings of CSL'94. Berlin: Springer-Verlag, 1995. Lecture Notes in Computer Science 933.

    Google Scholar 

  6. P. Cholewiński, W. Marek, A. Mikitiuk, and M. Truszczyński. Default reasoning system — an implementation of default reasoning. In preparation., 1995.

    Google Scholar 

  7. P. Cholewiński, W. Marek, A. Mikitiuk, and M. Truszczyński. Experimenting with nonmonotonic reasoning. In Proceedings of the 12th International Conference on Logic Programming, Cambridge, MA, 1995. MIT Press.

    Google Scholar 

  8. W. Chen, T. Swift, and D.S. Warren. Efficient top-down computation of queries under the well-founded semantics. Journal of Logic Programming, 1994.

    Google Scholar 

  9. M. Dixon and J. de Kleer. Massively parallel assumption-based truth maintenance. In Non-monotonic reasoning, pages 131–142. Berlin: Springer-Verlag, 1989. Lecture Notes in Artificial Intelligence, 346.

    Google Scholar 

  10. 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 Proceedings of the IJCAI-95 Workshop on Applications and Implementations of Nonmonotomic Reasonigs Systems, 1995.

    Google Scholar 

  11. M.L. Ginsberg. A circumscriptive theorem prover. In Non-monotonic reasoning, pages 100–114. Berlin: Springer-Verlag, 1989. Lecture Notes in Artificial Intelligence 346.

    Google Scholar 

  12. D. E. Knuth. The Stanford GraphBase: a platform for combinatorial computing. Addison-Wesley, 1993.

    Google Scholar 

  13. W. Marek, A. Nerode, and J. B. Remmel. Rule systems, well-orderings and forward chaining. Submitted for publication., 1995.

    Google Scholar 

  14. W. Marek and M. Truszczyński. Nonmonotonic logics; context-dependent reasoning. Berlin: Springer-Verlag, 1993.

    Google Scholar 

  15. I. Niemelä. Towards efficient default reasoning. In Proceedings of IJCAI-95, pages 312–318. Morgan Kaufmann, 1995.

    Google Scholar 

  16. I. Niemelä and P. Simmons. Evaluating an algorithm for default reasoning. In Proceedings of the IJCAI-95 Workshop on Applications and Implementations of Nonmonotomic Reasonigs Systems, 1995.

    Google Scholar 

  17. D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27–47, 1988.

    Google Scholar 

  18. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Google Scholar 

  19. J.A. Robinson. Machine-oriented logic based on resolution principle. Journal of the ACM, 12:23–41, 1965.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, 40506, Lexington, KY

    Paweł Cholewiński

Authors
  1. Paweł Cholewiński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zbigniew W. Raś Maciek Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cholewiński, P. (1996). Towards programming in default logic. In: Raś, Z.W., Michalewicz, M. (eds) Foundations of Intelligent Systems. ISMIS 1996. Lecture Notes in Computer Science, vol 1079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61286-6_147

Download citation

  • DOI: https://doi.org/10.1007/3-540-61286-6_147

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61286-5

  • Online ISBN: 978-3-540-68440-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation