Abstract
This paper presents a novel view of default reasoning in presence of priorities which are represented by an arbitrary partial order on default rules. We propose here a new approach for computing extensions from the prioritized default theories initially proposed by Brewka [4]. By this way, we obtain two results, one for extension calculus, and another for query answering. Given a prioritized default theory, in the first case we are able to build more efficiently all its extensions, and in the second case we are able to compute the prioritized default proof of a given formula.
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.
G. Brewka. Preferred subtheories: An extended logical framework for default reasoning. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1043–1048, 1989.
G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50(2):183–205, 1991.
G. Brewka. Adding priorities and specificity to default logic. In L. Pereira and D. Pearce, editors, European Workshop on Logics in Artificial Intelligence (JELIA '94), Lecture Notes in Artificial Intelligence, pages 247–260. Springer Verlag, 1994.
J. Delgrande and T. Schaub. A general approach to specificity in default reasoning. In J. Doyle, P. Torasso, and E. Sandewall, editors, Proceedings of the Fourth International Conference on the Principles of Knowledge Representation and Reasoning, pages 146–157. Morgan Kaufmann Publishers, 1994.
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.
A. Rothschild and T. Schaub. A computational approach to default logics. In G. Brewka and C. Witteveen, editors, Dutch/German Workshop on Non-Monotonic Reasoning Techniques and Their Applications, volume 2, pages 1–14, 1993.
T. Schaub. On constrained default theories. In B. Neumann, editor, Proceedings of the European Conference on Artificial Intelligence, pages 304–308. John Wiley & sons, 1992.
T. Schaub. Computing queries from prioritized default theories. In Z. Ras and M. Zemankova, editors, Eighth International Symposium on Methodologies for Intelligent Systems (ISMIS'94), volume 869 of Lecture Notes in Artificial Intelligence, pages 584–593. Springer Verlag, 1994.
T. Schaub and P. Nicolas. An implementation platform for query-answering in default logics: The xray system, its implementation and evaluation. In J. Dix and U. Furbach, editors, Proceedings of the Fourth International Conference on Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence, pages 441–452. Springer Verlag, 1997.
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.
C. Schwind and V. Risch. Tableau-based characterization and theorem proving for default logic. Journal of Automated Reasoning, 13:223–242, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Benhammadi, F., Nicolas, P., Schaub, T. (1998). Extension calculus and query answering in prioritized default logic. In: Giunchiglia, F. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 1998. Lecture Notes in Computer Science, vol 1480. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057436
Download citation
DOI: https://doi.org/10.1007/BFb0057436
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64993-9
Online ISBN: 978-3-540-49793-6
eBook Packages: Springer Book Archive