Abstract
We first describe a decision procedure for purely cumulative and preferential cumulative reasoning which is based on a completion algorithm and computationally very simple: if a system of axioms is given, the completion leads to a canonical representation (called pool table) which organizes knowledge in the style of an encyclopedia. With this table, the decision whether an implication holds or not is trivial. We show in the second part of the paper that it is possible to assign in a natural way an inheritance graph structure to the columns of the table. Then usual network inheritance techniques may be applied and lead to a rather strong notion of consequence. Such network structures on encyclopaedias are interesting for natural language processing since nontrivial techniques for reasoning on the base of a background encyclopaedia would have various applications in text understanding and related areas.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Buchberger, B., History and Basic Features of the Critical-Pair/Completion Procedure, J. Symbolic Computation 3 (1987), 3–38.
Gabbay, D.M., The Tübingen Lectures 1988 on The Logics of Practical Reasoning, to appear as SNS-Bericht, Seminar für natürlich-sprachliche Systeme, Universität Tübingen 1989.
Gabbay, D.M., Theoretical foundations for non-monotonic reasoning in expert systems, Research Report DoC 84/11, Department of Computing, Imperial College of Science and Technology, 1984.
Horty, J.F., Thomason, R.H. and Touretzky, D.S., A Skeptical Theory of Inheritance in Nonmonotonic Semantic Networks, Proceedings of the AAAI-87 (1987), 358–363.
Kraus, S., Lehmann, D. and Magidor, M., Preferential models and cumulative logics, to appear in Artificial Intelligence.
Makinson, D., General Theory of Cumulative Inference, in Proceedings of the Second International Workshop on Non-Monotonic Reasoning, Springer Lecture Notes on Computer Science, subseries on Artificial Intelligence Vol. 346 (1989), 1–19.
Makinson, D.,Schlechta, K., On Some Difficulties in the Theory of Defeasible Inheritance Nets, Proceedings of the Tübingen Workshop on Semantic Networks and Nonmonotonic Reasoning, Vol. 2, Morreau, M., (editor), SNS-Bericht, Seminar für natürlich-sprachliche Systeme, Universität Tübingen 1989.
Sandewall, E., Nonmonotonic inference rules for multiple inheritance with exceptions, Proceedings if the IEEE 74 (1986), 1345–1353.
Schulz, K.U., A Decision Procedure for Two Systems of Cumulative Inference, Proceedings of the Tübingen Workshop on Semantic Networks and Nonmonotonic Reasoning, Vol. 2, Morreau, M., (editor), SNS-Bericht, Seminar für natürlich-sprachliche Systeme, Universität Tübingen 1989.
Szwarcfiter, J.L. and Lauer, P.E., Finding the elementary cycles of a directed graph in O(n+m) per cycle, Tech. Rep. No. 60, Univ. of Newcastle upon Tyne, England, May 1974.
Touretzky, D.S., The Mathematics of Inheritance Systems, Morgan Kaufmann, Los Altos and Pitman, London, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schulz, K.U. (1991). Preferential cumulative reasoning and nonmonotonic semantic nets. In: Fuhrmann, A., Morreau, M. (eds) The Logic of Theory Change. Lecture Notes in Computer Science, vol 465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018423
Download citation
DOI: https://doi.org/10.1007/BFb0018423
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53567-6
Online ISBN: 978-3-540-46817-2
eBook Packages: Springer Book Archive