Abstract
In this paper a semantical framework is developed that provides a logical description of the functionality of an interactive reasoning module. In particular it can be made more transparent by this framework whether or not the conclusions that may be drawn by a reasoning module fit to the situation that is concerned (soundness and completeness). It will be established that, considered from the viewpoint of functionality, the knowledge in a reasoning module always can be normalized to knowledge in rule format. This shows that the rule format essentially is expressive enough to specify the functionality of a reasoning module. This result gives a justification for the choice that has been made in our framework for design and specification of interacting reasoning modules, DESIRE.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Blamey, Partial Logic, in: D. Gabbay, F. Guenthner (eds.), Handbook of Philosophical Logic, Vol. III, pp.1–70, Reidel, 1986.
B.G. Buchanan, E.H. Shortliffe, Rule-based expert systems, Addison-Wesley, 1985
B. Chandrasckaran, Generic tasks in knowledge-based reasoning: high level building blocks for expert system design, IEEE Expert, Fall 1986
C.C. Chang, H.J. Keisler, Model theory, North Holland, 1973
C.G. Hempel, Philosophy of Science, Prentice-Hall, Englewoods Cliffs, 1966
W. Kowalczyk, J. Treur, On the use of a formalized generic task model in knowledge acquisition, Proc. European Knowledge Acquisition Workshop, EKAW-90, pp. 198–221,1990
P.H.G. van Langen, J. Treur, Representing world situations and information states by many-sorted partial models, Report PE8904, University of Amsterdam, Expert Systems Section, 1989
T. Langholm, Partiality, Truth and Persistance, CSLI Lecture Notes No. 15, Stanford University, Stanford, 1988.
M. Suwa, A. Garlisle Scott, E.H. Shortliffe, Completeness and consistency in a rule-based system, in: B.G. Buchanan, E.H. Shortliffe, Rule-based expert systems, pp. 159–170,1985
Y.H. Tan, J. Treur, A bimodular approach to nonmonotonic reasoning, Proc. World Congress on Fundamentals in AI, WOCFAI-91, pp. 461–475, 1991
J. Treur, Completeness and definability in diagnostic expert systems, Proc. European Conference on Artificial Intelligence, ECAI-88, pp. 619–624,1988
J. Treur, Heuristic reasoning and relative incompleteness, Int. Journal of Approximate Reasoning, to appear, 1992
J. Treur, On the use of reflection principles in modelling complex reasoning, Int. Journal of Intelligent Systems 6 (1991), pp. 277–294
J. Treur, Declarative functionality descriptions of interactive reasoning modules, Report IR-237, Vrije Universiteit, Department of Mathematics and Computer Science, 1990
J. Treur, Interaction types and chemistry of generic task models, Proc. European Knowledge Acquisition Workshop, EKAW-91, 1991
R.W. Weyhrauch, Prolegomena to a theory of mechanized formal reasoning, Artificial Intelligence 13 (1980), pp. 133–170
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Treur, J. (1991). Declarative functionality descriptions of interactive reasoning modules. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013533
Download citation
DOI: https://doi.org/10.1007/BFb0013533
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive