100 research outputs found

    A Fuzzy Syllogistic Reasoning Schema for Generalized Quantifiers

    Get PDF
    In this paper, a new approximate syllogistic reasoning schema is described that expands some of the approaches expounded in the literature into two ways: (i) a number of different types of quantifiers (logical, absolute, proportional, comparative and exception) taken from Theory of Generalized Quantifiers and similarity quantifiers, taken from statistics, are considered and (ii) any number of premises can be taken into account within the reasoning process. Furthermore, a systematic reasoning procedure to solve the syllogism is also proposed, interpreting it as an equivalent mathematical optimization problem, where the premises constitute the constraints of the searching space for the quantifier in the conclusion.Comment: 22 pages, 6 figures, journal pape

    Approximate reasoning with fuzzy-syllogistic systems

    Get PDF
    The well known Aristotelian syllogistic system consists of 256 moods. We have found earlier that 136 moods are distinct in terms of equal truth ratios that range in τ=[0,1]. The truth ratio of a particular mood is calculated by relating the number of true and false syllogistic cases the mood matches. A mood with truth ratio is a fuzzy-syllogistic mood. The introduction of (n-1) fuzzy existential quantifiers extends the system to fuzzy-syllogistic systems nS, 1<n, of which every fuzzy-syllogistic mood can be interpreted as a vague inference with a generic truth ratio that is determined by its syllogistic structure. We experimentally introduce the logic of a fuzzy-syllogistic ontology reasoner that is based on the fuzzy-syllogistic systems nS. We further introduce a new concept, the relative truth ratio rτ=[0,1] that is calculated based on the cardinalities of the syllogistic cases

    Approximate syllogistic reasoning: a contribution to inference patterns and use cases

    Get PDF
    In this thesis two models of syllogistic reasoning for dealing with arguments that involve fuzzy quantified statements and approximate chaining are proposed. The modeling of quantified statements is based on the Theory of Generalized Quantifiers, which allows us to manage different kind of quantifiers simultaneously, and the inference process is interpreted in terms of a mathematical optimization problem, which allows us to deal with more arguments that standard deductive ones. For the case of approximate chaining, we propose to use synonymy, as used in a thesaurus, for calculating the degree of confidence of the argument according to the degree of similarity between chaining terms. As use cases, different types of Bayesian reasoning (Generalized Bayes' Theorem, Bayesian networks and probabilistic reasoning in legal argumentation) are analysed for being expressed through syllogisms

    Reduction between Categorical Syllogisms Based on the Syllogism EIO-2

    Get PDF
    Syllogism reasoning is a common and important form of reasoning in human thinking from Aristotle onwards. To overcome the shortcomings of previous studies, this article makes full use of set theory and classical propositional logic, and deduces the remaining 23 valid syllogisms only on the basis of the syllogism EIO-2 from the perspective of mathematical structuralism, and then successfully establishes a concise formal axiom system for categorical syllogistic logic. More specifically, the article takes advantage of the trisection structure of categorical propositions such as Q(a, b), the transformation relations between an Aristotelian quantifier and its inner and outer negation, the symmetry of the two Aristotelian quantifier (that is, no and some), and some inference rules in classical propositional logic, and derives the remaining 23 valid syllogisms from the syllogism EIO-2, so as to realize the reduction between different valid categorical syllogisms

    Кванторные слова в логике естественного языка

    Get PDF
    Цель исследования: выявить в составе логических средств языка такие слова, которые сводятся к квантору существования или/и его отрицани

    Диаграммное представление значений логических форм суждений и рассуждений о бинарных отношениях

    Get PDF
    Жалдак, Н. Н. Диаграммное представление значений логических форм суждений и рассуждений о бинарных отношениях / Н. Н. Жалдак // Ученые записки Крымского федерального университета. Сер. Философия. Политология. Культурология. - 2018. - Т.4(40), №3.-С. 24-35. - Библиогр.: с. 35.Система логики естественного языка в ее диаграммном представлении должна охватывать не только атрибутивные, но и релятивные суждения и рассуждения. В статье эта проблема решается для суждений и рассуждений о бинарных отношения

    Neutrality and Many-Valued Logics

    Get PDF
    In this book, we consider various many-valued logics: standard, linear, hyperbolic, parabolic, non-Archimedean, p-adic, interval, neutrosophic, etc. We survey also results which show the tree different proof-theoretic frameworks for many-valued logics, e.g. frameworks of the following deductive calculi: Hilbert's style, sequent, and hypersequent. We present a general way that allows to construct systematically analytic calculi for a large family of non-Archimedean many-valued logics: hyperrational-valued, hyperreal-valued, and p-adic valued logics characterized by a special format of semantics with an appropriate rejection of Archimedes' axiom. These logics are built as different extensions of standard many-valued logics (namely, Lukasiewicz's, Goedel's, Product, and Post's logics). The informal sense of Archimedes' axiom is that anything can be measured by a ruler. Also logical multiple-validity without Archimedes' axiom consists in that the set of truth values is infinite and it is not well-founded and well-ordered. On the base of non-Archimedean valued logics, we construct non-Archimedean valued interval neutrosophic logic INL by which we can describe neutrality phenomena.Comment: 119 page

    Guide to Discrete Mathematics

    Get PDF

    Fuzzy Natural Logic in IFSA-EUSFLAT 2021

    Get PDF
    The present book contains five papers accepted and published in the Special Issue, “Fuzzy Natural Logic in IFSA-EUSFLAT 2021”, of the journal Mathematics (MDPI). These papers are extended versions of the contributions presented in the conference “The 19th World Congress of the International Fuzzy Systems Association and the 12th Conference of the European Society for Fuzzy Logic and Technology jointly with the AGOP, IJCRS, and FQAS conferences”, which took place in Bratislava (Slovakia) from September 19 to September 24, 2021. Fuzzy Natural Logic (FNL) is a system of mathematical fuzzy logic theories that enables us to model natural language terms and rules while accounting for their inherent vagueness and allows us to reason and argue using the tools developed in them. FNL includes, among others, the theory of evaluative linguistic expressions (e.g., small, very large, etc.), the theory of fuzzy and intermediate quantifiers (e.g., most, few, many, etc.), and the theory of fuzzy/linguistic IF–THEN rules and logical inference. The papers in this Special Issue use the various aspects and concepts of FNL mentioned above and apply them to a wide range of problems both theoretically and practically oriented. This book will be of interest for researchers working in the areas of fuzzy logic, applied linguistics, generalized quantifiers, and their applications
    corecore