year

Size: px
Start display at page:

Download "year"

Transcription

1 Fuzzy Prediction of Sunspot Number Dana Majerová, Ale»s Procházka, Jarom r Kukal ICT Prague, Department of Computing and Control Engineering Abstract. The paper is devoted to a fuzzy data processing and a time series prediction. We chose a ψlukasiewicz algebra with square root function for solving a problem of sunspot number prediction. We tested a lot of fuzzy logic functions. Four criteria were used for evaluating their prediction quality. A collection of fourteen advisable FIR filters was found. A fuzzy network was constructed using this filter set in the second phase. The fuzzy network weights were optimized for each criterion and the results were compared with auto regressive model. All the fuzzy algorithms were realized in the MATLAB system. Keywords: prediction, fuzzy processing, fuzzy logic function, ψlukasiewicz algebra, neural network, Modus Ponens, inductive learning, Matlab. Introduction The prediction in time series is a general problem related to many practical tasks. We suppose the fuzzy data processing with constrained sensitivity is a good tool for the prediction. The main idea is to use the simplest possible algebra with the widest abilities. Our algebraic model enables to construct both linear and non-linear filters including a neural network based on Modus Ponens rule. Theoretical Foundation A background of fuzzy data processing is the ψlukasiewicz algebra [] with square root (ψla sqrt ). The other basic logic algebras like Gougen or Gödel are not good models because of discontinuity of residuum or lack of square root function [7]. The algebraic model is described in [4]. The definition of fuzzy logic function (FLF) and its sensitivity is also included. The FLF's are used in a Modus Ponens Fuzzy Network (MPFN) []. The MPFN consists of four layers containing n input nodes, H FLF nodes, the layer of Modus Ponens law with learnable rule weights and m output nodes. Any MPFN output is FLF of input vector. THEOREM: Let H N be a number of hidden FLF's in the given Modus Ponens Fuzzy Network. Let j be their sensitivities for j = ;:::;H. Then any MPFN output is FLF of input variables with the sensitivity» max j=;:::;h j: 3 FIR Filters and Fuzzy Prediction The FIR filters [6] are the standard tools for time series processing and prediction. Some FIR filters are FLF's.

2 THEOREM: Let N N, n N and m k N for k =;:::;n. Let! x L n. Let w k = m k = N be dyadic weights for k =;:::;n and P n k= w k». Then any FIR filter nx Y (! x )= w k x k k= is a FLF in the ψla sqrt and it satisfies the Lipschitz condition with the sensitivity = max k=;:::;n w k: THEOREM: Let N N, n N and m k Z for k =;:::;n. Let! x L n. Let w k = m k = N be dyadic weights for k =;:::;n. Let P w k > w k», P w k < jw kj»: Then ψ nx P (! x ) = max! ; w k x k k= is a FLF in the ψla sqrt and it satisfies the Lipschitz condition with the sensitivity = max k=;:::;n jw kj: 4 Experimental Results A famous problem of sunspot number prediction was solved using the MATLAB [5] environment and sunspot data from 7 to 997. The sunspot number history is described on the Fig.. The original sunspot number series fs k g t k= were transformed using the differential fuzzyfication s f k = k +=4 s k +=4+s k +=4 : The f k truth value corresponds to the proposition: The sunspot number increases (see Fig. ) Figure : Sunspot number history The sunspot number prediction from previous four history was studied for» D» 4 where D N. The relation between the prediction task and MPFN patterns is defined as x i = f k i for i =;:::;D and y = ffi(f k ;:::;f k D) where ffi is any FLF.

3 A lot of experiments with various FLF's which are FIR filters were proceed in the first step. Four criteria were used for evaluated their prediction quality MAXE = max STDE = vu u i=;:::;m t m p max k=;:::;p jy ki Y i (! x k )j; mx px (y ki Y i (! x k )) ; i= k= mx AV GE = m p jy ki Y i (! x k )j; i= k= MEDE = max ki Y i (! x k )j: i=;:::;m k=;:::;p px Using FLF's μ(x) = max(; min(;x)), ν(x; N) = N x +( N )= the best individual FLF predictors are h = h = ν(x; ) h3 = ν(x; 4) h4 = ν h5 = ν h6 = ν x Ψ x x Ψ x 3 x + x3 4 4 x + x3 8 ; ; 4 Ψ 3 x 4 Ψ 6 x + x4 h7 = ν 8 x + x h8 = ν ; h9 = ν(x _ x _ x3 _ x4; ) h = ν(x ^ x; ) h = ν(x _ x; ) ; 5 ; 5 h = ν(x ^ x ^ x3; ) ((x _ x) ^ (x _ x3) ^ (x _ x3)) + (x _ x _ x3) h3 = ν ; 3 h4 = ν(x _ x _ x3; ): The best 4 FLF filters and their negations were used in the MPFN hidden layer of size H = 8. The MPFN was realized through two general functions in MATLAB [3]. The MPFN weights were optimized in the second phase. Penalty functions MAXE, STDE, AVGE and MEDE were minimized using the MCRS global optimization technique. The auto regressive model (AR) of 4 th order was used as prediction standard. The results are described in the Tab.. The Figs. 4 7 show selected MPFN outputs and results of simple FLF's. 5 Conclusions The ψlukasiewicz algebra enriched by square root enables to realize operators approaching to weighted averages. It is appropriate for construct fuzzy network with limiting sensitivity. The

4 k h k name N MAXE STDE AVGE MEDE constant "linear" prediction "linear" prediction "quadratic" prediction "quadratic" prediction "cubic" prediction "biquadratic" prediction average of two maximum of four minimum of two maximum of two minimum of three th of three maximum of three MPFN for minimum MAXE MPFN for minimum STDE MPFN for minimum AVGE MPFN for minimum MEDE AR of fourth order Table : FLF filter efficiency Figure : Fuzzyfication: sunspot number increases Figure 3: "Linear" prediction for N = Figure 4: "Quadratic" prediction for N =

5 Figure 5: Maximum of two for N = Figure 6: MPFN for optimum STDE Figure 7: MPFN for optimum AVGE Modus Ponens Fuzzy Network is applicable tool for fuzzy prediction. The optimization of fuzzy network structure will be a subject of our future research. Acknowledgement The work has been supported by the Research Intention of the Faculty of Chemical Engineering of the Institute of Chemical Technology in Prague. This support is very gratefully acknowledged. References [] Kukal J. Modus Ponens Fuzzy Network. In: MENDEL. Brno.. [] ψlukasiewicz J. Selected Works. Amsterdam. 97. [3] Majerová D., Kukal J. Modus Ponens Fuzzy Network in Matlab. In: MATLAB. Prague.. [4] Majerová D., Kukal J., Procházka A. D Image Fuzzy Filters in Matlab. In: MATLAB. Prague..

6 [5] Matlab 5.3. The MathWorks, Inc [6] Mitra S. K., Kaiser J. F. Handbook for Digital Signal Processing. John Wiley & Sons. New York [7] Novák V., Perfilieva I., Mo»cko»r J. Mathematical Principles of Fuzzy Logic. Kluwer Academic Publishers. Boston Contact Dana Majerová, Ale»s Procházka, Jarom r Kukal INSTITUTE OF CHEMICAL TECHNOLOGY, Prague Department of Computing and Control Engineering Technická 5, 66 8 Prague 6 Dejvice Phone: , fax: s: fdana.majerova, Ales.Prochazka, Jaromir.Kukalg@vscht.cz WWW addresses: (university), (department), (research group)

Omitting Types in Fuzzy Predicate Logics

Omitting Types in Fuzzy Predicate Logics University of Ostrava Institute for Research and Applications of Fuzzy Modeling Omitting Types in Fuzzy Predicate Logics Vilém Novák and Petra Murinová Research report No. 126 2008 Submitted/to appear:

More information

A New Intuitionistic Fuzzy Implication

A New Intuitionistic Fuzzy Implication BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No Sofia 009 A New Intuitionistic Fuzzy Implication Lilija Atanassova Institute of Information Technologies, 1113 Sofia

More information

Constructions of Models in Fuzzy Logic with Evaluated Syntax

Constructions of Models in Fuzzy Logic with Evaluated Syntax Constructions of Models in Fuzzy Logic with Evaluated Syntax Petra Murinová University of Ostrava IRAFM 30. dubna 22 701 03 Ostrava Czech Republic petra.murinova@osu.cz Abstract This paper is a contribution

More information

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and

More information

A note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic

A note on fuzzy predicate logic. Petr H jek 1. Academy of Sciences of the Czech Republic A note on fuzzy predicate logic Petr H jek 1 Institute of Computer Science, Academy of Sciences of the Czech Republic Pod vod renskou v 2, 182 07 Prague. Abstract. Recent development of mathematical fuzzy

More information

Fuzzy relation equations with dual composition

Fuzzy relation equations with dual composition Fuzzy relation equations with dual composition Lenka Nosková University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1 Czech Republic Lenka.Noskova@osu.cz

More information

RESOLUTION PRINCIPLE IN FUZZY PREDICATE LOGIC

RESOLUTION PRINCIPLE IN FUZZY PREDICATE LOGIC 3 RESOLUTION PRINCIPLE IN FUZZY PREDICATE LOGIC Hashim Habiballa * Institute for Research and Applications of Fuzzy Modeling, University of Ostrava,30. dubna 22, Ostrava, Czech Republic e-mail: Hashim.Habiballa@osu.cz

More information

Approximating models based on fuzzy transforms

Approximating models based on fuzzy transforms Approximating models based on fuzzy transforms Irina Perfilieva University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1, Czech Republic e-mail:irina.perfilieva@osu.cz

More information

Digital Processing of Noise Experimental Sorption Data using Savitzky-Golay filter

Digital Processing of Noise Experimental Sorption Data using Savitzky-Golay filter Digital Processing of Noise Experimental Sorption Data using Savitzky-Golay filter Vladimír Hanta 1, Jaroslav Poživil 1, Karel Friess 2 Department of Computing and Control Engineering 1, Department of

More information

CHAPTER 11. Introduction to Intuitionistic Logic

CHAPTER 11. Introduction to Intuitionistic Logic CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated

More information

OPTIMUM STOCHASTIC CLASSIFIER IN MATLAB

OPTIMUM STOCHASTIC CLASSIFIER IN MATLAB OPTIMUM STOCHASTIC CLASSIFIER IN MATLAB J. Kukal 1, L. Hainc 1, D. Majerová 2 1 DCCE FCE ICT Prague 2 DSEE FNSPE CTU in Prague Abstract Any bipolar deterministic classifier is a function f : R n { 1, +1}

More information

Fuzzy Logic in Narrow Sense with Hedges

Fuzzy Logic in Narrow Sense with Hedges Fuzzy Logic in Narrow Sense with Hedges ABSTRACT Van-Hung Le Faculty of Information Technology Hanoi University of Mining and Geology, Vietnam levanhung@humg.edu.vn arxiv:1608.08033v1 [cs.ai] 29 Aug 2016

More information

A Fuzzy Formal Logic for Interval-valued Residuated Lattices

A Fuzzy Formal Logic for Interval-valued Residuated Lattices A Fuzzy Formal Logic for Interval-valued Residuated Lattices B. Van Gasse Bart.VanGasse@UGent.be C. Cornelis Chris.Cornelis@UGent.be G. Deschrijver Glad.Deschrijver@UGent.be E.E. Kerre Etienne.Kerre@UGent.be

More information

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017 3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,

More information

The Process of Mathematical Proof

The Process of Mathematical Proof 1 The Process of Mathematical Proof Introduction. Mathematical proofs use the rules of logical deduction that grew out of the work of Aristotle around 350 BC. In previous courses, there was probably an

More information

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.

Conjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows. Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is

More information

Introduction to Fuzzy Sets and Fuzzy Logic

Introduction to Fuzzy Sets and Fuzzy Logic Introduction to Fuzzy Sets and Fuzzy Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada REASONPARK. Foligno, 17-19 September 2009 1/

More information

Fuzzy Propositional Logic for the Knowledge Representation

Fuzzy Propositional Logic for the Knowledge Representation Fuzzy Propositional Logic for the Knowledge Representation Alexander Savinov Institute of Mathematics Academy of Sciences Academiei 5 277028 Kishinev Moldova (CIS) Phone: (373+2) 73-81-30 EMAIL: 23LSII@MATH.MOLDOVA.SU

More information

MATH 2001 MIDTERM EXAM 1 SOLUTION

MATH 2001 MIDTERM EXAM 1 SOLUTION MATH 2001 MIDTERM EXAM 1 SOLUTION FALL 2015 - MOON Do not abbreviate your answer. Write everything in full sentences. Except calculators, any electronic devices including laptops and cell phones are not

More information

COMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS

COMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS COMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS MUSOKO VICTOR, PROCHÁZKA ALEŠ Institute of Chemical Technology, Department of Computing and Control Engineering Technická 905, 66 8 Prague 6, Cech

More information

Logic for Computer Science - Week 5 Natural Deduction

Logic for Computer Science - Week 5 Natural Deduction Logic for Computer Science - Week 5 Natural Deduction Ștefan Ciobâcă November 30, 2017 1 An Alternative View of Implication and Double Implication So far, we have understood as a shorthand of However,

More information

University of Ostrava. Non-clausal Resolution Theorem Proving for Fuzzy Predicate Logic

University of Ostrava. Non-clausal Resolution Theorem Proving for Fuzzy Predicate Logic University of Ostrava Institute for Research and Applications of Fuzzy Modeling Non-clausal Resolution Theorem Proving for Fuzzy Predicate Logic Hashim Habiballa Research report No. 70 2005 Submittedto

More information

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation Tommaso Flaminio Dipartimento di Matematica Università di Siena Pian dei Mantellini 44 53100 Siena (Italy) flaminio@unisi.it

More information

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof

MCS-236: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, Methods of Proof MCS-36: Graph Theory Handout #A4 San Skulrattanakulchai Gustavus Adolphus College Sep 15, 010 Methods of Proof Consider a set of mathematical objects having a certain number of operations and relations

More information

ARTIFICIAL NEURAL NETWORK WITH HYBRID TAGUCHI-GENETIC ALGORITHM FOR NONLINEAR MIMO MODEL OF MACHINING PROCESSES

ARTIFICIAL NEURAL NETWORK WITH HYBRID TAGUCHI-GENETIC ALGORITHM FOR NONLINEAR MIMO MODEL OF MACHINING PROCESSES International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 4, April 2013 pp. 1455 1475 ARTIFICIAL NEURAL NETWORK WITH HYBRID TAGUCHI-GENETIC

More information

Fleas and fuzzy logic a survey

Fleas and fuzzy logic a survey Fleas and fuzzy logic a survey Petr Hájek Institute of Computer Science AS CR Prague hajek@cs.cas.cz Dedicated to Professor Gert H. Müller on the occasion of his 80 th birthday Keywords: mathematical fuzzy

More information

A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions

A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions Fernando Bobillo Miguel Delgado Juan Gómez-Romero Department of Computer Science and Artificial Intelligence University

More information

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001

Logic. Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Logic Introduction to Artificial Intelligence CS/ECE 348 Lecture 11 September 27, 2001 Last Lecture Games Cont. α-β pruning Outline Games with chance, e.g. Backgammon Logical Agents and thewumpus World

More information

FORECASTING OF ECONOMIC QUANTITIES USING FUZZY AUTOREGRESSIVE MODEL AND FUZZY NEURAL NETWORK

FORECASTING OF ECONOMIC QUANTITIES USING FUZZY AUTOREGRESSIVE MODEL AND FUZZY NEURAL NETWORK FORECASTING OF ECONOMIC QUANTITIES USING FUZZY AUTOREGRESSIVE MODEL AND FUZZY NEURAL NETWORK Dusan Marcek Silesian University, Institute of Computer Science Opava Research Institute of the IT4Innovations

More information

Data compression on the basis of fuzzy transforms

Data compression on the basis of fuzzy transforms Data compression on the basis of fuzzy transforms Irina Perfilieva and Radek Valášek University of Ostrava Institute for Research and Applications of Fuzzy Modeling 30. dubna 22, 701 03 Ostrava 1, Czech

More information

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson

Natural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of

More information

Many-Valued Semantics for Vague Counterfactuals

Many-Valued Semantics for Vague Counterfactuals Many-Valued Semantics for Vague Counterfactuals MARCO CERAMI AND PERE PARDO 1 1 Introduction This paper is an attempt to provide a formal semantics to counterfactual propositions that involve vague sentences

More information

CS 486: Lecture 2, Thursday, Jan 22, 2009

CS 486: Lecture 2, Thursday, Jan 22, 2009 CS 486: Lecture 2, Thursday, Jan 22, 2009 Mark Bickford January 22, 2009 1 Outline Propositional formulas Interpretations and Valuations Validity and Satisfiability Truth tables and Disjunctive Normal

More information

Some consequences of compactness in Lukasiewicz Predicate Logic

Some consequences of compactness in Lukasiewicz Predicate Logic Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic

More information

Why Bellman-Zadeh Approach to Fuzzy Optimization

Why Bellman-Zadeh Approach to Fuzzy Optimization Applied Mathematical Sciences, Vol. 12, 2018, no. 11, 517-522 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ams.2018.8456 Why Bellman-Zadeh Approach to Fuzzy Optimization Olga Kosheleva 1 and Vladik

More information

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008

Chapter 3: Propositional Calculus: Deductive Systems. September 19, 2008 Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency

More information

Gödel s Completeness Theorem

Gödel s Completeness Theorem A.Miller M571 Spring 2002 Gödel s Completeness Theorem We only consider countable languages L for first order logic with equality which have only predicate symbols and constant symbols. We regard the symbols

More information

UNIVERSITY OF EAST ANGLIA. School of Mathematics UG End of Year Examination MATHEMATICAL LOGIC WITH ADVANCED TOPICS MTH-4D23

UNIVERSITY OF EAST ANGLIA. School of Mathematics UG End of Year Examination MATHEMATICAL LOGIC WITH ADVANCED TOPICS MTH-4D23 UNIVERSITY OF EAST ANGLIA School of Mathematics UG End of Year Examination 2003-2004 MATHEMATICAL LOGIC WITH ADVANCED TOPICS Time allowed: 3 hours Attempt Question ONE and FOUR other questions. Candidates

More information

On Urquhart s C Logic

On Urquhart s C Logic On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced

More information

Fundamentals of Logic

Fundamentals of Logic Fundamentals of Logic No.5 Soundness and Completeness Tatsuya Hagino Faculty of Environment and Information Studies Keio University 2015/5/18 Tatsuya Hagino (Faculty of Environment and InformationFundamentals

More information

A simplified proof of arithmetical completeness theorem for provability logic GLP

A simplified proof of arithmetical completeness theorem for provability logic GLP A simplified proof of arithmetical completeness theorem for provability logic GLP L. Beklemishev Steklov Mathematical Institute Gubkina str. 8, 119991 Moscow, Russia e-mail: bekl@mi.ras.ru March 11, 2011

More information

Fuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras

Fuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras Fuzzy filters and fuzzy prime filters of bounded Rl-monoids and pseudo BL-algebras Jiří Rachůnek 1 Dana Šalounová2 1 Department of Algebra and Geometry, Faculty of Sciences, Palacký University, Tomkova

More information

Residuated fuzzy logics with an involutive negation

Residuated fuzzy logics with an involutive negation Arch. Math. Logic (2000) 39: 103 124 c Springer-Verlag 2000 Residuated fuzzy logics with an involutive negation Francesc Esteva 1, Lluís Godo 1, Petr Hájek 2, Mirko Navara 3 1 Artificial Intelligence Research

More information

Fuzzy Expert Systems Lecture 6 (Fuzzy Logic )

Fuzzy Expert Systems Lecture 6 (Fuzzy Logic ) Fuzzy Expert Systems Lecture 6 (Fuzzy Logic ) Unlike Classical Logic, Fuzzy Logic is concerned, in the main, with modes of reasoning which are approximate rather than exact L. A. Zadeh Lecture 6 صفحه Summary

More information

Natural Deduction for Propositional Logic

Natural Deduction for Propositional Logic Natural Deduction for Propositional Logic Bow-Yaw Wang Institute of Information Science Academia Sinica, Taiwan September 10, 2018 Bow-Yaw Wang (Academia Sinica) Natural Deduction for Propositional Logic

More information

PROPOSITIONAL LOGIC. VL Logik: WS 2018/19

PROPOSITIONAL LOGIC. VL Logik: WS 2018/19 PROPOSITIONAL LOGIC VL Logik: WS 2018/19 (Version 2018.2) Martina Seidl (martina.seidl@jku.at), Armin Biere (biere@jku.at) Institut für Formale Modelle und Verifikation BOX Game: Rules 1. The game board

More information

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC

Discrete Structures & Algorithms. Propositional Logic EECE 320 // UBC Discrete Structures & Algorithms Propositional Logic EECE 320 // UBC 1 Review of last lecture Pancake sorting A problem with many applications Bracketing (bounding a function) Proving bounds for pancake

More information

In Which Sense Is Fuzzy Logic a Logic for Vagueness?

In Which Sense Is Fuzzy Logic a Logic for Vagueness? In Which Sense Is Fuzzy Logic a Logic for Vagueness? Libor Běhounek National Supercomputing Center IT4Innovations, Division University of Ostrava, Institute for Research and Applications of Fuzzy Modeling

More information

COMP Intro to Logic for Computer Scientists. Lecture 6

COMP Intro to Logic for Computer Scientists. Lecture 6 COMP 1002 Intro to Logic for Computer Scientists Lecture 6 B 5 2 J Treasure hunt In the back of an old cupboard you discover a note signed by a pirate famous for his bizarre sense of humour and love of

More information

Lecture 6. Regression

Lecture 6. Regression Lecture 6. Regression Prof. Alan Yuille Summer 2014 Outline 1. Introduction to Regression 2. Binary Regression 3. Linear Regression; Polynomial Regression 4. Non-linear Regression; Multilayer Perceptron

More information

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence.

The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence. The Conditional (IMPLIES) Operator The conditional operation is written p q. The proposition p is called the hypothesis or antecedent. The proposition q is called the conclusion or consequence. The Conditional

More information

1 Boolean Algebra Simplification

1 Boolean Algebra Simplification cs281: Computer Organization Lab3 Prelab Our objective in this prelab is to lay the groundwork for simplifying boolean expressions in order to minimize the complexity of the resultant digital logic circuit.

More information

LCPI method to find optimal solutions of nonlinear programming problems

LCPI method to find optimal solutions of nonlinear programming problems ISSN 1 746-7233, Engl, UK World Journal of Modelling Simulation Vol. 14 2018) No. 1, pp. 50-57 LCPI method to find optimal solutions of nonlinear programming problems M.H. Noori Skari, M. Ghaznavi * Faculty

More information

(Refer Slide Time: )

(Refer Slide Time: ) Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi FIR Lattice Synthesis Lecture - 32 This is the 32nd lecture and our topic for

More information

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic

Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic 1 1 Paraconsistent Semantics for Pavelka Style Fuzzy Sentential Logic E. Turunen, P.O. Box 553, 33101 Tampere, Finland M. Öztürk Artois, F 62307 Lens, France, A. Tsoukias 75775, Paris, France. May 26,

More information

ISSUED BY KENDRIYA VIDYALAYA - DOWNLOADED FROM Chapter - 2. (Polynomials)

ISSUED BY KENDRIYA VIDYALAYA - DOWNLOADED FROM   Chapter - 2. (Polynomials) Chapter - 2 (Polynomials) Key Concepts Constants : A symbol having a fixed numerical value is called a constant. Example : 7, 3, -2, 3/7, etc. are all constants. Variables : A symbol which may be assigned

More information

Computational Intelligence Lecture 13:Fuzzy Logic

Computational Intelligence Lecture 13:Fuzzy Logic Computational Intelligence Lecture 13:Fuzzy Logic Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2011 arzaneh Abdollahi Computational Intelligence Lecture

More information

Propositional and Predicate Logic - V

Propositional and Predicate Logic - V Propositional and Predicate Logic - V Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - V WS 2016/2017 1 / 21 Formal proof systems Hilbert s calculus

More information

Uncertain Logic with Multiple Predicates

Uncertain Logic with Multiple Predicates Uncertain Logic with Multiple Predicates Kai Yao, Zixiong Peng Uncertainty Theory Laboratory, Department of Mathematical Sciences Tsinghua University, Beijing 100084, China yaok09@mails.tsinghua.edu.cn,

More information

Classification. The goal: map from input X to a label Y. Y has a discrete set of possible values. We focused on binary Y (values 0 or 1).

Classification. The goal: map from input X to a label Y. Y has a discrete set of possible values. We focused on binary Y (values 0 or 1). Regression and PCA Classification The goal: map from input X to a label Y. Y has a discrete set of possible values We focused on binary Y (values 0 or 1). But we also discussed larger number of classes

More information

Time Series Prediction by Kalman Smoother with Cross-Validated Noise Density

Time Series Prediction by Kalman Smoother with Cross-Validated Noise Density Time Series Prediction by Kalman Smoother with Cross-Validated Noise Density Simo Särkkä E-mail: simo.sarkka@hut.fi Aki Vehtari E-mail: aki.vehtari@hut.fi Jouko Lampinen E-mail: jouko.lampinen@hut.fi Abstract

More information

Concept lattices in fuzzy relation equations

Concept lattices in fuzzy relation equations Concept lattices in fuzzy relation equations Juan Carlos Díaz and Jesús Medina Department of Mathematics. University of Cádiz Email: {juancarlos.diaz,jesus.medina}@uca.es Abstract. Fuzzy relation equations

More information

How to Define "and"- and "or"-operations for Intuitionistic and Picture Fuzzy Sets

How to Define and- and or-operations for Intuitionistic and Picture Fuzzy Sets University of Texas at El Paso DigitalCommons@UTEP Departmental Technical Reports (CS) Computer Science 3-2019 How to Define "and"- and "or"-operations for Intuitionistic and Picture Fuzzy Sets Christian

More information

ON THE DENSITY OF TRUTH IN GRZEGORCZYK S MODAL LOGIC

ON THE DENSITY OF TRUTH IN GRZEGORCZYK S MODAL LOGIC Bulletin of the Section of Logic Volume 33/2 (2004, pp. 107 120 Zofia Kostrzycka ON THE DENSITY OF TRUTH IN GRZEGORCZYK S MODAL LOGIC Abstract The paper is an attempt to count the proportion of tautologies

More information

Trajectory Planning, Setpoint Generation and Feedforward for Motion Systems

Trajectory Planning, Setpoint Generation and Feedforward for Motion Systems 2 Trajectory Planning, Setpoint Generation and Feedforward for Motion Systems Paul Lambrechts Digital Motion Control (4K4), 23 Faculty of Mechanical Engineering, Control Systems Technology Group /42 2

More information

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages)

Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera

More information

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

2. The Logic of Compound Statements Summary. Aaron Tan August 2017 2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional

More information

Application of Fuzzy Relation Equations to Student Assessment

Application of Fuzzy Relation Equations to Student Assessment American Journal of Applied Mathematics and Statistics, 018, Vol. 6, No., 67-71 Available online at http://pubs.sciepub.com/ajams/6//5 Science and Education Publishing DOI:10.1691/ajams-6--5 Application

More information

Identification of Non-Linear Systems, Based on Neural Networks, with Applications at Fuzzy Systems

Identification of Non-Linear Systems, Based on Neural Networks, with Applications at Fuzzy Systems Proceedings of the 0th WSEAS International Conference on AUTOMATION & INFORMATION Identification of Non-Linear Systems, Based on Neural Networks, with Applications at Fuzzy Systems CONSTANTIN VOLOSENCU

More information

Representing fuzzy structures in quantum computation with mixed states

Representing fuzzy structures in quantum computation with mixed states Representing fuzzy structures in quantum computation with mixed states Hector Freytes Fellow of CONICET-Argentina Email: hfreytes@gmailcom Antonio Arico Department of Mathematics Viale Merello 9, 913 Caglari

More information

A Machine Learning Approach to Define Weights for Linear Combination of Forecasts

A Machine Learning Approach to Define Weights for Linear Combination of Forecasts A Machine Learning Approach to Define Weights for Linear Combination of Forecasts Ricardo Prudêncio 1 and Teresa Ludermir 2 1 Departament of Information Science, Federal University of Pernambuco, Av. dos

More information

Artificial Intelligence. Propositional logic

Artificial Intelligence. Propositional logic Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands

More information

The Core Method. The Very Idea. The Propositional CORE Method. Human Reasoning

The Core Method. The Very Idea. The Propositional CORE Method. Human Reasoning The Core Method International Center for Computational Logic Technische Universität Dresden Germany The Very Idea The Propositional CORE Method Human Reasoning The Core Method 1 The Very Idea Various semantics

More information

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC

AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC Iranian Journal of Fuzzy Systems Vol. 9, No. 6, (2012) pp. 31-41 31 AN ALGEBRAIC STRUCTURE FOR INTUITIONISTIC FUZZY LOGIC E. ESLAMI Abstract. In this paper we extend the notion of degrees of membership

More information

Gaussian Process Regression: Active Data Selection and Test Point. Rejection. Sambu Seo Marko Wallat Thore Graepel Klaus Obermayer

Gaussian Process Regression: Active Data Selection and Test Point. Rejection. Sambu Seo Marko Wallat Thore Graepel Klaus Obermayer Gaussian Process Regression: Active Data Selection and Test Point Rejection Sambu Seo Marko Wallat Thore Graepel Klaus Obermayer Department of Computer Science, Technical University of Berlin Franklinstr.8,

More information

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises WUCT11 Discrete Mathematics Logic Tutorial Exercises 1 Logic Predicate Logic 3 Proofs 4 Set Theory 5 Relations and Functions WUCT11 Logic Tutorial Exercises 1 Section 1: Logic Question1 For each of the

More information

Equational Logic: Part 2. Roland Backhouse March 6, 2001

Equational Logic: Part 2. Roland Backhouse March 6, 2001 1 Equational Logic: Part 2 Roland Backhouse March 6, 2001 Outline 2 We continue the axiomatisation of the propositional connectives. The axioms for disjunction (the logical or of two statements) are added

More information

Butterworth Filter Properties

Butterworth Filter Properties OpenStax-CNX module: m693 Butterworth Filter Properties C. Sidney Burrus This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3. This section develops the properties

More information

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES

ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA, FASCICULUS XL 2002 ITERATED FUNCTION SYSTEMS WITH CONTINUOUS PLACE DEPENDENT PROBABILITIES by Joanna Jaroszewska Abstract. We study the asymptotic behaviour

More information

What is mathematical fuzzy logic

What is mathematical fuzzy logic Fuzzy Sets and Systems 157 (2006) 597 603 www.elsevier.com/locate/fss What is mathematical fuzzy logic Petr Hájek Institute of Computer Science, Academy of Sciences of the Czech Republic, 182 07 Prague,

More information

Approximation of Belief Functions by Minimizing Euclidean Distances

Approximation of Belief Functions by Minimizing Euclidean Distances Approximation of Belief Functions by Minimizing Euclidean Distances Thomas Weiler and Ulrich Bodenhofer Software Competence Center Hagenberg A-4232 Hagenberg, Austria e-mail: {thomas.weiler,ulrich.bodenhofer}@scch.at

More information

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012 March 5, 2012 Webwork Homework. The handout on Logic is Chapter 4 from Mary Attenborough s book Mathematics for Electrical Engineering and Computing. Proving Propositions We combine basic propositions

More information

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning

Comparison of Rough-set and Interval-set Models for Uncertain Reasoning Yao, Y.Y. and Li, X. Comparison of rough-set and interval-set models for uncertain reasoning Fundamenta Informaticae, Vol. 27, No. 2-3, pp. 289-298, 1996. Comparison of Rough-set and Interval-set Models

More information

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics CSC 224/226 Notes Packet #2: Set Theory & Predicate Calculus Barnes Packet #2: Set Theory & Predicate Calculus Applied Discrete Mathematics Table of Contents Full Adder Information Page 1 Predicate Calculus

More information

Reformulation of chance constrained problems using penalty functions

Reformulation of chance constrained problems using penalty functions Reformulation of chance constrained problems using penalty functions Martin Branda Charles University in Prague Faculty of Mathematics and Physics EURO XXIV July 11-14, 2010, Lisbon Martin Branda (MFF

More information

Kybernetika. Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications. Terms of use:

Kybernetika. Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications. Terms of use: Kybernetika Margarita Mas; Miquel Monserrat; Joan Torrens QL-implications versus D-implications Kybernetika, Vol. 42 (2006), No. 3, 35--366 Persistent URL: http://dml.cz/dmlcz/3579 Terms of use: Institute

More information

On varieties generated by Weak Nilpotent Minimum t-norms

On varieties generated by Weak Nilpotent Minimum t-norms On varieties generated by Weak Nilpotent Minimum t-norms Carles Noguera IIIA-CSIC cnoguera@iiia.csic.es Francesc Esteva IIIA-CSIC esteva@iiia.csic.es Joan Gispert Universitat de Barcelona jgispertb@ub.edu

More information

Deduction by Daniel Bonevac. Chapter 3 Truth Trees

Deduction by Daniel Bonevac. Chapter 3 Truth Trees Deduction by Daniel Bonevac Chapter 3 Truth Trees Truth trees Truth trees provide an alternate decision procedure for assessing validity, logical equivalence, satisfiability and other logical properties

More information

Logic and Proofs. (A brief summary)

Logic and Proofs. (A brief summary) Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations

More information

An Introduction to Modal Logic III

An Introduction to Modal Logic III An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami

More information

Comparison of Fuzzy Operators for IF-Inference Systems of Takagi-Sugeno Type in Ozone Prediction

Comparison of Fuzzy Operators for IF-Inference Systems of Takagi-Sugeno Type in Ozone Prediction Comparison of Fuzzy Operators for IF-Inference Systems of Takagi-Sugeno Type in Ozone Prediction Vladimír Olej and Petr Hájek Institute of System Engineering and Informatics, Faculty of Economics and Administration,

More information

On Generalization of Fuzzy Connectives

On Generalization of Fuzzy Connectives n Generalization of Fuzzy Connectives Imre J. Rudas udapest Tech Doberdó út 6, H-1034 udapest, Hungary rudas@bmf.hu bstract: In real applications of fuzzy logic the properties of aggregation operators

More information

5. And. 5.1 The conjunction

5. And. 5.1 The conjunction 5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language

More information

The R 0 -type fuzzy logic metric space and an algorithm for solving fuzzy modus ponens

The R 0 -type fuzzy logic metric space and an algorithm for solving fuzzy modus ponens Computers and Mathematics with Applications 55 (2008) 1974 1987 www.elsevier.com/locate/camwa The R 0 -type fuzzy logic metric space and an algorithm for solving fuzzy modus ponens Guo-Jun Wang a,b,, Xiao-Jing

More information

GMDH-type Neural Networks with a Feedback Loop and their Application to the Identification of Large-spatial Air Pollution Patterns.

GMDH-type Neural Networks with a Feedback Loop and their Application to the Identification of Large-spatial Air Pollution Patterns. GMDH-type Neural Networks with a Feedback Loop and their Application to the Identification of Large-spatial Air Pollution Patterns. Tadashi Kondo 1 and Abhijit S.Pandya 2 1 School of Medical Sci.,The Univ.of

More information

Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic

Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic Journal of Uncertain Systems Vol.3, No.4, pp.243-251, 2009 Online at: www.jus.org.uk Uncertain Entailment and Modus Ponens in the Framework of Uncertain Logic Baoding Liu Uncertainty Theory Laboratory

More information

Advanced Topics in LP and FP

Advanced Topics in LP and FP Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection

More information

HOLOGRAPHIC IMPLEMENTATION OF A LINEAR PREDICTOR OF RANDOM PROCESSES: INFLUENCE OF HIGH-PASS AND LOW-PASS FILTERING ON THE PROCESS CHARACTERISTICS

HOLOGRAPHIC IMPLEMENTATION OF A LINEAR PREDICTOR OF RANDOM PROCESSES: INFLUENCE OF HIGH-PASS AND LOW-PASS FILTERING ON THE PROCESS CHARACTERISTICS HOLOGRAPHIC IMPLEMENTATION OF A LINEAR PREDICTOR OF RANDOM PROCESSES: INFLUENCE OF HIGH-PASS AND LOW-PASS FILTERING ON THE PROCESS CHARACTERISTICS Z.S. Bekyasheva, A.V. Pavlov, A.A. Vostrikov St. Petersburg

More information

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference

cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference cse 311: foundations of computing Fall 2015 Lecture 6: Predicate Logic, Logical Inference quantifiers x P(x) P(x) is true for every x in the domain read as for all x, P of x x P x There is an x in the

More information

Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS

Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS REPORTS ON MATHEMATICAL LOGIC 39 (2005), 127 131 Kamila BENDOVÁ INTERPOLATION AND THREE-VALUED LOGICS 1. Three-valued logics We consider propositional logic. Three-valued logics are old: the first one

More information