Skip to main content

Z-log: Applying System-Z

  • Conference paper
  • First Online:

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

Abstract

We present Z-log – a practical system that employs the system-Z [13] semantics. Z-log incurs polynomial cost for compilation and entailment in the horn and q-horn [2] cases. Z-log’s complexity is intractable in the unrestricted case – but intractable in the number of defaults that cause the violation of the q-horn property. We present here initial performance results over two alternative rulesbases. The results indicate that Z-log currently scales to problems on the order of 1000’s of propositional rules when the rules are in q-Horn form. We shall be applying Z-log in cognitive disease diagnosis.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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. Salem Benferhat, Didier Dubois, and Henri Prade. Representing default rules in possibilistic logic. KR 1992: 673–684, 1992.

    Google Scholar 

  2. E. Boros, Y. Crama, and P. Hammer. Polynomial-time inference of all valid implications for horn and related formulae. Annals of Mathematics and Artificial Intelligence, 1:21–32, 1990.

    Article  MATH  Google Scholar 

  3. R. Bourne and S. Parsons. Maximum entropy and variable strength defaults, 1999.

    Google Scholar 

  4. Thomas Eiter and Thomas Lukasiewicz. Complexity results for default reasoning from conditional knowledge bases. In KR2000: Principles of Knowledge Representation and Reasoning, pages 62–73, San Francisco, 2000. Morgan Kaufmann.

    Google Scholar 

  5. H. Gefner. Default reasoning: causal and conditional theories, 1992.

    Google Scholar 

  6. Moisés Goldszmidt, Paul Morris, and Judea Pearl. A maximum entropy approach to nonmonotonic reasoning. In Proceedings of the Eighth National Conference on Artificial Intelligence, Menlo Park, CA, 1990. AAAI Press.

    Google Scholar 

  7. M. Goldszmidt. Qualitative Probabilities: A Normative Framework for Commonsense Reasoning. PhD thesis, University of California, California, 1992.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. S. Kraus, D. Lehmann, and M. Magidor. Preferential models and cumulative logics. Artificial Intelligence, 44:167–207., 1990.

    Article  MathSciNet  MATH  Google Scholar 

  10. Daniel J. Lehmann. Another perspective on default reasoning. Annals of Mathematics and Artificial Intelligence, 15(1):61–82, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  11. Helena Lindgren. Decision support systems and diagnosing cognitive disorders. Master’s thesis, University of Umeå, Sweden, 2000.

    Google Scholar 

  12. Michael Minock and Hansi Kraus. Z-log: A system-z (and Ž)’ system’. Technical Report 02.05, The Univeristy of Umea, Umea, Sweden, May 2002.

    Google Scholar 

  13. J. Pearl. A natural ordering of defaults with tractable applications to default reasoning. Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, pages 121–135., 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minock, M., Kraus, H. (2002). Z-log: Applying System-Z. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_52

Download citation

  • DOI: https://doi.org/10.1007/3-540-45757-7_52

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44190-8

  • Online ISBN: 978-3-540-45757-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics