A parametric definition for a family of inheritance reasoners
Tóm tắt
This paper gives a declarative specification of a popular inheritance system and shows how simple changes to this specification can result in different path-based reasoners. This parameterized definition provides a deeper understanding of the fundamental differences between some of the more popular path-based inheritance reasoners. In particular, it allows the clarification of some of the results on the complexity of reasoning in the various systems. The uniform framework also allows definition of novel systems which constitute intermediate points in the space of possible reasoners, and facilitates perspicuous Prolog implementation.
Tài liệu tham khảo
Al-Asady, R. and Narayanan, A., “More Notes on ‘A Clash of Intuitions’,” inProceedings of the 13th International Joint Conference on Artificial Intelligence, Chambery, France, pp. 682–87, 1993.
Boutilier, C., “A Semantical Approach to Stable Inheritance Reasoning,” inProceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, pp. 1134–1139, 1989.
Cripps, A., “Aspects of the Inheritance Problem,”MSc thesis, Department of Computer Science, University of Victoria, 1987.
Delgrande, J., “An Approach to Default Reasoning Based on a First-Order Conditional Logic: Revised Report,”Artificial Intelligence, 36, 1, pp. 63–90, 1988.
Delgrande, J., “A Semantics for a Class of Inheritance Networks,” inProceedings of the 8th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Ottawa, Ontario, 1990.
Geffner, H. and Verma, T., “Inheritance=Chaining+Defeat,” inCSD-890039, Computer Science Department, University of California, Los Angeles, 1989.
Hewson, C. and Vogel, C., “Psychological Evidence for Assumptions of Path-Based Inheritance Reasoning,” inProceedings of the Sixteenth Annual Conference of the Cognitive Science Society, Atlanta, Georgia, pp. 409–414, 1994.
Horty, J., Thomason, R., and Touretzky, D., “A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks,”Artificial Intelligence, 42, 2–3, pp. 311–348, 1990.
Kautz, H. A. and Selman, B., “Hard Problems for Simple Default Logics,”Artificial Intelligence, 49, pp. 243–279, 1991.
Maugham, S.,The Moon and Sixpence, London: Pan Books Ltd. Pan Edition, 1974.
McDermott, D. and Doyle, J., “Non-Monotonic Logic I,”Artificial Intelligence, 13, 1–2, pp. 41–72, 1980.
Niemelä, I. and Rintanen, J., “On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning,”Journal of Applied Non-Classical Logics, 4, 2, pp. 141–179, 1994.
Reiter, R. and Criscuolo, G., “Some Representational Issues in Default Reasoning,”Computers and Mathematics with Applications, 9, 1, pp. 15–27, 1983.
Sandewall, E., “Nonmonotonic Inference Rules for Multiple Inheritance with Exceptions,”Proceedings of IEEE, 74, 10, pp. 1345–1353, 1986.
Selman, B. and Levesque, H., “The Tractability of Path-Based Inheritance,” inProceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, pp. 102–109, 1989.
Selman, B. and Levesque, H., “The Complexity of Path-Based Defeasible Inheritance,”Artificial Intelligence, 62, pp. 303–339, 1993.
Stein, L. A., “Skeptical Inheritance: Computing the Intersection of credulous Extensions,” inProceedings of the 11th International Joint Conference on Artificial Intelligence, Detroit, Michigan, pp. 1153–1160, 1989.
Touretzky, D.,The Mathematics of Inheritance Systems, Los Altos, CA: Morgan Kaufman, 1986.
Touretzky, D., Horty, J., and Thomason, R., “A Clash of Intuitions: The Current State of Non-Monotonic Inheritance Systems,” inProceedings of the 10th International Joint Conference on Artificial Intelligence, Milan, Italy, pp. 476–482, 1987.
Veltman, F., “Defaults in Update Semantics,” unpublished manuscript, Institute for Language, Logic and Information, University of Amsterdam, 1994.
Vogel, C., Popowich, F., and Cercone, N., “Logic-Based Inheritance Reasoning,” inProceedings of the 9th Bi-Annual Conference of the Society for the Study of Artificial Intelligence and the Simulation of Behavior, AISB’93, Birmingham, England, March 29-April 2, pp. 179–188, 1993. Appears inProspects for Artificial Intelligence (A. Sloman, et al., eds.), Amsterdam: IOS Press, 1993.
Vogel, C. M., “Defining Psychologically Plausible Default Inheritance Reasoners,” unpublished manuscript, Institute for Computational Linguistics, University of Stuttgart, 1995.
Vogel, C. M., “Inheritance Reasoning: Psychological Plausibility, Proof Theory and Semantics,”Ph.D. thesis, Centre for Cognitive Science, University of Edinburgh, 1995.
Vogel, C. M., “A Generalizable Semantics for Inheritance Reasoning,” to appear in theCSLI Lecture Notes Volume, The 1st Tbilisi Symposium on Logic, Language and Computation, 1996.
Vogel, C. M., “Human Reasoning with Negative Defaults,” appears inPractical Reasoning (Dor Gabbay and Hans Jürgen Ohlbach eds.),Lecture Notes in Artificial Intelligence 1085, Berlin: Springer-Verlag, pp. 606–621, 1996.