Computer Engineering / Bilgisayar Mühendisliği
Permanent URI for this collectionhttps://hdl.handle.net/11147/10
Browse
14 results
Search Results
Now showing 1 - 10 of 14
Conference Object Citation - WoS: 3Citation - Scopus: 6Truth Ratios of Syllogistic Moods(Institute of Electrical and Electronics Engineers, 2015) Zarechnev, Mikhail; Kumova, Bora İsmailThe 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 On-board applications development via symbolic user interfaces(Springer, 2014) Kumova, Bora İsmailbecerik is a functional language consisting of symbolic commands for managing and composing applications. Application commands consist of symbols that are associated with reading sensor values, computing those values and executing actuator values. It is the result of a co-design of mechatronic functionality and robotic behaviour. The requirements given for mechatronic functionality were those of simple robotics kits that are used in school education or as toys. The requirements given for the behaviour were to provide a reflexive one, consisting of triggering simple computations and actuations from simple sensor values. becerik currently lives as a leJOS application on NXT robots and enables developing simple applications using the standard display and buttons of the NXT brick. In this paper we introduce the symbolic user interfaces of becerik. © 2014 Springer International Publishing Switzerland.Conference Object Citation - Scopus: 1Fuzzy-Syllogistic Systems: a Generic Model for Approximate Reasoning(Springer, 2016) Kumova, Bora İsmailThe 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.yBook Part Citation - Scopus: 1Symmetric Properties of the Syllogistic System Inherited From the Square of Opposition(Birkhäuser, 2017) Kumova, Bora İsmailThe 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: 4Citation - Scopus: 5Generating Ontologies From Relational Data With Fuzzy-Syllogistic Reasoning(Springer Verlag, 2015) Kumova, Bora İsmailExisting 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: 5Citation - Scopus: 8The Fuzzy Syllogistic System(Springer Verlag, 2010) Kumova, Bora İsmail; Çakır, HüseyinA 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 Making Accident Data Compatible With Its-Based Traffic Management: Turkish Case(Intelligent Transport Systems, 2010) Duvarcı, Yavuz; Geçer Sargın, Feral; Kumova, Bora İsmail; Çınar, Ali Kemal; Selvi, ÖmerOne of the most important reasons of the high rate of accidents would largely lend itself to ineffective data collection and evaluation process since the necessary information cannot be obtained effectively from the traffic accidents reports (TAR). The discord and dealing with non-relevant data may appear at four levels: (1) Country and Cultural, (2) Institutional and organizational, (3) Data collection, (4) Data analysis and Evaluation. The case findings are consistent with this knowledge put forward in the literature; there is a transparency problem in coordination between the institutions as well as the inefficient TAR data, which is open to manipulation; the problem of under-reporting and inappropriate data storage prevails before the false statistical evaluation methods. The old-fashioned data management structure causes incompatibility with the novel technologies, avoiding timely interventions in reducing accidents and alleviating the fatalities. Transmission of the data to the interest agencies for evaluation and effective operation of the ITS-based systems should be considered. The problem areas were explored through diagnoses at institutional, data collection, and evaluation steps and the solutions were determined accordingly for the case city of Izmir.Conference Object Citation - Scopus: 1Approximate Reasoning With Fuzzy-Syllogistic Systems(CEUR Workshop Proceedings, 2015) Kumova, Bora İsmailThe 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.Conference Object Citation - Scopus: 3Ontology-Based Fuzzy-Syllogistic Reasoning(Springer Verlag, 2015) Zarechnev, Mikhail; Kumova, Bora İsmailWe 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 A Data Coding and Screening System for Accident Risk Patterns: A Learning System(WITPress, 2011) Geçer Sargın, Feral; Geçer Sargın, Feral; Duvarcı, Yavuz; Duvarcı, Yavuz; İnan, E.; İnan, E.; Kumova, Bora İsmail; Kumova, Bora İsmail; Atay Kaya, İlgi; Atay Kaya, İlgiAccidents on urban roads can occur for many reasons, and the contributing factors together pose some complexity in the analysis of the casualties. In order to simplify the analysis and track changes from one accident to another for comparability, an authentic data coding and category analysis methods are developed, leading to data mining rules. To deal with a huge number of parameters, first, most qualitative data are converted into categorical codes (alpha-numeric), so that computing capacity would also be increased. Second, the whole data entry per accident are turned into ID codes, meaning each crash is possibly unique in attributes, called 'accident combination', reducing the large number of similar value accident records into smaller sets of data. This genetical code technique allows us to learn accident types with its solid attributes. The learning (output averages) provides a decision support mechanism for taking necessary cautions for similar combinations. The results can be analyzed by inputs, outputs (attributes), time (years) and the space (streets). According to Izmir's case results; sampled data and its accident combinations are obtained for 3 years (2005 - 2007) and their attributes are learned. © 2011 WIT Press.