Computer Engineering / Bilgisayar Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/10

Browse

Search Results

Now showing 1 - 2 of 2
  • Conference Object
    Citation - WoS: 3
    Citation - Scopus: 6
    Truth Ratios of Syllogistic Moods
    (Institute of Electrical and Electronics Engineers, 2015) Zarechnev, Mikhail; Kumova, Bora İsmail
    The syllogistic system consists of 256 moods, of which only 24 have been recognized as true. From a set-theoretical point of view, a mood can be represented with three sets and their possible relationships. Three sets can have up to seven sub-sets or spaces. In an earlier work we have used 41 permutations of the spaces, out of which every mood matches an individual number as true or false cases. The truth ratio of a mood is then calculated, by relating the true and false cases with each other. In this work we revise the previously presented properties of the moods and the syllogistic system, this time by using the maximum possible cover, which consists of 96 distinct space permutations. Our results mostly verify our previous findings, like the additional true mood anasoy, the inherently symmetric truth distribution of the moods. Additionally we have revealed some new properties, like the equivalence of some moods, which reduces the system to 136 distinct moods.
  • Conference Object
    Citation - WoS: 2
    Citation - Scopus: 2
    An Extended Syllogistic Logic for Automated Reasoning
    (Institute of Electrical and Electronics Engineers, 2017) Çine, Ersin; Kumova, Bora İsmail
    In this work, we generalise the categorical syllogistic logic in several dimensions to a relatively expressive logic that is sufficiently powerful to encompass a wider range of linguistic semantics. The generalisation is necessary in order to eliminate the existential ambiguity of the quantifiers and to increase expressiveness, practicality, and adaptivity of the syllogisms. The extended semantics is expressed in an extended syntax such that an algorithmic solution of the extended syllogisms can be processed. Our algorithmic approach for deduction in this logic allows for automated reasoning directly with quantified propositions, without reduction of quantifiers.