Abstract
We develop an approach for lemma handling in automated theorem provers for query-answering in default logics. This work builds on the concept of so-called lemma default rules. We show how different forms of such lemmas can be incorporated for reducing computational efforts.
On leave from IRISA, Campus de Beaulieu, 35042 Rennes Cedex, France
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
W. Bibel. Automated Theorem Proving. Vieweg, 1987.
G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50(2):183–205, 1991.
J. Delgrande, T. Schaub, W. Jackson. Alternative approaches to default logic. Artificial Intelligence, 70(1–2):167–237, 1994.
E. Eder. Relative Complexities of First Order Calculi. Vieweg, 1992.
Th. Linke and T. Schaub. Lemma handling in default logic theorem provers. Technical report, Faculty of Technology, University of Bielefeld, 1995. (in preparation).
D. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, 1978.
D. Makinson. General theory of cumulative inference. In M. Reinfrank et al, eds, Proc. 2nd Int. Workshop on Non-Monotonic Reasoning, 1–18. Springer, 1989.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.
T. Schaub. On constrained default theories. In B. Neumann, ed, Proc. of the European Conf. on Artificial Intelligence, p. 304–308. Wiley, 1992.
T. Schaub. A new methodology for query-answering in default logics via structure-oriented theorem proving. Journal of Automated Reasoning, 1995. Forthcoming.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Linke, T., Schaub, T. (1995). Lemma handling in default logic theorem provers. In: Froidevaux, C., Kohlas, J. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1995. Lecture Notes in Computer Science, vol 946. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60112-0_33
Download citation
DOI: https://doi.org/10.1007/3-540-60112-0_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60112-8
Online ISBN: 978-3-540-49438-6
eBook Packages: Springer Book Archive