Abstract
In many AI applications default reasoning plays an important role since many subtasks involve reasoning from incomplete information. This is why there is a great need for systematic methods that allow us to integrate default reasoning capabilities. In fact, the two last decades have provided us with a profound understanding of the underlying problems and have resulted in well-understood formal approaches to default reasoning. Therefore, we are now ready to build advanced default reasoning systems. For this undertaking, we have chosen Reiter’s default logic (Reiter, 1980) as our point of departure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Astrachan, O. and Stickel, M. (1992). Caching and lemmaizing in model elimination theorem provers. In Kapur, D., editor, Proceedings of the Conference on Automated Deduction,volume 607 of Lecture Notes in Artificial Intelligence,pages 224–238. Springer Verlag.
Bibel, W. (1987). Automated Theorem Proving. Vieweg Verlag, Braunschweig, second edition.
Bibel, W. (1993). Deduction: Automated Logic. Academic Press, London.
Bibel, W., Bruning, S., Egly, U., and Rath, T. (1994). KoMeT. In Bundy, A., editor, Proceedings of the Conference on Automated Deduction, number 814 in Lecture Notes in Artificial Intelligence, pages 783–787. Springer Verlag. System description.
Brewka, G. (1991). Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50 (2): 183–205.
Brüning, S. and Schaub, T. (1996). A model-based approach to consistency-checking. In Ras, Z. and Michalewicz, M., 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.
Delgrande, J., Schaub, T., and Jackson, W. (1994). Alternative approaches to default logic. Artificial Intelligence, 70 (1–2): 167–237.
Eder, E. (1992). Relative Complexities of First Order Calculi. Vieweg Verlag, Braunschweig.
Letz, R., Bayerl, S., Schumann, J., and Bibel, W. (1992). SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, 8 (2): 183–212.
Letz, R., Mayr, K., and Goller, C. (1994). Controlled integrations of the cut rule into connection tableau calculi. Journal of Automated Reasoning, 13 (3): 297–338.
Linke, T. and Schaub, T. (1995). Lemma handling in default logic theorem provers. In Froidevaux, C. and Kohlas, J., 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.
Lukaszewicz, W. (1988). Considerations on default logic — an alternative approach. Computational Intelligence, 4: 1–16.
Mikitiuk, A. and Truszczyriski, M. (1993). Rational default logic and disjunctive logic programming. In Nerode, A. and Pereira, L., editors, Proceedings of the Second International Workshop on logic Programming and Non-monotonic Reasoning.,pages 283–299. MIT Press.
Nicolas, P. and Schaub, T. (1998). The XRay system: An implementation platform for local query-answering in default logics. In Hunter, A. and Parsons, S., editors, Applications of Uncertainty Formalisms in Information Systems,volume 1455 of Lecture Notes in Artificial Intelligence,pages 354–378. Springer Verlag.
Poole, D. (1988). A logical framework for default reasoning. Artificial Intelligence, 36: 27–47.
Reiter, R. (1980). A logic for default reasoning. Artificial Intelligence, 13 (1–2): 81–132.
Rothschild, A. (1993). Algorithmische Untersuchungen zu Defaultlogiken. Diplomarbeit, FG Intellektik, FB Informatik, TH Darmstadt, Alexanderstraße 10, D-64283 Darmstadt, Germany.
Schaub, T. (1992). On constrained default theories. In Neumann, B., editor, Proceedings of the European Conference on Artificial Intelligence,pages 304–308. John Wiley and sons.
Schaub, T. (1995). A new methodology for query-answering in default logics via structure-oriented theorem proving. Journal of Automated Reasoning, 15 (1): 95–165.
Schaub, T. and Brüning, S. (1996). Prolog technology for default reasoning. In Wahlster, W., editor, Proceedings of the European Conference on Artificial Intelligence,pages 105–109. John Wiley and sons.
Schaub, T. and Nicolas, P. (1997). An implementation platform for query-answering in default logics: Theoretical underpinnings. In Ras, Z. and Skowron, A., editors, Proceedings of the Tenth International Symposium on Methodologies for Intelligent Systems, Lecture Notes in Artificial Intelligence. Springer Verlag.
Schwind, C. (1990). A tableaux-based theorem prover for a decidable subset of default logic. In Stickel, M., editor, Proceedings of the Conference on Automated Deduction. Springer Verlag.
Stickel, M. (1984). A Prolog technology theorem prover. New Generation Computing, 2: 371–383.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Brüning, S., Schaub, T. (2000). A Connection Calculus for Handling Incomplete Information. In: Hölldobler, S. (eds) Intellectics and Computational Logic. Applied Logic Series, vol 19. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9383-0_4
Download citation
DOI: https://doi.org/10.1007/978-94-015-9383-0_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5438-8
Online ISBN: 978-94-015-9383-0
eBook Packages: Springer Book Archive