Computer Engineering / Bilgisayar Mühendisliği

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

Browse

Filters

2005 - 200922010 - 20178

Settings

Institution Author: search.filters.institutionAuthor.Kumova, Bora İsmailPublication Index: search.filters.publicationIndex.WoS

Search Results

Now showing 1 - 10 of 10
  • 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 - Scopus: 1
    Fuzzy-Syllogistic Systems: a Generic Model for Approximate Reasoning
    (Springer, 2016) Kumova, Bora İsmail
    The well known Aristotelian syllogistic system S consists of 256 moods. We have found earlier that 136 moods are distinct in terms of equal truth ratios that range in tau = [ 0,1]. The truth ratio of a particular mood is calculated by relating the number of true and false syllogistic cases that the mood matches. The introduction of (n -1) fuzzy existential quantifiers, extends the system to fuzzy-syllogistic systems S-n, 1 < n, of which every fuzzy-syllogistic mood can be interpreted as a vague inference with a generic truth ratio, which is determined by its syllogistic structure. Here we introduce two new concepts, the relative truth ratio (r)tau = [ 0,1] that is calculated from the cardinalities of the syllogistic cases of the mood and fuzzy-syllogistic ontology (FSO). We experimentally apply the fuzzy-syllogistic systems S-2 and S-6 as underlying logic of a FSO reasoner (FSR) and discuss sample cases for approximate reasoning.y
  • Book Part
    Citation - Scopus: 1
    Symmetric Properties of the Syllogistic System Inherited From the Square of Opposition
    (Birkhäuser, 2017) Kumova, Bora İsmail
    The logical square Omega has a simple symmetric structure that visualises the bivalent relationships of the classical quantifiers A, I, E, O. In philosophy it is perceived as a self-complete possibilistic logic. In linguistics however its modelling capability is insufficient, since intermediate quantifiers like few, half, most, etc cannot be distinguished, which makes the existential quantifier I too generic and the universal quantifier A too specific. Furthermore, the latter is a special case of the former, i.e. A subset of I, making the square a logic with inclusive quantifiers. The inclusive quantifiers I and O can produce redundancies in linguistic systems and are too generic to differentiate any intermediate quantifiers. The redundancy can be resolved by excluding A from I, i.e. I-2=I-A, analogously E from O, i.e. O-2=O-E. Although the philosophical possibility of A subset of I is thus lost in I-2, the symmetric structure of the exclusive square (2)Omega remains preserved. The impact of the exclusion on the traditional syllogistic system S with inclusive existential quantifiers is that most of its symmetric structures are obviously lost in the syllogistic system S-2 with exclusive existential quantifiers too. Symmetry properties of S are found in the distribution of the syllogistic cases that are matched by the moods and their intersections. A syllogistic case is a distinct combination of the seven possible spaces of the Venn diagram for three sets, of which there exist 96 possible cases. Every quantifier can be represented with a fixed set of syllogistic cases and so the moods too. Therefore, the 96 cases open a universe of validity for all moods of the syllogistic system S, as well as all fuzzy-syllogistic systems S-n, with n-1 intermediate quantifiers. As a by-product of the fuzzy syllogistic system and its properties, we suggest in return that the logical square of opposition can be generalised to a fuzzy-logical graph of opposition, for 2<n.
  • Article
    Citation - WoS: 4
    Citation - Scopus: 5
    Generating Ontologies From Relational Data With Fuzzy-Syllogistic Reasoning
    (Springer Verlag, 2015) Kumova, Bora İsmail
    Existing standards for crisp description logics facilitate information exchange between systems that reason with crisp ontologies. Applications with probabilistic or possibilistic extensions of ontologies and reasoners promise to capture more information, because they can deal with more uncertainties or vagueness of information. However, since there are no standards for either extension, information exchange between such applications is not generic. Fuzzy-syllogistic reasoning with the fuzzy-syllogistic system4S provides 2048 possible fuzzy inference schema for every possible triple concept relationship of an ontology. Since the inference schema are the result of all possible set-theoretic relationships between three sets with three out of 8 possible fuzzy-quantifiers, the whole set of 2048 possible fuzzy inferences can be used as one generic fuzzy reasoner for quantified ontologies. In that sense, a fuzzy syllogistic reasoner can be employed as a generic reasoner that combines possibilistic inferencing with probabilistic ontologies, thus facilitating knowledge exchange between ontology applications of different domains as well as information fusion over them.
  • Conference Object
    Citation - WoS: 5
    Citation - Scopus: 8
    The Fuzzy Syllogistic System
    (Springer Verlag, 2010) Kumova, Bora İsmail; Çakır, Hüseyin
    A categorical syllogism is a rule of inference, consisting of two premisses and one conclusion. Every premiss and conclusion consists of dual relationships between the objects M, P, S. Logicians usually use only true syllogisms for deductive reasoning. After predicate logic had superseded syllogisms in the 19th century, interest on the syllogistic system vanished. We have analysed the syllogistic system, which consists of 256 syllogistic moods in total, algorithmically. We have discovered that the symmetric structure of syllogistic figure formation is inherited to the moods and their truth values, making the syllogistic system an inherently symmetric reasoning mechanism, consisting of 25 true, 100 unlikely, 6 uncertain, 100 likely and 25 false moods. In this contribution, we discuss the most significant statistical properties of the syllogistic system and define on top of that the fuzzy syllogistic system. The fuzzy syllogistic system allows for syllogistic approximate reasoning inductively learned M, P, S relationships.
  • Conference Object
    Citation - Scopus: 3
    Ontology-Based Fuzzy-Syllogistic Reasoning
    (Springer Verlag, 2015) Zarechnev, Mikhail; Kumova, Bora İsmail
    We discuss the Fuzzy-Syllogistic System (FSS) that consists of the well-known 256 categorical syllogisms, namely syllogistic moods, and Fuzzy- Syllogistic Reasoning (FSR), which is an implementation of the FSS as one complex approximate reasoning mechanism, in which the 256 moods are interpreted as fuzzy inferences. Here we introduce a sample application of FSR as ontology reasoner. The reasoner can associate up to 256 possible fuzzyinferences with truth ratios in [0,1] for every triple concept relationship of the ontology. We further discuss a transformation technique, by which the truth ratio of a fuzzy-inference can increase, by adapting the fuzzy-quantifiers of a fuzzy-inference to the syllogistic logic of the sample propositions.
  • Conference Object
    Developing Applications On-Board of Robots With Becerik
    (Trans Tech Publications, 2012) Kumova, Bora İsmail; Takan, Savaş
    Robot applications are mostly first developed on a computer and thereafter loaded onto the robot. However, in many situations, developing applications directly on the robot may be more effective. For instance, children who have not learned using a computer yet and who develop their robot applications while playing. Or for instance in the robots' operating environment, where there is no computer available. In this contribution we present the properties of the software tool becerik, for developing applications on-board a robot and for running them in multi-tasking mode concurrently. Furthermore, we introduce the programming language of the applications that has the same name becerik, which consists of only 6 commands. © (2012) Trans Tech Publications, Switzerland.
  • Conference Object
    Citation - WoS: 5
    Citation - Scopus: 10
    Algorithmic Decision of Syllogisms
    (Springer Verlag, 2010) Kumova, Bora İsmail; Çakır, Hüseyin
    A syllogism, also known as a rule of inference, is a formal logical scheme used to draw a conclusion from a set of premises. In a categorical syllogisms, every premise and conclusion is given in form a of quantified relationship between two objects. The syllogistic system consists of systematically combined premises and conclusions to so called figures and moods. The syllogistic system is a theory for reasoning, developed by Aristotle, who is known as one of the most important contributors of the western thought and logic. Since Aristotle, philosophers and sociologists have successfully modelled human thought and reasoning with syllogistic structures. However, a major lack was that the mathematical properties of the whole syllogistic system could not be fully revealed by now. To be able to calculate any syllogistic property exactly, by using a single algorithm, could indeed facilitate modelling possibly any sort of consistent, inconsistent or approximate human reasoning. In this paper we present such an algorithm.
  • Article
    Citation - WoS: 1
    Citation - Scopus: 1
    Dynamically Adaptive Partition-Based Interest Management in Distributed Simulation
    (Elsevier Ltd., 2006) Kumova, Bora İsmail
    Performance and scalability of distributed simulations depends primarily on the effectiveness of the employed interest management (IM) schema that aims at reducing the overall computational and messaging effort on the shared data to a necessary minimum. Existing IM approaches, which are based on variations or combinations of two principle data distribution techniques, namely region-based and grid-based techniques, perform poorly if the simulation develops an overloaded host. In order to facilitate distributing the processing load from overloaded areas of the shared data to less loaded hosts, the partition-based technique is introduced that allows for variable-size partitioning the shared data. Based on this data distribution technique, an IM approach is sketched that is dynamically adaptive to access latencies of simulation objects on the shared data as well as to the physical location of the objects. Since this re-distribution is decided depending on the messaging effort of the simulation objects for updating data partitions, any load balanced constellation has the additional advantage to be of minimal overall messaging effort. Hence, the IM schema dynamically resolves messaging overloading as well as overloading of hosts with simulation objects and therefore facilitates dynamic system scalability.
  • Conference Object
    Citation - WoS: 6
    Citation - Scopus: 11
    Dynamically Adaptive Partition-Based Data Distribution Management
    (Institute of Electrical and Electronics Engineers Inc., 2005) Kumova, Bora İsmail
    Performance and scalability of distributed simulations depends primarily on the effectiveness of the employed data distribution management (DDM) algorithm, which aims at reducing the overall computational and messaging effort on the shared data to a necessary minimum. Existing DDM approaches, which are variations and combinations of two basic techniques, namely region-based and grid-based techniques, perform purely in the presence of load differences. We introduce the partition-based technique that allows for variable-size partitioning shared data. Based on this technique, a novel DDM algorithm is introduced that is dynamically adaptive to cluster formations in the shared data as well as in the physical location of the simulation objects. Since the re-distribution is sensitive to inter-relationships between shared data and simulation objects, a balanced constellation has the additional advantage to be of minimal messaging effort. Furthermore, dynamic system scalability is facilitated, as bottlenecks are avoided.