First, we consider different kinds of representation of uncertainty and the meth- ods for updating each of them by conditioning. We focus on the generic frame- work of (conditional) plausibility spaces, since it generalises all the introduced representations. Further, we select three frameworks and list the properties that need to be added to a conditional plausibility space in order to recover each of these frameworks. The main goal of this work, however, is to show how public announcement on single-agent plausibility models, ranking structures, and pos- sibility structures realised by their corresponding update mechanisms, can be embedded into the framework of conditional plausibility spaces. At the very end we briefly illustrate a general update model using plausibility measures. Keywords: belief revision, dynamic logic, epistemic logic, plausibility space, pub- lic announcement, uncertainty, update.

Prognozuojant finansinių fondų dinamiką, dažniausiai sunku pasirinkti vieną iš daugelio esamų prognozavimo metodų, nes kiekvienas jų turi pranašumų ir trūkumų. Atlikta plačiai naudojamų prognozavimo metodų Soros, Bayeso, AR, Wiener analizė. Plačiai prognozavimui naudojami matematinės statistikos metodai, tačiau dažnai jie nagrinėja funkcijas su dideliais kintamųjų skaičiais. Tai daugelio diskretinių optimizavimo problemų atvejai. Norint apriboti klaidų skaičių reikia daugiau skaičiavimo bandymų. Dažnai bandymų skaičius turi didėti eksponentiškai. Gali būti kad įvykių statistikoje nėra duomenų kaip elgtis pagal tam tikrą situaciją. Dėl šių ir kitų priežasčių ieškoti kiti prognozavimo metodai. Šiame darbe finansinių fondų dinamikai prognozuoti naudojama miglotoji logika. Sukurta sistema prognozuoja įvykių grupių poveikius fondų kreivei, o ne remiasi statistika. Tai ekspertinis prognozavimo metodas. Miglotoji logika suteikia galimybę ekspertams analizuoti ir nusakyti probleminę sritį miglotomis taisyklėmis. Miglotosios taisyklės sudaromos iš žmogui suprantamų teiginių. Jomis ekspertai gali nustatyti sistemos įėjimo duomenis. Tokių įėjimo duomenų paklaida priklauso nuo specialistų patirties ir intuicijos įvertinti įvykių grupių poveikį fondų kreivei. Šiame darbe analizuoti fondų kreivės aproksimavimo būdai naudojant interpoliavimo ir suglodinimo metodus. Taip pat analizuotas Sklansky ir Gonzalez aproksimavimo algoritmas, kuris buvo realizuotas jį pamodifikavus. Bei pateikti... [toliau žr. visą tekstą] / Forecasting the dynamics of financial funds, often are difficult to choose one of the many existing prediction methods, because each of them has advantages and disadvantages. Performed widely used forecasting techniques Soros, Bayeso, AR, Wiener analysis. It is widely used in prediction methods of mathematical statistics. Often mathematical statistics methods examine the functions of the large number of variables. Large numbers of variables are the main problems in many cases for discreet optimization methods. To limit the number of errors in calculating it is need for more testing. Often number of experiments should increase exponentially. It is possible that the statistics of events do not behave according to the data of a certain situation. For these and other reasons there was seek for other forecasting methods. In this work, fuzzy logic used to predict the dynamics of financial funds. The developed system predicts event’s groups effects of funds curve, and are not based on statistics. This is expert prediction method. Fuzzy logic makes possible for experts to analyze and define the problematic area of vague rules. Fuzzy rules are made from statements which are easy to understand. Experts can detect the input data. Such input data error depends on the expert experience and intuition to assess the impact of events groups funds curve. In this work where analyzed approximation methods as interpolation and smoothing the curve. Approximation algorithm of Sklansky and Gonzalez... [to full text]

Darbe nagrinėjami algoritmai skirti automatiniam automobilio parkavimui. Pasirinkti du algoritmai: pirmasis remiasi ultragarso sonarų teikiama informacija, antrasis ultragarso sonarų ir vaizdo kameros teikiamais duomenimis. Abu algoritmai remiasi fuzzy logika. Nustatyta, kad realiomis sąlygomis atlikti automatinį automobilio parkavimą remiantis tik ultragarso sonarais yra nepatikima – patikimumas ir sistemos nauda ženkliai pagerėja pasitelkus vaizdo kamerą. Įsisavinus ir perpratus robotikos platformą Microsoft Robotics Developer Studio 4 sukurtas automobilio modelis grafinėje miesto aplinkoje. Modelis aprūpintas sonarais ir vaizdo kameromis, todėl gali būti universaliai naudojamas parkavimosi algoritmų bandymams ir analizei Microsoft Robotics Developer Studio 4 vizualios simuliacijos aplinkoje (VSE). / The thesis „Motion Trajectory Planning Using Distance Sensors“ deals with algorithms for automatic car parking. There were chosen two algorithms: the first is based on information provided by ultrasonic sonars, and the second is based on ultrasonic sonars and video camera. It was found that under realistic conditions algorithm based only on sonars is not such reliable as algorithm based on ultrasonic sonars and video camera, which significantly improves the results. There was created graphical model of the car in urban environment in Microsoft Robotics Developer Studio 4. The model is equipped with sonars and video cameras, so it can be universally used for parking algorithms analysis and testing in Microsoft Robotics Developer Studio 4 visual simulation environment (VSE).

The aim of this work is to use contemporary notation to build theory of Rosser logic, explain in detail its relation to Peano arithmetic, show its Kripke semantics and finally using plural self-reference show the proof of arithmetical completeness. In the last chapter we show some of the properties of Rosser sentences. Powered by TCPDF (www.tcpdf.org)

This text is especialy intended to those who are interested into fuzzy logic and its application in relational databases. It is mainly focused on concept of fuzzyfied relational database and implementation of such database. This text consists of two parts: theoretical aspects of fuzzyfication and implementation part. Selected extension is based on fuzzy E-R model so the requirements of the real world can be better met. This paper also describes existing solutions on different level of fuzzyfication. Part of the work is design and implementation of a simple software for querying over fuzzyfied relational database. This work shoud also serve as a guide for design and implementation of fuzzy database.

No description available.

Performance testing is a mean used to evaluate speed of software projects. In an ideal state a project has a set of tests attached to it and such set may be repeat- edly executed in order to verify that all performance expectations are satisfied. The most widespread method of constructing these tests nowadays is based on measuring absolute time values. A test executes a chosen application unit and then compares the time it took to complete with a precise bound, which has been determined in advance. However, this approach has several disadvantages that affect reliability of such tests. First of all, the way in which those precise bounds should be established is not clear. And even if it is, then the bounds are tied to a certain hardware configuration. As a remedy, this thesis demonstrates a whole another approach, which is based on relative performance comparison. Using a logic built on top of a research published by the issuing department, chosen application units are compared together in a manner that makes results of such tests more reliable even to a change of hardware configuration. The presented theory is also implemented and verified on selected use cases. 1

Disertacijoje nagrinėjamos žinių logikos su centrinio agento sąveikos aksioma. Tyrimas apima multimodalines logikas Kn, Tn, K4n ir S4n. Disertacijos tikslas – baigtinės išvedimo paieškos sekvenciniai skaičiavimai minėtoms logikoms. Darbe pristatomas naujas išvedimo paieškos baigtinumą užtikrinantis metodas, kuris yra pritaikomas minėtoms logikoms, o taip pat monomodalinėms logikoms K4 ir S4. / In the dissertation epistemic logics with central agent interaction axiom are analysed. The research covers multimodal logics Kn, Tn, K4n and S4n. The aim of the work is finite derivation search sequent calculi for the mentioned logics. A new method to obtain the termination of derivation search is presented in the thesis and this method is applied to the mentioned logics as well as to monomodal logics K4 and S4.

In the dissertation epistemic logics with central agent interaction axiom are analysed. The research covers multimodal logics Kn, Tn, K4n and S4n. The aim of the work is finite derivation search sequent calculi for the mentioned logics. A new method to obtain the termination of derivation search is presented in the thesis and this method is applied to the mentioned logics as well as to monomodal logics K4 and S4. / Disertacijoje nagrinėjamos žinių logikos su centrinio agento sąveikos aksioma. Tyrimas apima multimodalines logikas Kn, Tn, K4n ir S4n. Disertacijos tikslas – baigtinės išvedimo paieškos sekvenciniai skaičiavimai minėtoms logikoms. Darbe pristatomas naujas išvedimo paieškos baigtinumą užtikrinantis metodas, kuris yra pritaikomas minėtoms logikoms, o taip pat monomodalinėms logikoms K4 ir S4.

Title: Reasoning in Description Logics Author: Mgr. Jaromír Malenko Department: Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague Supervisor: Prof. RNDr. Petr Štěpánek, DrSc.; Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University in Prague Keywords: Description logic, Reasoner, Cartesian product, Non-monotonic reasoning Abstract: We deal with several aspects of reasoning in Description Logics. First, since description logic (DL) is a subset of First Order Logic (FOL), we use a FOL reasoner to reason in DL. We implemented dl2fol, a DL reasoner that takes an ontology (a DL theory with rules), translates it into a FOL theory, passes this set of formulae to an underling FOL reasoner, and interprets the result in terms of given ontology. This is an effective method for reasoning with newly introduced language constructors. However, we observed longer running times and that satisfiability of some DL concepts wasn't proved due to FOL undecidability. Second, we extend two DLs by introducing new language construct: cartesian product (CP) of concepts and roles. This allows for expressing relationships, that are not expressible by other means in weaker DLs. We...