Abstract
The purpose of this paper is to investigate a new methodology for default reasoning in presence of priorities which are represented by an arbitrary partial order on default rules. In a previous work, we have defined an alternative approach for characterizing extensions in prioritized default theories initially proposed by Brewka. We present here another approach for computing default proofs for query answering in prioritized normal default logic.
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
F. Baader and B. Hollunder. How to prefer more specific defaults in terminological default logic. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 669–674, 1993.
F. Benhammadi, P. Nicolas, and T. Schaub. Extension calculus and query answering in prioritized default logic. In Proceedings of the International Conference on Artificial Intelligence: Methodology, Systems, Applications, pages 76–87, Springer Verlag, 1998.
G. Brewka. Adding priorities and specificity to default logic. In European Workshop on Logics in Artificial Intelligence, pages 247–260. Springer Verlag, 1994.
J. Delgrande and T. Schaub. A general approach to specificity in default reasoning. InProceedings of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning, pages 146–157. Morgan Kaufmann Publishers, 1994.
T. Linke and T. Schaub. An approach to query-answering in reiter’s default logic and the underlying existence of extensions problem. In Proceedings of the Sixth European Workshop on Logics in Artificial Intelligence, pages 233–247. Springer Verlag, 1998.
W. Łukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.
R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1-2):81–132, 1980.
R. Reiter and G. Criscuolo. On interacting defaults. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 270–276, 1981.
T. Schaub. Computing queries from prioritized default theories. In Eighth International Symposium on Methodologies for Intelligent Systems, pages 584–593. Springer Verlag, 1994.
T. Schaub. A new methodology for query-answering in default logics via structureoriented theorem proving. Journal of Automated Reasoning, 15(1):95–165, 1995.
T. Schaub and P. Nicolas. An implementation platform for query-answering in default logics: The xray system, its implementation and evaluation. In Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, pages 441–452. Springer Verlag, 1997.
C. Schwind and V. Risch. Tableau-based characterization and theoremproving for default logic. Journal of Automated Reasoning, 13:223–242, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benhammadi, F., Nicolas, P., Schaub, T. (1999). Query-answering in Prioritized Default Logic. In: Hunter, A., Parsons, S. (eds) Symbolic and Quantitative Approaches to Reasoning and Uncertainty. ECSQARU 1999. Lecture Notes in Computer Science(), vol 1638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48747-6_4
Download citation
DOI: https://doi.org/10.1007/3-540-48747-6_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66131-3
Online ISBN: 978-3-540-48747-0
eBook Packages: Springer Book Archive