Abstract
We develop a method for query-answering from prioritized default theories. This approach allows for computing queries in a prioritized variant of default logic that has been recently proposed by Brewka. This is accomplished by extending an approach to query-answering in conventional default logics based on the idea of structure-oriented theorem proving.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
W. Bibel. Automated Theorem Proving. Vieweg Verlag, 1987.
G. Brewka. Adding priorities and specificity to default logic. In L. Pereira and D. Pearce, editors, Proc. of JELIA '94. Springer, 1994. To appear.
J. Delgrande and T. Schaub. A general approach to specificity in default reasoning. In J. Doyle, P. Torasso, and E. Sandewall, eds, Proc. of KR'94, p. 146–157. Morgan Kaufmann, 1994.
A. Rothschild and T. Schaub. A computational approach to default logics. In G. Brewka and C. Witteveen, eds, Dutch/German Workshop on Nonmonotonic Reasoning, p. 1–14, 1993.
T. Schaub. A new methodology for query-answering in default logics via structure-oriented theorem proving. Technical report, IRISA, 1994. Forthcoming.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schaub, T. (1994). Computing queries from prioritized default theories. In: Raś, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1994. Lecture Notes in Computer Science, vol 869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58495-1_58
Download citation
DOI: https://doi.org/10.1007/3-540-58495-1_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58495-7
Online ISBN: 978-3-540-49010-4
eBook Packages: Springer Book Archive