<p>U ovoj doktorskoj disertaciji predložen je i analiziran metod koji kombinuje primenu entropije odabranih obeležja mrežnog saobraćaja i Takagi-Sugeno-Kang (TSK) neuro-fazi modela u detekciji DoS napada. Entropija je primenjena jer omogućava detekciju širokog spektra statističkih anomalija uzrokovanih DoS napadima dok TSK neuro-fazi model daje dodatni kvalitet u konačnom određivanju tačaka početka i kraja napada povećavajući odnos ispravno i pogrešno detektovanih napada.</p> / <p>In this thesis a new method for DoS attack detection is proposed. This method<br />combines the use of entropy of some characteristic parameters of network traffic<br />and Takagi-Sugeno-Kang (TSK) neuro-fuzzy model. Entropy has been used because<br />it enables detection of wide spectar of network anomalies caused by DoS attacks,<br />while TSK adds new value to final detection of the start and the end of an attack<br />increasing ratio between true and false detections.</p>

Presently information systems are increasingly penetrating to our daily life. Recently it is relevant to integrate the newest technologies. In that way traditional system becomes “smart” who are more economical, optimal, and self-sufficient. The biggest problem is to make a model of “smart” system. There were analyzed modeling methods, heating and cooling control systems in this job. Mathematical model for heating and cooling controller using fuzzy logic was presented. According to analyzed problems it was made verification with Matlab during experimental phase. There was made comparison evaluation of mathematical model made with fuzzy logic and timed Petri nets.

Automated proof system for logic of correlated knowledge is presented in the dissertation. The system consists of the sequent calculus GS-LCK and the proof search procedure GS-LCK-PROC. Sequent calculus is sound, complete and satisfy the properties of invertibility of rules, admissibility of weakening, contraction and cut. The procedure GS-LCK-PROC is terminating and allows to check if the sequent is provable. Also decidability of logic of correlated knowledge has been proved. Using the terminating procedure GS-LCK-PROC the validity of all formulas of logic of correlated knowledge can be checked. / Automatinė įrodymų sistema koreliatyvių žinių logikai yra pristatoma disertacijoje. Sistemą sudaro sekvencinis skaičiavimas GS-LCK ir įrodymo paieškos procedūra GS-LCK-PROC. Sekvencinis skaičiavimas yra pagrįstas, pilnas ir tenkina taisyklių apverčiamumo, silpninimo, prastinimo ir pjūvio leistinumo savybes. Procedūra GS-LCK-PROC yra baigtinė ir leidžia patikrinti, ar sekvencija yra išvedama. Taip pat buvo įrodytas koreliatyvių žinių logikos išsprendžiamumas. Naudojant baigtinę procedūra GS-LCK-PROC, visų koreliatyvių žinių logikos formulių tapatus teisingumas gali būti patikrintas.

The aim of this thesis is to explore the potential of resolution-based methods for linear temporal reasoning. On the abstract level, this means to develop new algorithms for automated reasoning about properties of systems which evolve in time. More concretely, we will: 1) show how to adapt the superposition framework to proving theorems in propositional Linear Temporal Logic (LTL), 2) use a connection between superposition and the CDCL calculus of modern SAT solvers to come up with an efficient LTL prover, 3) specialize the previous to reachability properties and discover a close connection to Property Directed Reachability (PDR), an algorithm recently developed for model checking of hardware circuits, 4) further improve PDR by providing a new technique for enhancing clause propagation phase of the algorithm, and 5) adapt PDR to automated planning by replacing the SAT solver inside with a planning-specific procedure. We implemented the proposed ideas and provide experimental results which demonstrate their practical potential on representative benchmark sets. Our system LS4 is shown to be the strongest LTL prover currently publicly available. The mentioned enhancement of PDR substantially improves the performance of our implementation of the algorithm for hardware model checking in the multi-property...

In this thesis we study completeness properties of infinitary propositional logics from the perspective of abstract algebraic logic. The goal is to under- stand how the basic tool in proofs of completeness, the so called Linden- baum lemma, generalizes beyond finitary logics. To this end, we study few properties closely related to the Lindenbaum lemma (and hence to com- pleteness properties). We will see that these properties give rise to a new hierarchy of infinitary propositional logic. We also study these properties in scenarios when a given logic has some (possibly very generally defined) connectives of implication, disjunction, and negation. Among others, we will see that presence of these connectives can ensure provability of the Lin- denbaum lemma. Keywords: abstract algebraic logic, infinitary logics, Lindenbaum lemma, disjunction, implication, negation

This diploma thesis deals with the Thomas Aquinas´s Conception of Natural Law. The fundamental content of thesis is the Czech translation and critical Commentaries of English written articles. Thesis is divided into three parts. There is a theoretical foundation for Natural Law Conception and Thomas Aquinas themes in the first part, the Critical Commentaries of translated articles in the second part and the translated articles in the third part of diploma thesis. Translated articles are the philosophy studies of Natural Law and its relation to the Lawmaking, the Logic of Ethical Discourse and the Human Rights. There are copies of original English written articles as diploma thesis attachments.

Master's thesis is focused on the utilization of artificial intelligence in decisionmaking (process) of company AMD Netolický Ltd. Within this thesis are defined problems and proposed possible measures that will in the future lead to improvement of actual situation of company in the selection of suitable supplier. Among the principal elements, which are used in the thesis belongs fuzzy logic, analysis and expert systems.

The topic of this study is: The logic of faith: prayer as the link between rationality and experience in a study of Karl Rahner and John Calvin. The term ‘logic of faith’ refers to the correct way of reasoning about faith. Why do a study about the theology of Rahner? Firstly because Rahner is known as the theologian who emphasises a unity between theology and spirituality. In exploring Rahner’s theology, the question that does arise is: is Rahner a philosopher or a theologian? Rahner endeavours to question the logic of theology. In his philosophical, theological and spiritual works one discovers the ‘heart’ of modern man. Rahner connects the logic of faith with the everyday experience of man. This experience is his point of departure in presenting the case for Christianity. In relation to this, Rahner sees prayer as a common human experience and the key in discovering the unity between rationality and experience. Prayer implies experiencing God in ordinary everyday life. Through prayer the lost unity between God and man is restored. Although Rahner’s definition of experience may be vague and therefore subject to criticism, he gives a positive interpretation of the concept of experience in the sense of acceptance of the ‘self’. To him, the logic of faith is closely related to the acceptance of the ‘self’. Rahner’s view give rise to the following question: Does the truth of a theological statement present itself in experience or in faith only? This question is also put to the reformed tradition of which Calvin is a representative. Both Rahner and Calvin stress the unity between theology and spirituality. Knowing God and understanding man are inseparable concepts. Yet we a find an emphasis in Calvin’s theology, that we do not see in Rahner’s theology. Calvin accepts, unconditionally, the revelation of God in Jesus Christ as the source of faith. True understanding of human nature is dependant on God’s revelation in Scripture. To Calvin, the logic of faith goes against common human experience and rationality. We ask the question about the logic of faith; prayer directs us to the source of the answer: the Word of God. This is the truth that the reformers rediscovered. The logic of faith implies a living relationship with Jesus Christ through His Word and Spirit and prayer is the main exercise of this relationship. In this sense prayer is the Urakt of Christian ethics, the first step in becoming a disciple. This we see in Calvin’s exegesis of the Lord’s Prayer. The logic of faith and therefore faith itself become mysticism without God’s revelation through Scripture. This study concludes that prayer is a neglected theme in the reformed tradition. Rahner and Calvin give us a new appreciation for the logic of faith and prayer as an integral part thereof. / Thesis (DD (Dogmatics and Christian Ethics))--University of Pretoria, 2007. / Dogmatics and Christian Ethics / unrestricted

This thesis focus on consistency of a specific class of fuzzy logic theories that represent certain inference system. This class of theories is defined as theories containing especially so called special axioms representing rules of modeled inference system and evaluated set of formulas representing case data. Functional approach is used to develop three popular fuzzy calculi: the Gödel logic, Łukasiewicz logic and product logic. As a language it is used the language of first order propositional fuzzy logic with valuation. To check consistency we use the concept of inconsistency degree and in Łukasiewicz logic also the principle of polar index. The concept of consistency degree is also described, but not used. Simple algorithm is developed to check consistency of theory upon the basis of inconsistency degree principle. A method of use of polar index is also described and illustrated. For each fuzzy theory a term of corresponding classical theory is defined. Then consistency of fuzzy theories and their corresponding classical theories are compared. The results of comparison are presented on the example of the ad-hoc created diagnostic inference system MEDSYS II. In the end the relation between consistency of fuzzy theory of inference system and it's corresponding theory is introduced for all three used calculi and both contradiction concepts.

This thesis studies the use of dynamic epistemic logics for the sake of information privacy. The core of the work is the synthesis of three approaches: security logics from A. Hommersom, plausibility frames and communication logic from A. Baltag and S. Smets, and studies concerning the so called Russian cards protocol. Thereafter we present a program, made in the NetLogo environment, in order to demonstrate the workings of the basic ideas.