Skip to main content
SpringerLink
Log in
Book cover

Australian Joint Conference on Artificial Intelligence

AI 1997: Advanced Topics in Artificial Intelligence pp 255–264Cite as

Representation results for default logics

  • Knowledge Representation and Reasoning
  • Conference paper
  • First Online:

  • 127 Accesses

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

Abstract

Normal forms play an important role in computer science, for example in the areas of logic and databases. This paper provides a study of normal forms for some prominent logics for default reasoning. In particular we show that in Constrained and in Justified Default Logic, semi-normal default theories can represent arbitrary default theories. The main result for Justified Default Logic requires the signature (logical language to be enhanced in order to obtain the desired outcome.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Antoniou. Nonmonotonic Reasoning. MIT Press 1997 (in press)

    Google Scholar 

  2. E.F. Codd. Further Normalization of the Data Base Relational Model. In Data Base Systems, Courant Computer Science Symposia Series 6, Prentice Hall 1972

    Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  5. V. Marek and M. Truszczynski. Nonmonotonic Logic. Springer 1993

    Google Scholar 

  6. A. Mikitiuk. Semi-representability of default theories in rational default logic. In the Proceedings of the 5th European Workshop on Logics in AI (JELIA'96) (in press)

    Google Scholar 

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

    Google Scholar 

  8. T. Schaub. On Constrained Default Theories. In the Proceedings of the 10th European Conference on Artificial Intelligence, Wiley 1992, 304–308

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Griffith University, 4111, CIT, QLD, Australia

    Grigoris Antoniou

Authors
  1. Grigoris Antoniou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Abdul Sattar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Antoniou, G. (1997). Representation results for default logics. In: Sattar, A. (eds) Advanced Topics in Artificial Intelligence. AI 1997. Lecture Notes in Computer Science, vol 1342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63797-4_78

Download citation

  • DOI: https://doi.org/10.1007/3-540-63797-4_78

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63797-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation