Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-18T06:06:16.293Z Has data issue: false hasContentIssue false
  • English
  • Français

A logic for approximate reasoning

Published online by Cambridge University Press:  12 March 2014

Mingsheng Ying
Mingsheng Ying*
Affiliation:
Department of Mathematics, Jiangxi Normal University, Nanchang 330027, China
Get access Rights & Permissions [Opens in a new window]

Extract

Classical logic is not adequate to face the essential vagueness of human reasoning, which is approximate rather than precise in nature. The logical treatment of the concepts of vagueness and approximation is of increasing importance in artificial intelligence and related research. Consequently, many logicians have proposed different systems of many-valued logic as a formalization of approximate reasoning (see, for example, Goguen [G], Gerla and Tortora [GT], Novak [No], Pavelka [P], and Takeuti and Titani [TT]). As far as we know, all the proposals are obtained by extending the range of truth values of propositions. In these logical systems reasoning is still exact and to make a conclusion the antecedent clause of its rule must match its premise exactly. In addition. Wang [W] pointed out: “If we compare calculation with proving,... Procedures of calculation... can be made so by fairly well-developed methods of approximation; whereas... we do not have a clear conception of approximate methods in theorem proving.... The concept of approximate proofs, though undeniably of another kind than approximations in numerical calculations, is not incapable of more exact formulation in terms of, say, sketches of and gradual improvements toward a correct proof” (see pp, 224–225). As far as the author is aware, however, no attempts have been made to give a conception of approximate methods in theorem proving.

The purpose of this paper is. unlike all the previous proposals, to develop a propositional calculus, a predicate calculus in which the truth values of propositions are still true or false exactly and in which the reasoning may be approximate and allow the antecedent clause of a rule to match its premise only approximately. In a forthcoming paper we shall establish set theory, based on the logic introduced here, in which there are ∣L∣ binary predicates ∈λ, λ ∈ L such that R(∈, ∈λ) = λ where ∈ stands for ∈1 and 1 is the greatest element in L, and x ∈λy is interpreted as that x belongs to y in the degree of λ, and relate it to intuitionistic fuzzy set theory of Takeuti and Titani [TT] and intuitionistic modal set theory of Lano [L]. In another forthcoming paper we shall introduce the resolution principle under approximate match and illustrate its applications in production systems of artificial intelligence.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 59 , Issue 3 , September 1994 , pp. 830 - 837
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[BM]Barnes, D. W. and Mack, J. M., An algebraic introduction to mathematical logic, Springer-Verlag, New York, 1975.CrossRefGoogle Scholar
[G]Goguen, J. A., The logic of inexact concepts, Syntheses, vol. 19 (1968/1969), pp. 325–373.Google Scholar
[GT]Gerla, G. and Tortora, R., Fuzzy natural deduction, Zeitschrift für Mathematische Logik and Grundlagen der Mathematik, vol. 36 (1990), pp. 67–77.CrossRefGoogle Scholar
[L]Lano, K., Intutitionistic modal logic and set theory, this Journal, vol. 56 (1991), pp. 497–516.Google Scholar
[N]Nilsson, N. J., Principles of artificial intelligence, Tioga, New York, 1980.Google Scholar
[No]Novak, V., First-order fuzzy logic, Stadia Logica, vol. 46 (1987), pp. 87–109.Google Scholar
[P]Pavelka, J., On fuzzy logic I: Many-valued rules of inference: II: Enriched residuated lattices and semantics of propositional calculi: III: Semantical completeness of some many-valued propositional calculi, Zeitschrift fur Mathematische Logik and Grundlagen der Mathematik, vol. 25 (1979), pp. 45–72: pp. 119–134; pp. 447–464.Google Scholar
[TT]Takhuti, G. and Titani, S., Intuitionistic fuzzy logic and intuitionistic fuzzy set theory, this Journal. vol. 49 (1984), pp. 851–866.Google Scholar
[W]Wang, H., Toward mechanical mathematics, IBM Journal for Research and Development, vol. 4 (1960), pp. 224–268. See also: A survey of mathematical logic, Science Press, Beijing, 1962, Chapter IX.CrossRefGoogle Scholar
[Y]Ying, M. S., Deduction theorem for many-valued inference, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 37 (1991), pp. 533–537.CrossRefGoogle Scholar
[Yl]Ying, M. S., Fuzzy reasoning under approximate match, Science Bulletin, vol. 37 (1992), pp. 1244–1245.Google Scholar