The Butterfly Algorithm: A Contradiction Solving Algorithm based on Propositional Logic for TRIZ
|
|
- Clifton Cannon
- 5 years ago
- Views:
Transcription
1 , pp he Butterfly Algorithm: A Contradiction Solving Algorithm based on Propositional Logic for RIZ Jung Suk Hyun 1 and Chan Jung Park 2 1 Department of Management Information Systems, Jeju National University, Jejudaehak-ro 102, Jeju-do, 63243,Republic of Korea 2 Department of Computer Education, Jeju National University, Jejudaehak-ro 102, Jeju-do, 63243,Republic of Korea {jsyun,cjpark}@jejunu.ac.kr Abstract Among creative and innovative problem solving algorithms, RIZ solves difficult problems by finding contradictions of the problems. In RIZ, there are two types of contradictions. One is a technical contradiction and the other is physial contradiction. A technical contradiction occurs between two desirable functions of a system. We call it a trade-off contradiction. On the other hand, a physical contradiction appears when two opposite properties are required from the same part of a system. In RIZ, the ARIZ has been developed by Altshuller for reducing trial-and-error while solving problems. It is known as an inventive problem solving. It transforms difficult technical contradictions of a given problem into the corresponding physical contradiction to solve the problem easily. However, ARIZ-85c, the most recent version of the ARIZ, has inefficient and timeconsuming features that cause trial-and-errors. In this paper, we propose the Butterfly algorithm based on the Butterfly diagram to reduce trial-and-error features by giving the right solution strategy based on propositional logic when selecting technical contradictions and physical contradictions for a given problem. he Butterfly algorithm can systematically find the solution strategy for the problem, and thus it helps to solve contradictions efficiently. Keywords: ARIZ, the Butterfly Diagram, the Butterfly Algorithm, Contradiction Problem Solving, RIZ, Creative Problem Solving 1. Introduction Historically, many creative and innovative solutions solved the contradictions of given problems. Among the creative problem solving methods, RIZ, the Russian acronym for the heory of Inventive Problem Solving, is the one of the best methods handle contradictions. RIZ was developed by Altshuller and his colleagues [1]. hey figured out that there was a common thing among innovative inventions. he common thing was that researchers have solved the contradictions included in given problems instead of compromising the conflicts [1-2]. RIZ can reduce the number of trial-and-errors by abstraction and analogical reasoning when engineers solve problems [1-2]. RIZ provides many useful tools to solve contradictions in a given problem. RIZ defines two types of contradictions when it solves problems. One is technical contradiction and the other is physical contradiction [3]. he technical contradictions are trade-offs. In other words, if one thing gets better, then the other thing gets worse [3]. or example, the speed of a bike forms a technical contradiction with the safety of a bike. On the other hand, the physical contradictions occur when two opposite requirements meet. or example, the width of a highway should be wide for easy traffic control and it should be narrow for low impact on communities [3]. ISSN: IJSEIA Copyright c 2016 SERSC
2 Among the RIZ tools, the ARIZ, algorithm for inventive problem solving, is the core analytical tool of RIZ [4]. It was also developed by Altshuller for reducing trial-anderrors while solving problems. he essence of the ARIZ is to transform an ill-structured problem into a well-structured problem to solve easily. It is composed of 85 step-by-step procedures to solve contradictions. he ARIZ transforms the technical contradiction of a given problem into the physical contradiction of the same problem. he ARIZ has continuously been evolved, and ARIZ-85c was published with 9 steps in 1985 as follows [5]. Step1: Analysis of a given problem Step2: Analysis of the problem s model. Step3: ormulation of the Ideal inal Result (IR). Step 4: Utilization of outside substances and field resources. Step5: Utilization of information data bank. Step 6: Change or reformulate the problem. Step7: Analysis of the method that removed the physical contradiction. Step 8: Utilization of found solution. Step 9: Analysis of steps that lead to the solution. In the early stages of the ARIZ Part 1, selecting the right contradiction is important for solving the problem. However, ARIZ-85c, the most recent version of the ARIZ, still has the brute-force feature inside. As shown in igure 1, the step 6 of ARIZ-85c says If the problem has not been solved yet, go to the step 1.4, and then choose the other technical contradiction for this problem. It represents that the ARIZ has the feature similar to the brainstorming. he step 1.4 is to select the technical contradiction that is suitable for the main function of a given system. However, the problem is that the main function of the system can be defined differently according to solvers. In addition, the ARIZ is a method whose efficacy depends on the problem solver s technical knowledge [5]. In this paper, we propose the Butterfly algorithm based on the Butterfly diagram to reduce the trial-and-errors generated by choosing a wrong solution strategy. We propose the logical way how to choose the right direction when selecting technical contradictions and physical contradictions with propositional logic. he Butterfly algorithm can systematically find the solution strategy for the problem, and thus it can reduce the trialand-errors and help to solve contradictions efficiently. he rest of this paper is consisted as follows: in Section 2, we present the Butterfly diagram that is the basis of our Butterfly algorithm. Next, in Section 3, we compare the Butterfly algorithm and the ARIZ-85c. And then, we explain the difference with the iron plate tank problem. inally, we conclude our paper in Section Copyright c 2016 SERSC
3 2. he Butterfly Diagram igure 1. he Step 6 of ARIZ-85c [6] A system has the interconnectivity of a system among the components of the system. It means that when some part of a system gets better, other part of the system gets worse, and vice versa [7-8]. he Butterfly diagram is the component of the Butterfly model [8-9]. Compared with RIZ, the Butterfly model can define the essence of a given problem by describing the relationships of its technical contradiction and physical contradiction. Physical contradictions belong to more concrete and narrow problem space than technical contradictions [8]. And then, the Butterfly model can find out the ideal solutions for the given problem easily by combining its technical and physical contradictions. After finding out its ideal solutions, according to the type of the problems, the time, the space, and the partial and the whole state model are applied to derive the problem solutions more precisely [8]. On the other hand, the Butterfly diagram assumes the interconnectivity of a system. Due to the interconnectivity, when some function of a system is enhanced (w, wanted function), other function is deteriorated (u, unwanted function) as shown in igure 2. In this situation, a trade-off relation occurs. he main cause, the system faces with a tradeoff relation, comes from the system state, s, and the contradictory system state, ~s. or solving the contradiction problems, a few terminologies are defined in the Butterfly diagram. [Definition 1] A system S is composed of 3 components, w, u, and s, where w is a wanted function of S, u is the unwanted function caused by satisfying a state s, which is a condition for supporting w [9].hen, ~s is a condition for supporting ~u. [Definition 2] w and ~u have a trade-off relation with each other when w becomes better, whereas ~u becomes less, and vice versa. Copyright c 2016 SERSC 29
4 igure 2. he Interconnectivity of a System [9] [Definition 3] s and ~s have a contradiction relation when s and ~s cannot be true at the same time. We explain a trade-off relation and a contradiction relation with the agility and the safety of the iron plate of a tank. If the iron plate is thick (s), then the iron plate protects shells well (w). However, the agility of the tank falls down (u) due to the thick plate. In order to elevate the agility of the tank (~u), the iron plate should be thin (~s). he thin iron plate also causes the problem that the tank cannot protect shells well (~w). In this case, w and ~u have a trade-off relation, whereas s and ~s have a contradiction relation. his problem is depicted with the Butterfly diagram shown in igure 3. igure 3. he Butterfly Diagram for the ank Problem o give more accurate direction for solving problems, the Butterfly model analyzed the problem types and the solution strategies based on Logics in [9]. In a Butterfly diagram, the relationships between w and s mean the conditional propositions between the wanted function, w, in a system and the system state, s, for performing w. Similarly, the relationships between u and s mean the conditional propositions between the unwanted function, u, in a system and the system state, s, for performing u. hen, there are 9 types of conditional proposition relationships, i.e., 3 (a sufficient, a necessary, and a necessary and sufficient condition between w and s) 3 (a sufficient, a necessary, and a necessary and sufficient condition between s and u). rom now on, we analyze each problem type and propose the problem solving objectives and the solution strategies for each problem type [9]. In the above problem, we describe the relations with the propositional logic. If the iron plate is thick (s), then the tank protects shells well (w). hus, we represent this relation as s w like in the propositional logic. Also, if the iron plate is thick (s), then the agility of the tank falls down (u). hus, we represent this relation as s u. By the contraposition 30 Copyright c 2016 SERSC
5 law, if s u then ~u ~s. Also, if s w then ~w ~s. hus, the iron plate problem of a tank can be described with the relations among w, u, and s. such as (s w) (s u). In addition, the solution objectives about the tank problem are to protect shells (safety) and to move quickly (agility) at the same time (w ~u). It means that the iron plate should be thin and the tank should protect well (~s w). he relations represented in the Butterfly diagram are transformed into a propositional logic expression as follows [9]: (s w) (s u) and (w ~u) (~s w). he above logical expression is proved with the truth table as shown in able 1. able 1 shows if we can describe the relations between technical contradictions and physical contradictions by the propositional logic, then we know the solution for solving the contradictions. able 1 means when the given problem conditions are given as (s w) (s u) and (w ~u), then the right direction for the solution strategy is (~s w). ~s w is the only one that satisfies true conditions in the logical expression. Since the solution direction is given, we can avoid trial-and-errors unlike the ARIZ-85c. able 1. Proof Based on a ruth able for Solution Strategy about the Iron Plate Problem of the ank s u w s w s u w ~u ~s w Based on the solution strategy by depicting the Butterfly diagram, one solution for the tank problem was giving 60 degree of slope in the iron plate of the tank as shown in igure 4. hen, the plate has the increasing effect in thickness due to the slope. he thickness of the plate becomes 90mm by slope when the original thickness is 45mm. hus, without the thicker plate, the tank protects shell better than before. igure 4. he Iron Plate of the ank Another example can be found in a bike problem. he larger front wheels gave higher speed. At the same time, the large front wheels threaten bike riders safety. By having the saddle set too high, the bike riders have difficulties when getting on and getting off. If bike has a big front wheel (s), then bike riders can not only run high speed (w) but also be dangerous to drive (u). Bike riders wanted a fast but safe bike (w ~u). In order to achieve the objectives of the bike, it should have a small front wheel (~s). Starley invented the Copyright c 2016 SERSC 31
6 first rear-driving bicycle, known as the Rover safety bike, in He solved the contradiction by using the pedal and the chain connecting the rear wheel. It guaranteed the high speed of the bike with safety [10]. 3. he Butterfly Algorithm In this Section, we present the Butterfly algorithm based on the propositional logic and the logical interpretations of problem types and their solution strategies. he Butterfly algorithm redefines the Step 1.4 of ARIZ-85c more accurately. It reduces the dependency on the problem solver s expertise. Other parts are the same as the ARIZ-85c. In the next Butterfly algorithm, we firstly describe the difference in step1 from the ARIZ-85c as follows: Step 1.1 Without specialized terminology, write down the conditions of the mini-problem. Step 1.2 Select the conflicting pair. Step 1.3 ormulate system contradictions (technical and physical) using the conflicting pair from Step 1.2 and create a Butterfly diagram for the system contradiction. Step 1.4 Select the right solution strategy from the two system contradictions relationship (the three relations between w and s, the three relations between s and u) classified by propositional logic. here are nine cases according to sufficient conditions, necessary conditions, and necessary and sufficient conditions of functions and states of the system. he rest of steps are the same as [6] and described as follows: Step 2 Existing resource analysis Step 3 Determination of ideal final result and physical contradiction Step 4 Utilization and application of modified time, space, substance and field resources Step 5 Application of information fund Step 6 We can skip the step 6 for changing problems Step 7 Analyzing the quality of the problem solution Step 8 Application of the problem solution to maximize use of the applied resources Step 9 Analysis of solution procedure to increase the creative potential of humanity inally, we compared our algorithm with the ARIZ-85C by representing the previous example, the iron plate of the tank problem. Step 1.1 o define the mini-problem. [he iron plate of a tank], [protecting shells], is composed of [shells and the iron plate]. 32 Copyright c 2016 SERSC
7 echnical contradiction 1: if [the iron plate is thick], then [the tank can protect shells well]. However, [the weight of the tank increases]. hus, [the agility of the tank decreases]. echnical contradiction 2: if [the iron plate is thin], then [the tank can move quickly]. However, [the tank cannot protect shells well]. At least, we minimally modify [the tank], and then we get the result such that [the agile tank that has a thin iron plate protects shells well]. Step 1.2 o define the contradictory factors. Objects: shells ools: the iron plate Step 1.3 o define the physical contradiction. At this state two algorithms are the same. However, in the Step 1.4, ARIZ describes the Step 1.4 as follows: Step 1.4 o determine the main function of the system. hus, according to problem solvers, different technical contradiction can be selected. hus, in the later step, trial-and-error can occur. However, in our algorithm, since sufficient condition and necessary condition can be determined, we can decide the solution so that (~s w), where s is the thick iron plate and w is to protect shells well. As a result, in our algorithm, step 1.4 can be described as follows: Step 1.4 o determine the technical contradiction as [thin iron plate and protecting shells well]. In summary, in the above problem, ARIZ-85C proposed that a problem solver should select one technical contradiction with respect to the main function of the system. However, it is difficult to determine which function is more important between two functions ((i) to protect shell and (ii) to have agility). wo functions are required in the iron plate tank. he Butterfly diagram performs a visual role in analyzing physical contradictions and technical contradictions easily. By applying the propositional logic, the Butterfly algorithm derives the right direction efficiently and logically. 4. Conclusions Simon supposed that when we solve a complex problem, we should define the type of problems and develop the appropriate representation method for the problem. Symbolic notations and systematic representations increase the problem solving abilities of problem solvers. he symbolic logic overcomes the ambiguity of a language, and then figures out the correct logical structure of a given problem. However, in symbolic logic, contradiction problems were not considered due to their problems complexity [11-12]. Polya indicated that if the type of a problem is classified, then the problem could be solved easier [12]. It means that when we know the structure of a contradiction problem and its solution type in advance, we can reduce the problem space so that we can solve the problem easily. If we figure out the solution strategy according to the problem types with logical proofs, the problem solving ability can be enhanced due to the efficient search of the problem space [13]. he Butterfly diagram helps to find out a solution by defining a solution strategy based on the analysis of the trade-off relation and the contradiction relation hidden in a given problem. he Butterfly algorithm replaces the brute-force feature of ARIZ with the Copyright c 2016 SERSC 33
8 components of the Butterfly diagram, which are represented based on the propositional logic. In other words, if the relationship between the technical contradiction and the physical contradiction in RIZ are analyzed with the propositional logic, then the solution strategy that resolves the problem can be decided in a right way without trial-and-errors. When the required functions and the states for the functions are examined from the sufficient condition point of view, problem solvers can eliminate the ambiguity of the given problems and can derive the right solution strategy. References [1] G. S. Altshuller, Creativity as an Exact Science: he heory of the Solution of Inventive Problems, CRC Press, (1984). [2] S. D. Savransky, Engineering of Creativity: Introduction to RIZ Methodology of Inventive Problem Solving, CRC Press, (2002). [3] E. Domb, Contradictions: Air Bag Applications, he RIZ Journal, (1997). [4] R. Langevin, ARIZ, echnical Innovation Center, Inc., [5] N. Becattini, Y. Borgianni, G. Cascini and. Rotini, ARIZ85 and Patent-driven Knowledge Support. [6] ARIZ-85C Algorithm for Inventive Problem Solving Structure, +ARIZ85C_structure_example_WEB_02_22_2012.Pdf. [7] J. S. Hyun and C. J. Park, A conflict-based model for problem-oriented software engineering and its application solved by dimension change and use of intermediary, in CCIS, vol. 59, (2009), pp [8] J. S. Hyun and C. J. Park, he butterfly model for supporting creative problem solving, Knowledge, Information, and Creativity Support Systems (KICSS), 2012 Seventh International Conference on IEEE, (2012), pp [9] J. S. Hyun and C. J. Park, Logical interpretation about problem types and solution strategies of the butterfly model for the automation of contradiction-based problem solving, eaching, Assessment and Learning (ALE), International Conference on. IEEE, (2014), pp [10]. Hadland and H.-E. Lessing, Bicycle design: An illustrated history, MI Press, (2014). [11] H.A. Simon, he Sciences of the Artificial, he MI Press, (1987). [12] H.A. Simon, he architecture of complexity, Proceedings of the American Philosophical Society, vol. 106, no. 6, (1962), pp [13] G. Polya, Mathematics and Plausible Reasoning: Induction and Analogy in Mathematics, vol. 1. Princeton University Press, (1990). Authors Jung Suk Hyun, received Ph.D. at Sogang University, Korea. Since 2002, he has worked for the Dept. of MIS at Jeju National University. In 2011, he was a visiting scholar at University of California, Berkeley. His research interests include behavioral decision theory and creative problem solving. He received awards of the Korean Intellectual Property Office (2012), the Best eacher Award (2011), the Award of Enhancing University Prestige of Jeju National University (2008), Best Professor Award of Achievement in Research of Jeju National University (2007). Chan Jung Park, received B.S. at Dept. of Computer Science of Sogang University, Korea. She received M.S. and Ph.D. at KAIS and Sogang University, respectively. rom 1990 to 1994, and also from 1998 to 1999, she worked for Korea elecom as a researcher. Since 1999, she has worked for the Dept. of Computer Education at Jeju National University. Currently, she is a professor in Jeju National University. In 2010, he was a visiting scholar at University of California, Berkeley. Her research interests include creative problem solving, web app development, and data mining. 34 Copyright c 2016 SERSC
The Application of LT-Table in TRIZ Contradiction Resolving Process
The Application of LT-Table in TRIZ Contradiction Resolving Process Zihui Wei, Qinghai Li, Donglin Wang, and Yumei Tian Institute of Design for Innovation, Hebei University of Technology, TianJin, 300130,
More informationA Study on Performance Analysis of V2V Communication Based AEB System Considering Road Friction at Slopes
, pp. 71-80 http://dx.doi.org/10.14257/ijfgcn.2016.9.11.07 A Study on Performance Analysis of V2V Communication Based AEB System Considering Road Friction at Slopes Sangduck Jeon 1, Jungeun Lee 1 and Byeongwoo
More informationElementary Loops Revisited
Elementary Loops Revisited Jianmin Ji a, Hai Wan b, Peng Xiao b, Ziwei Huo b, and Zhanhao Xiao c a School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationPythagorean Triples and SAT Solving
Pythagorean Triples and SAT Solving Moti Ben-Ari Department of Science Teaching Weizmann Institute of Science http://www.weizmann.ac.il/sci-tea/benari/ c 2017-18 by Moti Ben-Ari. This work is licensed
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
More informationClause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Journal of Artificial Intelligence Research 1 (1993) 1-15 Submitted 6/91; published 9/91 Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas Enrico Giunchiglia Massimo
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More information7 LOGICAL AGENTS. OHJ-2556 Artificial Intelligence, Spring OHJ-2556 Artificial Intelligence, Spring
109 7 LOGICAL AGENS We now turn to knowledge-based agents that have a knowledge base KB at their disposal With the help of the KB the agent aims at maintaining knowledge of its partially-observable environment
More informationLogic: Intro & Propositional Definite Clause Logic
Logic: Intro & Propositional Definite Clause Logic Alan Mackworth UBC CS 322 Logic 1 February 27, 2013 P & M extbook 5.1 Lecture Overview Recap: CSP planning Intro to Logic Propositional Definite Clause
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationPolynomials. This booklet belongs to: Period
HW Mark: 10 9 8 7 6 RE-Submit Polynomials This booklet belongs to: Period LESSON # DATE QUESTIONS FROM NOTES Questions that I find difficult Pg. Pg. Pg. Pg. Pg. Pg. Pg. Pg. Pg. Pg. REVIEW TEST Your teacher
More informationReading, UK 1 2 Abstract
, pp.45-54 http://dx.doi.org/10.14257/ijseia.2013.7.5.05 A Case Study on the Application of Computational Intelligence to Identifying Relationships between Land use Characteristics and Damages caused by
More informationNumerical Interpolation of Aircraft Aerodynamic Data through Regression Approach on MLP Network
, pp.12-17 http://dx.doi.org/10.14257/astl.2018.151.03 Numerical Interpolation of Aircraft Aerodynamic Data through Regression Approach on MLP Network Myeong-Jae Jo 1, In-Kyum Kim 1, Won-Hyuck Choi 2 and
More informationA Brief Introduction to Proofs
A Brief Introduction to Proofs William J. Turner October, 010 1 Introduction Proofs are perhaps the very heart of mathematics. Unlike the other sciences, mathematics adds a final step to the familiar scientific
More informationLecture 13: Soundness, Completeness and Compactness
Discrete Mathematics (II) Spring 2017 Lecture 13: Soundness, Completeness and Compactness Lecturer: Yi Li 1 Overview In this lecture, we will prvoe the soundness and completeness of tableau proof system,
More informationParts 3-6 are EXAMPLES for cse634
1 Parts 3-6 are EXAMPLES for cse634 FINAL TEST CSE 352 ARTIFICIAL INTELLIGENCE Fall 2008 There are 6 pages in this exam. Please make sure you have all of them INTRODUCTION Philosophical AI Questions Q1.
More informationPropositional Logic Logical Implication (4A) Young W. Lim 4/21/17
Propositional Logic Logical Implication (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationThe 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 informationDiscrete Mathematical Structures. Chapter 1 The Foundation: Logic
Discrete Mathematical Structures Chapter 1 he oundation: Logic 1 Lecture Overview 1.1 Propositional Logic 1.2 Propositional Equivalences 1.3 Quantifiers l l l l l Statement Logical Connectives Conjunction
More informationEquivalence and Implication
Equivalence and Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing February 7 8, 2018 Alice E. Fischer Laws of Logic... 1/33 1 Logical Equivalence Contradictions and Tautologies 2 3 4 Necessary
More informationPL: Truth Trees. Handout Truth Trees: The Setup
Handout 4 PL: Truth Trees Truth tables provide a mechanical method for determining whether a proposition, set of propositions, or argument has a particular logical property. For example, we can show that
More informationPATENT PENDING. Easy Gripper product range. #94060 Easy Gripper #94095 Easy Gripper Compact Accessories. Improve SAFETY and efficiency
PATENT PENDING By Easy Gripper product range #94060 Easy Gripper #94095 Easy Gripper Compact Accessories Improve SAFETY and efficiency STANDARD OPTIONAL Your Easy Gripper Contact us to find out which Easy
More informationChanges in properties and states of matter provide evidence of the atomic theory of matter
Science 8: Matter and Energy (1) Changes in properties and states of matter provide evidence of the atomic theory of matter Properties of objects and states of matter can change chemically and/or physically
More informationBy Daniel C. Edelson, PhD
Your web browser (Safari 7) is out of date. For more security, comfort and the best experience on this site: Update your browser Ignore GEO - L ITERACY Preparation for Far-Reaching Decisions For the complete
More informationAI Programming CS S-09 Knowledge Representation
AI Programming CS662-2013S-09 Knowledge Representation David Galles Department of Computer Science University of San Francisco 09-0: Overview So far, we ve talked about search, which is a means of considering
More informationSolving and Graphing a Linear Inequality of a Single Variable
Chapter 3 Graphing Fundamentals Section 3.1 Solving and Graphing a Linear Inequality of a Single Variable TERMINOLOGY 3.1 Previously Used: Isolate a Variable Simplifying Expressions Prerequisite Terms:
More informationSciences Learning Outcomes
University Major/Dept Learning Outcome Source Biology, Molecular and Cell Students who successfully complete this major will be able to: * Describe basic biological concepts and principles * Appreciate
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 007 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationGRADE 6 Projections Masters
TEKSING TOWARD STAAR MATHEMATICS GRADE 6 Projections Masters Six Weeks 1 Lesson 1 STAAR Category 1 Grade 6 Mathematics TEKS 6.2A/6.2B Understanding Rational Numbers A group of items or numbers is called
More informationTheorem. For every positive integer n, the sum of the positive integers from 1 to n is n(n+1)
Week 1: Logic Lecture 1, 8/1 (Sections 1.1 and 1.3) Examples of theorems and proofs Theorem (Pythagoras). Let ABC be a right triangle, with legs of lengths a and b, and hypotenuse of length c. Then a +
More informationNotes for Recitation 1
6.042/18.062J Mathematics for Computer Science September 10, 2010 Tom Leighton and Marten van Dijk Notes for Recitation 1 1 Logic How can one discuss mathematics with logical precision, when the English
More informationA Study on Estimation Technique of Extreme Precipitation Diameter
Vol.125 (Art, Culture, Game, Graphics, Broadcasting and Digital Contents 2016), pp.72-77 http://dx.doi.org/10.14257/astl.2016. A Study on Estimation Technique of Extreme Precipitation Diameter Jin Woo
More informationPropositional Logic Logical Implication (4A) Young W. Lim 4/11/17
Propositional Logic Logical Implication (4A) Young W. Lim Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationComputer Sciences Department
Computer Sciences Department 1 Reference Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Computer Sciences Department 3 ADVANCED TOPICS IN C O M P U T A B I L I T Y
More informationPart II A Reexamination of Contemporary Utilitarianism
Part II A Reexamination of Contemporary Utilitarianism In Part II of this book, we will turn to contemporary moral philosophers by this I mean twentieth-century philosophers who have reconstructed modern
More informationOnly one of the statements in part(a) is true. Which one is it?
M02/1/13 1. Consider the statement If a figure is a square, then it is a rhombus. or this statement, write in words (i) (ii) (iii) its converse; its inverse; its contrapositive. Only one of the statements
More informationSome methods for composing mathematical problems Radu Bairac
Some methods for composing mathematical problems Radu Bairac ABSTRACT. The article sustains the idea that the mathematical educations should be performed as a continuous research and discovery, not just
More informationA PRIMER ON ROUGH SETS:
A PRIMER ON ROUGH SETS: A NEW APPROACH TO DRAWING CONCLUSIONS FROM DATA Zdzisław Pawlak ABSTRACT Rough set theory is a new mathematical approach to vague and uncertain data analysis. This Article explains
More informationWHITE PAPER. Winter Tires
WHITE PAPER Winter Tires WHITE PAPER Introduction According to the Federal Highway Administration accidents caused by winter weather result in 150,000 injuries and 2,000 deaths each year on average. In
More informationLogic - recap. So far, we have seen that: Logic is a language which can be used to describe:
Logic - recap So far, we have seen that: Logic is a language which can be used to describe: Statements about the real world The simplest pieces of data in an automatic processing system such as a computer
More informationIntegrated reliable and robust design
Scholars' Mine Masters Theses Student Research & Creative Works Spring 011 Integrated reliable and robust design Gowrishankar Ravichandran Follow this and additional works at: http://scholarsmine.mst.edu/masters_theses
More informationTECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final examination Logic & Set Theory (2IT61/2IT07/2IHT10) (correction model)
TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Final examination Logic & Set Theory (2IT61/2IT07/2IHT10) (correction model) Thursday October 29, 2015, 9:00 12:00 hrs. (2) 1. Determine
More informationTrade Space Exploration with Ptolemy II
Trade Space Exploration with Ptolemy II Shanna-Shaye Forbes Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2009-102 http://www.eecs.berkeley.edu/pubs/techrpts/2009/eecs-2009-102.html
More informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationArtificial Intelligence Knowledge Representation I
Artificial Intelligence Knowledge Representation I Agents that reason logically knowledge-based approach implement agents that know about their world and reason about possible courses of action needs to
More informationMeasure of Design Thinking-based Regional Innovation: Focusing on Gamcheon Culture Village
, pp.125-129 http://dx.doi.org/10.14257/astl.2017.143.26 Measure of Design Thinking-based Regional Innovation: Focusing on Gamcheon Culture Village Na-Rang Kim 1, Soon-Goo Hong 1*, Sang-Jin Lee 2 1 Dong-A
More information2 Truth Tables, Equivalences and the Contrapositive
2 Truth Tables, Equivalences and the Contrapositive 12 2 Truth Tables, Equivalences and the Contrapositive 2.1 Truth Tables In a mathematical system, true and false statements are the statements of the
More informationOptimal Sojourn Time Control within an Interval 1
Optimal Sojourn Time Control within an Interval Jianghai Hu and Shankar Sastry Department of Electrical Engineering and Computer Sciences University of California at Berkeley Berkeley, CA 97-77 {jianghai,sastry}@eecs.berkeley.edu
More informationThe Effects of Activation Energy and Reference Temperature on the Qualified Life of Safety-related Equipment
, pp.1-5 http://dx.doi.org/10.14257/astl.2016.140.01 The Effects of Activation Energy and Reference Temperature on the Qualified Life of Safety-related Equipment Sungwan Park 1, Sunchul Jung 1 and Kyungheum
More information3 Acceleration. positive and one is negative. When a car changes direction, it is also accelerating. In the figure to the
What You ll Learn how acceleration, time, and velocity are related the different ways an object can accelerate how to calculate acceleration the similarities and differences between straight line motion,
More informationCSE507. Course Introduction. Computer-Aided Reasoning for Software. Emina Torlak
Computer-Aided Reasoning for Software CSE507 courses.cs.washington.edu/courses/cse507/14au/ Course Introduction Emina Torlak emina@cs.washington.edu Today What is this course about? Course logistics Review
More informationComplexity Results for Enhanced Qualitative Probabilistic Networks
Complexity Results for Enhanced Qualitative Probabilistic Networks Johan Kwisthout and Gerard Tel Department of Information and Computer Sciences University of Utrecht Utrecht, The Netherlands Abstract
More informationOverview, cont. Overview, cont. Logistics. Optional Reference #1. Optional Reference #2. Workload and Grading
Course staff CS389L: Automated Logical Reasoning Lecture 1: ntroduction and Review of Basics şıl Dillig nstructor: şil Dillig E-mail: isil@cs.utexas.edu Office hours: Thursday after class until 6:30 pm
More informationUnderstanding Land Use and Walk Behavior in Utah
Understanding Land Use and Walk Behavior in Utah 15 th TRB National Transportation Planning Applications Conference Callie New GIS Analyst + Planner STUDY AREA STUDY AREA 11 statistical areas (2010 census)
More informationLING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, Propositional logic
LING 106. Knowledge of Meaning Lecture 3-1 Yimei Xiang Feb 6, 2016 Propositional logic 1 Vocabulary of propositional logic Vocabulary (1) a. Propositional letters: p, q, r, s, t, p 1, q 1,..., p 2, q 2,...
More informationCharacterization of Semantics for Argument Systems
Characterization of Semantics for Argument Systems Philippe Besnard and Sylvie Doutre IRIT Université Paul Sabatier 118, route de Narbonne 31062 Toulouse Cedex 4 France besnard, doutre}@irit.fr Abstract
More informationGeo-Enabling Mountain Bike Trail Maintenance:
Title Slide Geo-Enabling Mountain Bike Trail Maintenance: Enhanced Stewardship of the Fountainhead Mountain Bike Trail through GIS Technology Ruthann Ligon Follow the Trail Fountainhead Mountain Bike
More informationBetaZi SCIENCE AN OVERVIEW OF PHYSIO-STATISTICS FOR PRODUCTION FORECASTING. EVOLVE, ALWAYS That s geologic. betazi.com. geologic.
BetaZi SCIENCE AN OVERVIEW OF PHYSIO-STATISTICS FOR PRODUCTION FORECASTING EVOLVE, ALWAYS That s geologic betazi.com geologic.com Introduction Predictive Analytics is the science of using past facts to
More informationCS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents
CS 331: Artificial Intelligence Propositional Logic I 1 Knowledge-based Agents Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationKnowledge-based Agents. CS 331: Artificial Intelligence Propositional Logic I. Knowledge-based Agents. Outline. Knowledge-based Agents
Knowledge-based Agents CS 331: Artificial Intelligence Propositional Logic I Can represent knowledge And reason with this knowledge How is this different from the knowledge used by problem-specific agents?
More informationOutline. Logical Agents. Logical Reasoning. Knowledge Representation. Logical reasoning Propositional Logic Wumpus World Inference
Outline Logical Agents ECE57 Applied Artificial Intelligence Spring 008 Lecture #6 Logical reasoning Propositional Logic Wumpus World Inference Russell & Norvig, chapter 7 ECE57 Applied Artificial Intelligence
More informationARTIFICIAL NEURAL NETWORK PART I HANIEH BORHANAZAD
ARTIFICIAL NEURAL NETWORK PART I HANIEH BORHANAZAD WHAT IS A NEURAL NETWORK? The simplest definition of a neural network, more properly referred to as an 'artificial' neural network (ANN), is provided
More informationSKETCHY NOTES FOR WEEKS 7 AND 8
SKETCHY NOTES FOR WEEKS 7 AND 8 We are now ready to start work on the proof of the Completeness Theorem for first order logic. Before we start a couple of remarks are in order (1) When we studied propositional
More informationCreative Objectivism, a powerful alternative to Constructivism
Creative Objectivism, a powerful alternative to Constructivism Copyright c 2002 Paul P. Budnik Jr. Mountain Math Software All rights reserved Abstract It is problematic to allow reasoning about infinite
More informationCOMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati"
COMP3702/7702 Artificial Intelligence Week 5: Search in Continuous Space with an Application in Motion Planning " Hanna Kurniawati" Last week" Main components of PRM" Collision check for a configuration"
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationA SECOND ORDER STOCHASTIC DOMINANCE PORTFOLIO EFFICIENCY MEASURE
K Y B E R N E I K A V O L U M E 4 4 ( 2 0 0 8 ), N U M B E R 2, P A G E S 2 4 3 2 5 8 A SECOND ORDER SOCHASIC DOMINANCE PORFOLIO EFFICIENCY MEASURE Miloš Kopa and Petr Chovanec In this paper, we introduce
More informationRanking Verification Counterexamples: An Invariant guided approach
Ranking Verification Counterexamples: An Invariant guided approach Ansuman Banerjee Indian Statistical Institute Joint work with Pallab Dasgupta, Srobona Mitra and Harish Kumar Complex Systems Everywhere
More informationProof Methods for Propositional Logic
Proof Methods for Propositional Logic Logical equivalence Two sentences are logically equivalent iff they are true in the same models: α ß iff α β and β α Russell and Norvig Chapter 7 CS440 Fall 2015 1
More informationAlan Bundy. Automated Reasoning LTL Model Checking
Automated Reasoning LTL Model Checking Alan Bundy Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures have
More informationComparison of Extended Fuzzy Logic Models of A-IFS and HLS: Detailed Analysis of Inclusion in the A-IFS of the Data Sets for Implication Operations
Comparison of Extended uzzy Logic Models of A-IS and HLS: Detailed Analysis of Inclusion in the A-IS of the Data Sets for Implication Operations Xiaoyu HUANG and etsuhisa ODA Aichi Institute of echnology
More informationHongyul Yoon TRIZ Master Thesis A Method for Cause Effect Chain Analysis Based on Multi Screen Thinking and State-Interaction Model August 2012
Hongyul Yoon TRIZ Master Thesis A Method for Cause Effect Chain Analysis Based on Multi Screen Thinking and State-Interaction Model August 2012 Scientific Supervisor: TRIZ Master Alexander Lyubormirskiy
More informationElementary Linear Algebra, Second Edition, by Spence, Insel, and Friedberg. ISBN Pearson Education, Inc., Upper Saddle River, NJ.
2008 Pearson Education, Inc., Upper Saddle River, NJ. All rights reserved. APPENDIX: Mathematical Proof There are many mathematical statements whose truth is not obvious. For example, the French mathematician
More information2681 Parleys Way Suite 201 Salt Lake City, UT AccuSense Value Proposition
2681 Parleys Way Suite 201 Salt Lake City, UT 84109 801-746-7888 www.seertechnology.com AccuSense Value Proposition May 2010 What is valuable to the chemical detection mission? Time is valuable Information
More informationChemistry: Introduction to Chemistry
Chemistry: Introduction to Chemistry Name: Hr: Pure Science vs. Applied Science pure science ( science ) = In science, we often try to establish a cause-effect relationship What drives pure scientists?
More informationCS 354R: Computer Game Technology
CS 354R: Computer Game Technology AI Fuzzy Logic and Neural Nets Fall 2017 Fuzzy Logic Philosophical approach Decisions based on degree of truth Is not a method for reasoning under uncertainty that s probability
More informationAbstractions and Decision Procedures for Effective Software Model Checking
Abstractions and Decision Procedures for Effective Software Model Checking Prof. Natasha Sharygina The University of Lugano, Carnegie Mellon University Microsoft Summer School, Moscow, July 2011 Lecture
More informationModal and temporal logic
Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
More informationLogical Agents (I) Instructor: Tsung-Che Chiang
Logical Agents (I) Instructor: Tsung-Che Chiang tcchiang@ieee.org Department of Computer Science and Information Engineering National Taiwan Normal University Artificial Intelligence, Spring, 2010 編譯有誤
More informationThe following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof
Ch. 1.6 Introduction to Proofs The following techniques for methods of proofs are discussed in our text - Vacuous proof - Trivial proof - Direct proof - Indirect proof (our book calls this by contraposition)
More informationNeural Networks & Fuzzy Logic
Journal of Computer Applications ISSN: 0974 1925, Volume-5, Issue EICA2012-4, February 10, 2012 Neural Networks & Fuzzy Logic Elakkiya Prabha T Pre-Final B.Tech-IT, M.Kumarasamy College of Engineering,
More information2. 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 informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationThe efficiency of identifying timed automata and the power of clocks
The efficiency of identifying timed automata and the power of clocks Sicco Verwer a,b,1,, Mathijs de Weerdt b, Cees Witteveen b a Eindhoven University of Technology, Department of Mathematics and Computer
More informationThe Impact of Craig s Interpolation Theorem. in Computer Science
The Impact of Craig s Interpolation Theorem in Computer Science Cesare Tinelli tinelli@cs.uiowa.edu The University of Iowa Berkeley, May 2007 p.1/28 The Role of Logic in Computer Science Mathematical logic
More informationAlgorithm for Multiple Model Adaptive Control Based on Input-Output Plant Model
BULGARIAN ACADEMY OF SCIENCES CYBERNEICS AND INFORMAION ECHNOLOGIES Volume No Sofia Algorithm for Multiple Model Adaptive Control Based on Input-Output Plant Model sonyo Slavov Department of Automatics
More informationProposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators
Proposition/Statement Boolean Logic CS 231 Dianna Xu A proposition is either true or false but not both he sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 1 2 Boolean variables
More informationPS10 Sets & Logic. Sam Maddy Austin Jacob For each of these statements, list the students for which the statement is true:
PS10 Sets & Logic Lets check it out: We will be covering A) Propositions, negations, B) Conjunctions, disjunctions, and C) intro to truth tables, D) 3 propositions. hink about this. On Saint Patrick s
More informationEXPERT SYSTEM FOR POWER TRANSFORMER DIAGNOSIS
EXPERT SYSTEM FOR POWER TRANSFORMER DIAGNOSIS Virginia Ivanov Maria Brojboiu Sergiu Ivanov University of Craiova Faculty of Electrical Engineering 107 Decebal Blv., 200440, Romania E-mail: vivanov@elth.ucv.ro
More informationCC283 Intelligent Problem Solving 28/10/2013
Machine Learning What is the research agenda? How to measure success? How to learn? Machine Learning Overview Unsupervised Learning Supervised Learning Training Testing Unseen data Data Observed x 1 x
More information7. Propositional Logic. Wolfram Burgard and Bernhard Nebel
Foundations of AI 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard and Bernhard Nebel Contents Agents that think rationally The wumpus world Propositional logic: syntax and semantics
More information1 The Foundations. 1.1 Logic. A proposition is a declarative sentence that is either true or false, but not both.
he oundations. Logic Propositions are building blocks of logic. A proposition is a declarative sentence that is either true or false, but not both. Example. Declarative sentences.. Ottawa is the capital
More informationNatural 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 information5. All forces change the motion of objects. 6. The net force on an object is equal to the mass of the object times the acceleration of the object.
Motion, Forces, and Newton s Laws Newton s Laws of Motion What do you think? Read the two statements below and decide whether you agree or disagree with them. Place an A in the Before column if you agree
More informationDevelopment of a System for Decision Support in the Field of Ecological-Economic Security
Development of a System for Decision Support in the Field of Ecological-Economic Security Tokarev Kirill Evgenievich Candidate of Economic Sciences, Associate Professor, Volgograd State Agricultural University
More information3 Probabilistic Turing Machines
CS 252 - Probabilistic Turing Machines (Algorithms) Additional Reading 3 and Homework problems 3 Probabilistic Turing Machines When we talked about computability, we found that nondeterminism was sometimes
More information! Citation: DeBlock, Matthew "Chemical Calligraphy" FL , Fiat Lingua,!! <http://fiatlingua.org>. Web. 01 October 2014.!
Fiat Lingua!! Title: Chemical Calligraphy! Author: Matthew M. DeBlock! MS Date: 08-26-2014! FL Date: 10-01-2014! FL Number: FL-000025-00! Citation: DeBlock, Matthew. 2014. "Chemical Calligraphy" FL-000025-00,
More information