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].
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
Richard Beilleau and Styve Jaumotte. Environnement de tests. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.
P. Besnard and T. Schaub. An approach to context-based default reasoning. Fundamenta Informaticae, 23(2–4):175–223, 1995.
W. Bibel. Automated Theorem Proving. Vieweg Verlag, Braunschweig, second edition, 1987.
W. Bibel. Deduction: Automated Logic. Academic Press, London, 1993.
N. Bidoit and C. Froidevaux. General logical databases and programs: Default logic semantics and stratification. Information and Computation, 91(1):15–54, 1991.
G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50(2):183–205, 1991.
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.
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.
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.
M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201–215, 1960.
J. Delgrande, T. Schaub, and W. Jackson. Alternative approaches to default logic. Artificial Intelligence, 70(1–2):167–237, 1994.
L. Giordano and A. Martinelli. On cumulative default logics. Artificial Intelligence, 66(1):161–179, 1994.
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.
Michael Jolivet and Nicolas Jeanneau. Pretty printer. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.
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.
T. Linke and T. Schaub. Towards a classification of default logics. Journal of Applied Non-Classical Logics, 7(4), 1997. To appear.
D. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, New York, 1978.
W. Łukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.
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.
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.
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.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.
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.
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.
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.
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.
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.
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.
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.
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.
Jérome Vieron and Nicolas Torzec. Arbre de preuve. Student project report (licence informatique), Department of Computer Science, University of Angers, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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