nach oben

Automatic Documentation and Mathematical Linguistics

Erschienen in:

01.09.2019 | THE JSM METHOD OF AUTOMATED RESEARCH SUPPORT AND ITS APPLICATION IN INTELLIGENT SYSTEMS FOR MEDICINE

On the Heuristics of JSM Research (Additions to Articles)

verfasst von: V. K. Finn

Erschienen in: Automatic Documentation and Mathematical Linguistics | Ausgabe 5/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The logical means of detecting empirical regularities using the JSM method of automated research support are considered. Generators of hypotheses about the causes and hypotheses about predictions that are stored in sequences of expandable fact bases are determined. Many “histories of possible worlds” are considered, where “world” refers to an expandable fact base. This set is used to determine empirical regularities, that is, empirical laws, tendencies, and weak tendencies. Empirical regularities are used to determine empirical modalities of necessity (for empirical laws), possibilities (for empirical tendencies), and weak possibilities (for weak empirical tendencies). The Propositional calculi of the class ERA are proposed, that is, modal logics with two empirical modalities of necessity and possibility such that they imitate abductive inference through the axioms of abduction (◻(p → q) & Tq) → ◻p), (◇(p → q) & Tq) → ◇p), where ◻, ◇, T are operators of necessity, possibility, and truth (“it is true that…”). A series of definitions related to the characterization of data mining using heuristics of the JSM method of automated research support is given.

Vorheriger Artikel Academies of Sciences in Western Europe: Analysis of Activities, Web Content, and Webometric Indicators

Nächster Artikel Intellectual Mining of Patient Data with Melanoma for Identification of Disease Markers and Critical Genes

Nur mit Berechtigung zugänglich

D.V. Vinogradov in [9] established that, for finite models, JSM rules are expressible in the predicate logic of the first order.

⇌ is equality by definition.

We note that there are many attempts to formalize the ideas of C.S. Peirce on abduction by means of logic and programming using deduction [20‐22].

\({{\bar {\rho }}^{\sigma }} \leqslant 1\), in recognition problems often get \({{\bar {\rho }}^{\sigma }}\) = 0.8.

We can assume that CCA^(σ) is the principle of induction (J.S. Mill in [14] considered the law of uniformity of nature to be such).

(τ, 1) and (τ, 2) are sets of truth values.

According to the terminology of I. Kant in “Critique of Pure Reason” [32], ICF are the conditions of “possible experience”.

In [3], Int and Ext were considered for the initial predicates of the JSM method and the plausible inference rules.

For simplicity, we will use the number i instead of \(HP{{W}_{i}}\).

In [35], a description is given of an intelligent system that implements the ASSR JSM method for gastroenterology data. This computer system has 16 JSM strategies.

Conditions a and ad₀ formalize inductive canons of similarity and difference [14]. The canons of similarity-differences are formalized in [13, 36].

An interpretation of [15] is available in [18], where the condition of the best explanation is added.

Finn, V.K. and Shesternikova, O.P., The heuristics of detection of empirical regularities by JSM reasoning, Autom. Doc. Math. Linguist., 2018, vol. 52, no. 5, pp. 215–247.CrossRef

Finn, V.K., Heuristics of detecting empirical patterns and principles of data mining, Iskusstv. Intell. Prinyatie Reshenii, 2018, no. 3, pp. 3–19.

Finn, V.K., On the non-Aristotelian structure of concepts, Logich. Issled., 2015, no. 21, pp. 9–43.

Finn, V.K., Epistemological foundations of the JSM method for automatic hypothesis generation, Autom. Doc. Math. Linguist., 2013, no. 12, pp. 1–26.

Rosser, J.B. and Turquette, A.R., Many-Valued Logics, Amsterdam: North-Holland Publishing Company, 1958.MATH

Finn, V.K., On the class of JSM reasoning that uses the isomorphism of inductive inference rules, Sci. Tech. Inf. Process., 2016, no. 3, pp. 95–108.

Skvortsov, D.P., About some methods of constructing logical languages with quantifiers for tuples, Semiotika Inf., 1983, no. 20, pp. 102–126.

Barwise, J., Handbook of Mathematical Logic, Amsterdam–New York–Oxford: North-Holland Publishing Company, 1977.

Vinogradov, D.V., Formalization of plausible reasoning in predicate logic, Nauchno-Tekh. Inf., Ser. 2, 2000, no. 11, pp. 17–20.

10.

Anshakov, O.M., Finn, V.K., and Skvortsov, D.P., On axiomatization of many-valued logics associated with formalization of plausible reasoning, Stud. Logica, 1989, vol. 48, no. 4, pp. 423–447.MathSciNetCrossRef

11.

Finn, V.K., Iskusstvennyi intellekt (metodologiya, primeneniya, filosofiya) (Artificial Intelligence (Methodology, Applications, Philosophy)), Moscow: KRASAND, 2011, part 4, chap. 3, pp. 312–338.

12.

Finn, V.K., Epistemological foundation of the JSM method for automatic hypothesis generation, Autom. Doc. Math. Linguist., 2014, vol. 48, no.2, pp. 96–148.CrossRef

13.

Finn, V.K., Distributive lattices of inductive JSM procedures, Autom. Doc. Math. Linguist., 2014, vol. 48, no. 6, pp. 265–295.CrossRef

14.

Mill, J.S., A System of Logic Ratiocinative and Inductive, Being a Connected View of the Principles of Evidence and the Methods of Scientific Investigation, London: Parker, Son and Bowin, 1843.

15.

Peirce, C.S., Collected Papers, Cambridge, MA: Harvard University Press, 1934, p. 189.MATH

16.

Kapitan, T., Peirce and the autonomy of abductive reasoning, Erkenntnis, 1992, vol. 37, no. 1, pp. 1–26.MathSciNetCrossRef

17.

Frankfurt, H., Peirce’s notion of abduction, J. Philos., 1958, vol. 55, pp. 593–597.CrossRef

18.

Abductive Inference: Computation, Philosophy, Technology, Josephson, J.R. and Josephoson, S.G., Eds., Cambridge: University Press, 1994.MATH

19.

Finn, V.K., The synthesis of cognitive procedures and the problem of induction, Autom. Doc. Math. Linguist., 2009, vol. 43, no.3, pp. 149–195.CrossRef

20.

Finn, V.K., Abductive reasoning, in Entsiklopediya epistemologii i filosofii nauki (Encyclopedia of Epistemology and Philosophy of Science), Moscow: KANON⁺, 2009, pp. 8–9.

21.

Aliseda, A., Abductive Reasoning (Logical Investigations into Discovery and Explanation), Springer, 2006.MATH

22.

Vagin, V.N., Golovina, E.Yu., Zagoryanskaya, A.A., and Fomina, M.V., Dostovernyi i pravdopodobnyi vyvod (Reliable and Plausible Inference), Moscow: FIZMATLIT, 2008.

23.

Rescher, N., The Coherence Theory of Truth, Oxford: The Clarendon Press, 1973.

24.

Weingartner, P., Basic Questions on Truth, Dordrecht–Boston–London: Kluwer Academic Publishers, 2000.CrossRef

25.

Tarski, A., The concept of truth in formalized languages, in Logic, Semantics, Metamathematics, Oxford: Clarendon Press, 1956, pp. 152–278.

26.

Tarski, A., The semantic conception of truth and the foundations of semantics, Philos. Phenomenol. Res., 1944, vol. 4, no. 3, pp. 341–375.MathSciNetCrossRef

27.

Kripke, S.K., Semantical analysis of modal logic. I. Normal modal propositional calculi, Z. Math. Logik Grundlagen Math., 1963, vol. 9, pp. 67–96.MathSciNetCrossRef

28.

Anshakov, O.M., Skvortsov, D.P., and Finn, V.K., On deductive imitation of some variants of the JSM method for automatic hypothesis generation, in DSM-metod avtomaticheskogo porozhdeniya gipotez (logicheskie i epistemologicheskie osnovaniya) (The JSM Method for Automatic Hypothesis Generation (Logical and Epistemological Grounds)), Moscow: Knizhnyi dom LIBROKOM, 2009, pp. 158–189.

29.

Finn, V.K., Standard and non-standard reasoning logic, in Logicheskie issledovaniya (Logical Studies), Moscow: Nauka, 2006, vol. 13.

30.

Reichenbach, H., Elements of Symbolic Logic, New York: The Macmillan Co., 1947.MATH

31.

Reichenbach, H., Nomological Statements and Admissible Operations, Amsterdam: North-Holland Publishing Co., 1954.MATH

32.

Kant, I., Kritik der reinen Vernunft, 1781.

33.

Norris, E.M., An algoritm for computing the maximal rectangles in binary relation, Rev. Roum. Math. Pures Appl., 1978, vol. 23, no. 2, pp. 243–250.MATH

34.

Kuznetsov, S.O., A fast algoritm for computing all intersection of objects in a finite semilattice, Autom. Doc. Math. Linguist., 1993, vol. 27, no. 1, pp. 23–28.

35.

Shesternikova, O.P., Agafonov, M.A., Vinokurova, L.V., Pankratova, E.S., and Finn, V.K., Intelligent system for diabetes prediction in patients with chronic pancreatitis, Sci. Tech. Inf. Process., 2016, vol. 43, nos. 5–6, pp. 315–345.CrossRef

36.

Church, A., Introduction to Mathematical Logic, Princeton, New Jersey: Princeton University Press, 1956.MATH

37.

Fann, K.T., Peirce’s Theory Abduction, The Hague: Martinus Nijhoff Publishers, 1970.CrossRef

38.

Salmon, W.C., Laws, modalities and counterfactuals, in Hans Reichhenbach: Logical Empiricist, Dordrecht–Boston–London: D. Reidel Pub. Co., 1979, pp. 655–696.CrossRef

39.

Jobe, E.K., Reichenbach’s theory of nomological statements, in Hans Reichhenbach: Logical Empiricist, Dordrecht–Boston–London: D. Reidel Pub. Co., 1979, pp. 697–720.

40.

Feys, R., Modal Logics, Louvain/Paris: E. Nauwelaerts/Gauthier-Villars Publishers, 1965.MATH

41.

Chellas, B.F., Modal Logic. An Introduction, Cambridge: Cambridge University Press, 1980.CrossRef

42.

von Wright, G.H., Explanation and Understanding, London, 1971.

43.

Hughes, G.E. and Cresswell, M.J., An Introduction to Modal Logic, London: Methuen and Co LTD., 1972.MATH

44.

Popper, K.R., Objective Knowledge. An Evolutionary A-pproach, Oxford: Clarendon Press, 1979.

Titel: On the Heuristics of JSM Research (Additions to Articles)
verfasst von: V. K. Finn
Publikationsdatum: 01.09.2019
Verlag: Pleiades Publishing
Erschienen in: Automatic Documentation and Mathematical Linguistics / Ausgabe 5/2019
Print ISSN: 0005-1055
Elektronische ISSN: 1934-8371
DOI: https://doi.org/10.3103/S0005105519050078

Springer Professional

On the Heuristics of JSM Research (Additions to Articles)

Abstract

Premium Partner

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Weitere Artikel der Ausgabe 5/2019

A Probabilistic Algorithm for Calculating Similarities

Intellectual Mining of Patient Data with Melanoma for Identification of Disease Markers and Critical Genes

Academies of Sciences in Western Europe: Analysis of Activities, Web Content, and Webometric Indicators

Comparison of Data Representation Languages in the Structure–Activity Problem

An Intelligent System for Diagnostics of Pancreatic Diseases

Premium Partner