Skip to main content
SpringerLink
Log in
Book cover

Applications of Uncertainty Formalisms pp 354–378Cite as

The XRay system: An implementation platform for local query-answering in default logics

  • Chapter
  • First Online:

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

Abstract

We present an implementation platform for query-answering in default logics, supporting local proof procedures. We describe the salient features of the corresponding system, called XRay, and provide some major theoretical underpinnings. The deductive power of XRay stems from its usage of Prolog Technology Theorem Proving Techniques (PTTP). This is supported by further enhancements, such as default lemma handling, regularity-based truncations of the underlying search space, and further configurable features. The computational value of these enhancements is backed up by a series of experiments that provide us with valuable insights into their inuence on XRay’s performance. The generality of the approach, allowing for a (simultaneous) treatment of different default logics, stems from a novel model-based approach to consistency checking.

This is a revised and largely extended version of [28].

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. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, chapter 2, pages 89–148. Morgan Kaufmann Publishers, 1987.

    Google Scholar 

  2. Alain Baudry, Emmanuel Bezagu, Raphael Pieroni, and Denis Pithon. Analyseur syntaxique xray. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.

    Google Scholar 

  3. Richard Beilleau and Styve Jaumotte. Environnement de tests. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.

    Google Scholar 

  4. P. Besnard and T. Schaub. An approach to context-based default reasoning. Fundamenta Informaticae, 23(2–4):175–223, 1995.

    Article  MathSciNet  Google Scholar 

  5. W. Bibel. Automated Theorem Proving. Vieweg Verlag, Braunschweig, second edition, 1987.

    Book  Google Scholar 

  6. W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993.

    Google Scholar 

  7. N. Bidoit and C. Froidevaux. General logical databases and programs: Default logic semantics and stratification. Information and Computation, 91(1):15–54, 1991.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  9. S. Brüning and T. Schaub. A model-based approach to consistency-checking. In Z. Ras and M. Michalewicz, editors, Proceedings of the Ninth International Symposium on Methodologies for Intelligent Systems, volume 1079 of Lecture Notes in Artificial Intelligence, pages 315–324. Springer Verlag, 1996.

    Google Scholar 

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

    Google Scholar 

  11. P. Cholewiński, V. Marek, and M. Truszczyński. Default reasoning system DeReS. In Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning. Morgan Kaufmann Publishers, 1996.

    Google Scholar 

  12. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  15. C. Goller, R. Letz, K. Mayr, and J. Schumann. SETHEO V3.2: Recent Developments. In A. Bundy, editor, Proceedings of the Conference on Automated Deduction, volume 814 of Lecture Notes in Artificial Intelligence, pages 778–782. Springer Verlag, 1994. System abstract.

    Google Scholar 

  16. Michael Jolivet and Nicolas Jeanneau. Pretty printer. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.

    Google Scholar 

  17. T. Linke and T. Schaub. Lemma handling in default logic theorem provers. In C. Froidevaux and J. Kohlas, editors, Proceedings of European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, volume 946 of Lecture Notes in Artificial Intelligence, pages 285–292. Springer Verlag, 1995.

    Google Scholar 

  18. T. Linke and T. Schaub. Towards a classification of default logics. Journal of Applied Non-Classical Logics, 7(4), 1997. To appear.

    Google Scholar 

  19. D. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, New York, 1978.

    MATH  Google Scholar 

  20. W. Łukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.

    Article  Google Scholar 

  21. 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 

  22. 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 

  23. D. Poole. What the lottery paradox tells us about default reasoning. In R. Brachman, H. Levesque, and R. Reiter, editors, Proceedings of the First International Conference on the Principles of Knowledge Representation and Reasoning, pages 333–340, Los Altos, CA, May 1989. Morgan Kaufmann Publishers.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  25. T. Schaub. A new methodology for query-answering in default logics via structure-oriented theorem proving. Journal of Automated Reasoning, 15(1):95–165, 1995.

    Article  MathSciNet  Google Scholar 

  26. T. Schaub and S. Brüning. Prolog technology for default reasoning. In W. Wahlster, editor, Proceedings of the European Conference on Artificial Intelligence, pages 105–109. John Wiley & sons, 1996.

    Google Scholar 

  27. T. Schaub, S. Brüning, and P. Nicolas. XRay: A prolog technology theorem prover for default reasoning: A system description. In M. McRobbie and J. Slaney, editors, Proceedings of the Conference on Automated Deduction, volume 1104 of Lecture Notes in Artificial Intelligence, pages 293–297. Springer Verlag, 1996.

    Google Scholar 

  28. T. Schaub and P. Nicolas. An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation. In J. Dix, U. Furbach, and A. Nerode, editors, Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, volume 1265 of Lecture Notes in Artificial Intelligence, pages 442–453. Springer Verlag, 1997.

    Google Scholar 

  29. T. Schaub and P. Nicolas. An implementation platform for query-answering in default logics: Theoretical underpinnings. In Z. Ras, editor, Proceedings of the Tenth International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence. Springer Verlag, 1997. To appear.

    Google Scholar 

  30. C. Schwind. A tableaux-based theorem prover for a decidable subset of default logic. In M. Stickel, editor, Proceedings of the Conference on Automated Deduction. Springer Verlag, 1990.

    Google Scholar 

  31. M. Stickel. A Prolog technology theorem prover. In M. Stickel, editor, Proceedings of the Conference on Automated Deduction, volume 449 of Lecture Notes in Artificial Intelligence, pages 673–674. Springer Verlag, 1990.

    Google Scholar 

  32. M. Stickel. A Prolog technology theorem prover: A new exposition and implementation in prolog. In A. Miola, editor, Proceedings of the International Symposium on Design and Implemetation of Symbolic Computation Systems, volume 429 of Lecture Notes in Computer Science, pages 154–163. Springer Verlag, 1990.

    Chapter  Google Scholar 

  33. Jérome Vieron and Nicolas Torzec. Arbre de preuve. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Faculté de Sciences, Université d’Angers, 2 Boulevard Lavoisier, F-49045, Angers Cedex 01, France

    Pascal Nicolas & Torsten Schaub

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

    Torsten Schaub

Authors
  1. Pascal Nicolas
    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 College London, Gower Street, London, WC1E 6BT, UK

    Anthony Hunter

  2. Queen Mary and Westfield College, Department of Electronic Engineering, University of London, London, E1 4NS, UK

    Simon Parsons

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nicolas, P., Schaub, T. (1998). The XRay system: An implementation platform for local query-answering in default logics. In: Hunter, A., Parsons, S. (eds) Applications of Uncertainty Formalisms. Lecture Notes in Computer Science(), vol 1455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49426-X_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-49426-X_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65312-7

  • Online ISBN: 978-3-540-49426-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation