Generalized Modus Ponens
|
|
|
- Georgia Patrick
- 7 years ago
- Views:
Transcription
1 Generalized Modus Ponens This rule allows us to derive an implication... True p 1 and... p i and... p n p 1... p i-1 and p i+1... p n implies p i implies q implies q allows: a 1 and... a i and... a n implies p i p 1 and... p i and... p n implies q (p i == a i ) p 1... p i-1 and p i+1... p n and a 1 and... a i and... a n implies q A benefit of this approach is that the reasoner now can have a single goal. To derive q from (p 1 and... p i and... p n implies q), use generalized modus ponens to drive p1 and p2 and... pn to True This is like recursion to a base case...
2 Generalized Modus Ponens Many AI techniques are based on a predicate logic, extended in particular ways, using generalized modus ponens as the inference rule. It is simple to program and reasonably powerful. The programming language Prolog is based on just this sort of logic.
3 The Catch... But it s not enough. Notice that I said reasonably powerful. Modus ponens is sound and complete. It derives only true sentences, and it can derive any true sentence that a knowledge base of this form entails. Notice that I said of this form. Modus ponens works only for knowledge bases that contain only implications of positive literals. Implications of positive literals are often called Horn clauses, after a logician who studied them deeply. But disjunction (or) and negation (not) break the rule. And many legal sentences cannot be expressed in Horn clauses.
4 The Catch... For example: Eugene is a Hoosier, or the Eugene is crazy. We can write this as a disjunction: ishoosier( Eugene ) or iscrazy( Eugene ) We could use negation to convert this to implications: ( not hoosier( Eugene ) ) implies iscrazy( Eugene ) ( not iscrazy( Eugene ) ) implies hoosier( Eugene ) Or we could use the semantics of implication to convert this to a clause: True implies ( ishoosier( Eugene ) or iscrazy( Eugene ) ) But we cannot eliminate all the ors and all the nots at the same time.
5 The Catch, Part 2 So, Horn clause form is incomplete. That is, we cannot represent all sentences in this form. But why is Horn clause form necessary? Here is an example of how modus ponens breaks down if we use negation or disjunction. Suppose that all classes at some university meet either Mon/Wed/Fri or Tue/Thu. The AI course meets at 2:30 PM in the afternoon, and Jane has volleyball practice Thursdays and Fridays at that time. Can Jane take AI?
6 The Catch, Part 2 Of course not! But modus ponens cannot figure that out! See: True implies ( TueThu( AI, 2:30 PM ) or MonWedFri( AI, 2:30 PM ) ) ( TueThu( AI, 2:30 PM ) and busy( Thursday, 2:30 PM ) ) implies conflict( AI ) ( MonWedFri( AI, 2:30 PM ) and busy( Friday, 2:30 PM ) ) implies conflict( AI ) True implies busy( Thursday, 2:30 PM ) True implies busy( Friday, 2:30 PM )
7 The Catch, Part 2 We can apply modus ponens to [2, 4] and [3, 5] to derive the following: True implies ( TueThu( AI, 2:30 PM ) or MonWedFri( AI, 2:30 PM ) ) TueThu( AI, 2:30 PM ) implies conflict( AI ) MonWedFri( AI, 2:30 PM ) implies conflict( AI ) But modus ponens cannot take us any farther, despite what s obvious about those last two sentences.
8 Fixing the Catch So, Horn clause form is incomplete. But, if we allow something non-horn into our knowledge base, then modus ponens is incomplete. What do we do now? We need an inference rule that handles disjunctions and negations. If we find one, then we will be able to handle any expression... Why? Because we can use the semantics of implication to convert our Horn clauses into disjunctions with negations. childof( x, y ) and likes( y, Basketball ) implies likes( x, Basketball ) not [ childof( x, y ) and likes( y, Basketball ) ] or likes( x, Basketball )
9 Toward Fixing the Catch And then: not [ childof( x, y ) and likes( y, Basketball ) ] or likes( x, Basketball ) BECOMES [ not childof( x, y ) ] or [ not likes( y, Basketball ) ] or likes( x, Basketball ) More generally, becomes: p1 and p 2... and p n implies q (not p1) or (not p 2 )... or (not p n ) or q
![[ not likes( y, Basketball ) ] or likes( x, Basketball ) More generally,](/docs-images/42/22983822/images/page_9.jpg "becomes: p1 and p 2... and p n implies q (not p1) or (not p 2 ).")
10 An Example: Converting Sentences into Clause Form 1. ishoosier( Eugene ) 2. x ishoosier(x) implies likes( x, Basketball ) 3. xy childof( x, y ) and likes( y, Basketball ) implies likes( x, Basketball ) 4. x likes( x, Basketball ) implies likes( x, March ) 5. daughter( Ellen, Eugene ) 6. xy daughter( x, y ) implies childof( x, y ) 1. ishoosier( Eugene ) 2. not ishoosier(x) or likes( x, Basketball ) 3. [ not childof( x, y ) ] or [ not likes( y, Basketball ) ] or likes( x, Basketball ) 4. [ not likes( x, Basketball ) ] or likes( x, March ) 5. daughter( Ellen, Eugene ) 6. [ not daughter( x, y ) ] or childof( x, y )
11 We re Almost There... Now we are able to write any sentence in the predicate logic, using only the connectives not and or. Any sentence that uses implies can be converted using the rule: (p implies q) == (not p) or q Any sentence that uses and can be rewritten as separate sentences! This form is called clause form, or disjunctive normal form. So, now we can write our sentences in a new, complete form. If only we had an inference rule that worked on disjunctions and negations, we would be able to infer any true sentence. The semantics of the or connective lead us to a new inference rule:
12 The Solution: Resolution! The semantics of or lead us to a new inference rule: p or disjunction 1 [ not p ] or disjunction 2 disjunction 1 or disjunction 2 We call this inference rule resolution because it resolves the case analysis that is required whenever one sentence asserts p and another asserts not p. Let us consider our new knowledge base: 1. ishoosier( Eugene ) 2.not ishoosier(x) or likes( x, Basketball ) 3. [ not childof( x, y ) ] or [ not likes( y, Basketball ) ] or likes( x, Basketball ) 4. [ not likes( x, Basketball ) ] or likes( x, March ) 5. daughter( Ellen, Eugene ) 6. [ not daughter( x, y ) ] or childof( x, y ) Can we infer that Ellen likes March?
13 Yes, But How? Using resolution as our inference rule, we conclude: Ellen likes March. by constructing a proof by contradiction... To derive the sentence: likes( Ellen, March ) We build a proof by contradiction in this way: 1. Assume that our goal sentence is false. not likes( Ellen, March ) 2. Try to show that the goal sentence being false causes a contradiction.... try to infer FALSE... If assuming that the goal sentence is false causes a contradiction, then it must not be false. Everything else in our knowledge base is true (or so we assume), and so the cause of the contradiction is our negation.
14 An Example Proof by Contradiction p or disjunction 1 [ not p ] or disjunction 2 disjunction 1 or disjunction 2 1. ishoosier( Eugene ) 2. [ not ishoosier(x) ] or likes( x, Basketball ) 3. [ not childof( x, y ) ] or [ not likes( y, Basketball ) ] or likes( x, Basketball ) 4. [ not likes( x, Basketball ) ] or likes( x, March ) 5. daughter( Ellen, Eugene ) 6. [ not daughter( x, y ) ] or childof( x, y ) 7. [ not likes( Ellen, March ) ] ASSUMPTION 8. [ not likes( Ellen, Basketball ) ] (4, 7) 9. [ not childof( Ellen, y ) ] or [ not likes( y, Basketball ) ] (3, 8) A. [ not daughter( Ellen, y ) ] or [ not likes( y, Basketball ) ] (6, 9) B. [ not likes( Eugene, Basketball ) ] (5, A) C. [ not ishoosier( Eugene ) ] (2, B) 13. FALSE (1, C) Since assuming that Ellen does not like March cause a contradiction, then it must follow from the knowledge base that Ellen does like March.
![[ not daughter( x, y ) ] or childof( x, y ) 7. [ not likes( Ellen, March ) ] ASSUMPTION 8. [ not likes( Ellen, Basketball ) ] (4, 7) 9.](/docs-images/42/22983822/images/page_14.jpg "[ not childof( Ellen, y ) ] or [ not likes( y, Basketball ) ] (3, 8) A. [ not daughter( Ellen, y ) ] or [ not likes( y, Basketball ) ] (6, 9) B. [ not likes( Eugene, Basketball ) ] (5, A) C.")
15 But Can Jane Take AI? Big deal! you might say. We could prove that with modus ponens. Can resolution do something modus ponens couldn t? Use resolution to show that our good friend Jane cannot take AI from this knowledge base: True implies ( TueThu( AI, 2:30 PM ) or MonWedFri( AI, 2:30 PM ) ) ( TueThu( AI, 2:30 PM ) and busy( Thursday, 2:30 PM ) ) implies conflict( AI ) ( MonWedFri( AI, 2:30 PM ) and busy( Friday, 2:30 PM ) ) implies conflict( AI ) True implies busy( Thursday, 2:30 PM ) True implies busy( Friday, 2:30 PM ) First, convert these sentences to clause form. Then, assume Jane can take AI...
16 Poor Jane 1. TueThu( AI, 2:30 PM ) or MonWedFri( AI, 2:30 PM ) 2. [ not TueThu( AI, 2:30 PM ) ] or [ not busy( Thursday, 2:30 PM ) ] or conflict( AI ) 3. [ not MonWedFri( AI, 2:30 PM ) ] or [ not busy( Friday, 2:30 PM ) ] or conflict( AI ) 4. busy( Thursday, 2:30 PM ) 5. busy( Friday, 2:30 PM ) 6. not conflict( AI ) ASSUMPTION 7. not TueThu( AI, 2:30 PM ) ] or [ not busy( Thursday, 2:30 PM ) (2, 6) 8. MonWedFri( AI, 2:30 PM ) or [ not busy( Thursday, 2:30 PM ) ] (1, 7) 9. MonWedFri( AI, 2:30 PM ) (4, 8) A. [ not busy( Friday, 2:30 PM ) ] or conflict( AI ) (3, 9) B. conflict( AI ) (5, A) C. FALSE (6, B) So, resolution can handle cases that generalized modus ponens can t!
![not conflict( AI ) ASSUMPTION 7. not TueThu( AI, 2:30 PM ) ] or [ not busy( Thursday, 2:30 PM ) (2, 6) 8.](/docs-images/42/22983822/images/page_16.jpg "MonWedFri( AI, 2:30 PM ) or [ not busy( Thursday, 2:30 PM ) ] (1, 7) 9. MonWedFri( AI, 2:30 PM ) (4, 8) A. [ not busy( Friday, 2:30 PM ) ] or conflict( AI ) (3, 9) B.")
Logic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
Likewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
Resolution. Informatics 1 School of Informatics, University of Edinburgh
Resolution In this lecture you will see how to convert the natural proof system of previous lectures into one with fewer operators and only one proof rule. You will see how this proof system can be used
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
WRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
1.2 Forms and Validity
1.2 Forms and Validity Deductive Logic is the study of methods for determining whether or not an argument is valid. In this section we identify some famous valid argument forms. Argument Forms Consider
DEDUCTIVE & INDUCTIVE REASONING
DEDUCTIVE & INDUCTIVE REASONING Expectations 1. Take notes on inductive and deductive reasoning. 2. This is an information based presentation -- I simply want you to be able to apply this information to
6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
CHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
CS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
Logical Agents. Explorations in Artificial Intelligence. Knowledge-based Agents. Knowledge-base Agents. Outline. Knowledge bases
Logical Agents Explorations in Artificial Intelligence rof. Carla. Gomes gomes@cs.cornell.edu Agents that are able to: Form representations of the world Use a process to derive new representations of the
Cosmological Arguments for the Existence of God S. Clarke
Cosmological Arguments for the Existence of God S. Clarke [Modified Fall 2009] 1. Large class of arguments. Sometimes they get very complex, as in Clarke s argument, but the basic idea is simple. Lets
The Refutation of Relativism
The Refutation of Relativism There are many different versions of relativism: ethical relativism conceptual relativism, and epistemic relativism are three. In this paper, I will be concerned with only
Mathematical Induction. Lecture 10-11
Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach
Lecture Notes on Linear Search
Lecture Notes on Linear Search 15-122: Principles of Imperative Computation Frank Pfenning Lecture 5 January 29, 2013 1 Introduction One of the fundamental and recurring problems in computer science is
Lecture 8: Resolution theorem-proving
Comp24412 Symbolic AI Lecture 8: Resolution theorem-proving Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2014 15 In the previous Lecture, we met SATCHMO, a first-order theorem-prover implemented
DISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
Rules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example Re-Revisited Our Old Example: Suppose we have: All human beings
Handout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
Example: Backward Chaining. Inference Strategy: Backward Chaining. First-Order Logic. Knowledge Engineering. Example: Proof
Inference Strategy: Backward Chaining Idea: Check whether a particular fact q is true. Backward Chaining: Given a fact q to be proven, 1. See if q is already in the KB. If so, return TRUE. 2. Find all
Lecture 19: Introduction to NP-Completeness Steven Skiena. Department of Computer Science State University of New York Stony Brook, NY 11794 4400
Lecture 19: Introduction to NP-Completeness Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 11794 4400 http://www.cs.sunysb.edu/ skiena Reporting to the Boss Suppose
Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering
Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24
INCIDENCE-BETWEENNESS GEOMETRY
INCIDENCE-BETWEENNESS GEOMETRY MATH 410, CSUSM. SPRING 2008. PROFESSOR AITKEN This document covers the geometry that can be developed with just the axioms related to incidence and betweenness. The full
Basic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
Beyond Propositional Logic Lukasiewicz s System
Beyond Propositional Logic Lukasiewicz s System Consider the following set of truth tables: 1 0 0 1 # # 1 0 # 1 1 0 # 0 0 0 0 # # 0 # 1 0 # 1 1 1 1 0 1 0 # # 1 # # 1 0 # 1 1 0 # 0 1 1 1 # 1 # 1 Brandon
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1 Prof S Bringsjord 0317161200NY Contents I Problems 1 II Solutions 3 Solution to Q1 3 Solutions to Q3 4 Solutions to Q4.(a) (i) 4 Solution to Q4.(a)........................................
Lecture 2. What is the Normative Role of Logic?
Lecture 2. What is the Normative Role of Logic? What is the connection between (deductive) logic and rationality? One extreme: Frege. A law of logic is a law of rational thought. Seems problematic, if
Artificial Intelligence
Artificial Intelligence ICS461 Fall 2010 1 Lecture #12B More Representations Outline Logics Rules Frames Nancy E. Reed nreed@hawaii.edu 2 Representation Agents deal with knowledge (data) Facts (believe
Math Circle Beginners Group October 18, 2015
Math Circle Beginners Group October 18, 2015 Warm-up problem 1. Let n be a (positive) integer. Prove that if n 2 is odd, then n is also odd. (Hint: Use a proof by contradiction.) Suppose that n 2 is odd
Hypothetical Syllogisms 1
Phil 2302 Intro to Logic Dr. Naugle Hypothetical Syllogisms 1 Compound syllogisms are composed of different kinds of sentences in their premises and conclusions (not just categorical propositions, statements
Computational Logic and Cognitive Science: An Overview
Computational Logic and Cognitive Science: An Overview Session 1: Logical Foundations Technical University of Dresden 25th of August, 2008 University of Osnabrück Who we are Helmar Gust Interests: Analogical
Chapter 1. Use the following to answer questions 1-5: In the questions below determine whether the proposition is TRUE or FALSE
Use the following to answer questions 1-5: Chapter 1 In the questions below determine whether the proposition is TRUE or FALSE 1. 1 + 1 = 3 if and only if 2 + 2 = 3. 2. If it is raining, then it is raining.
Arguments and Dialogues
ONE Arguments and Dialogues The three goals of critical argumentation are to identify, analyze, and evaluate arguments. The term argument is used in a special sense, referring to the giving of reasons
How to write proofs: a quick guide
How to write proofs: a quick guide Eugenia Cheng Department of Mathematics, University of Chicago E-mail: eugenia@math.uchicago.edu Web: http://www.math.uchicago.edu/ eugenia October 2004 A proof is like
Certamen 1 de Representación del Conocimiento
Certamen 1 de Representación del Conocimiento Segundo Semestre 2012 Question: 1 2 3 4 5 6 7 8 9 Total Points: 2 2 1 1 / 2 1 / 2 3 1 1 / 2 1 1 / 2 12 Here we show one way to solve each question, but there
Introduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Now that we have a basic understanding
Full and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
Financial Mathematics
Financial Mathematics For the next few weeks we will study the mathematics of finance. Apart from basic arithmetic, financial mathematics is probably the most practical math you will learn. practical in
University of Ostrava. Reasoning in Description Logic with Semantic Tableau Binary Trees
University of Ostrava Institute for Research and Applications of Fuzzy Modeling Reasoning in Description Logic with Semantic Tableau Binary Trees Alena Lukasová Research report No. 63 2005 Submitted/to
Answers G53KRR 2009-10
s G53KRR 2009-10 1. (a) Express the following sentences in first-order logic, using unary predicates Fragile, Break, Fall, TennisBall. S1 Fragile things break if they fall S2 Tennis balls are not fragile
Lecture 13 of 41. More Propositional and Predicate Logic
Lecture 13 of 41 More Propositional and Predicate Logic Monday, 20 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Sections 8.1-8.3, Russell and Norvig
Does rationality consist in responding correctly to reasons? John Broome Journal of Moral Philosophy, 4 (2007), pp. 349 74.
Does rationality consist in responding correctly to reasons? John Broome Journal of Moral Philosophy, 4 (2007), pp. 349 74. 1. Rationality and responding to reasons Some philosophers think that rationality
Lehrstuhl für Informatik 2
Analytical Learning Introduction Lehrstuhl Explanation is used to distinguish the relevant features of the training examples from the irrelevant ones, so that the examples can be generalised Introduction
Copyright 2012 MECS I.J.Information Technology and Computer Science, 2012, 1, 50-63
I.J. Information Technology and Computer Science, 2012, 1, 50-63 Published Online February 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijitcs.2012.01.07 Using Logic Programming to Represent
Math 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
The Normative Role of Logic Hartry Field and Peter Milne
The Normative Role of Logic Hartry Field and Peter Milne WHAT IS THE NORMATIVE ROLE OF LOGIC? The paper tries to spell out a connection between deductive logic and rationality, against Harman s arguments
(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,
Logic and Reasoning Practice Final Exam Spring 2015. Section Number
Logic and Reasoning Practice Final Exam Spring 2015 Name Section Number The final examination is worth 100 points. 1. (5 points) What is an argument? Explain what is meant when one says that logic is the
Position Paper: Validation of Distributed Enterprise Data is Necessary, and RIF can Help
Position Paper: Validation of Distributed Enterprise Data is Necessary, and RIF can Help David Schaengold Director of Business Solutions Revelytix, Inc Sept 19, 2011, Revised Oct 17, 2011 Overview Revelytix
Peter: I think it's ridiculous. Almost as ridiculous as believing in the Tooth Fairy, or the Easter Bunny, or Santa Claus.
The following dialogue is partially edited/modified to reduce length. The material is from Peter Kreeft s (1984) The Best Things in Life. Socrates: Are you looking for me, Peter? Peter: As a matter of
Practice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
Mathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
Near Optimal Solutions
Near Optimal Solutions Many important optimization problems are lacking efficient solutions. NP-Complete problems unlikely to have polynomial time solutions. Good heuristics important for such problems.
Divine command theory
Today we will be discussing divine command theory. But first I will give a (very) brief overview of the semester, and the discipline of philosophy. Why do this? One of the functions of an introductory
Regression Verification: Status Report
Regression Verification: Status Report Presentation by Dennis Felsing within the Projektgruppe Formale Methoden der Softwareentwicklung 2013-12-11 1/22 Introduction How to prevent regressions in software
Lab Experience 17. Programming Language Translation
Lab Experience 17 Programming Language Translation Objectives Gain insight into the translation process for converting one virtual machine to another See the process by which an assembler translates assembly
060010706- Artificial Intelligence 2014
Module-1 Introduction Short Answer Questions: 1. Define the term Artificial Intelligence (AI). 2. List the two general approaches used by AI researchers. 3. State the basic objective of bottom-up approach
P1. All of the students will understand validity P2. You are one of the students -------------------- C. You will understand validity
Validity Philosophy 130 O Rourke I. The Data A. Here are examples of arguments that are valid: P1. If I am in my office, my lights are on P2. I am in my office C. My lights are on P1. He is either in class
8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
A Semantical Perspective on Verification of Knowledge
A Semantical Perspective on Verification of Knowledge Paul Leemans, Jan Treur, Mark Willems Vrije Universiteit Amsterdam, Department of Artificial Intelligence De Boelelaan 1081a, 1081 HV Amsterdam The
Introduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
NP-Completeness and Cook s Theorem
NP-Completeness and Cook s Theorem Lecture notes for COM3412 Logic and Computation 15th January 2002 1 NP decision problems The decision problem D L for a formal language L Σ is the computational task:
Writing Thesis Defense Papers
Writing Thesis Defense Papers The point of these papers is for you to explain and defend a thesis of your own critically analyzing the reasoning offered in support of a claim made by one of the philosophers
SECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
A proof is a method of establishing truth. What constitutes a proof differs among fields.
Chapter 1 What is a Proof? 1.1 Mathematical Proofs A proof is a method of establishing truth. What constitutes a proof differs among fields. Legal truth is decided by a jury based on allowable evidence
Predicate Logic. For example, consider the following argument:
Predicate Logic The analysis of compound statements covers key aspects of human reasoning but does not capture many important, and common, instances of reasoning that are also logically valid. For example,
MATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
Computational Methods for Database Repair by Signed Formulae
Computational Methods for Database Repair by Signed Formulae Ofer Arieli (oarieli@mta.ac.il) Department of Computer Science, The Academic College of Tel-Aviv, 4 Antokolski street, Tel-Aviv 61161, Israel.
A Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
Relations: their uses in programming and computational specifications
PEPS Relations, 15 December 2008 1/27 Relations: their uses in programming and computational specifications Dale Miller INRIA - Saclay & LIX, Ecole Polytechnique 1. Logic and computation Outline 2. Comparing
2. The Language of First-order Logic
2. The Language of First-order Logic KR & R Brachman & Levesque 2005 17 Declarative language Before building system before there can be learning, reasoning, planning, explanation... need to be able to
196 Chapter 7. Logical Agents
7 LOGICAL AGENTS In which we design agents that can form representations of the world, use a process of inference to derive new representations about the world, and use these new representations to deduce
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
Basic Set Theory. 1. Motivation. Fido Sue. Fred Aristotle Bob. LX 502 - Semantics I September 11, 2008
Basic Set Theory LX 502 - Semantics I September 11, 2008 1. Motivation When you start reading these notes, the first thing you should be asking yourselves is What is Set Theory and why is it relevant?
A simple algorithm with no simple verication
A simple algorithm with no simple verication Laszlo Csirmaz Central European University Abstract The correctness of a simple sorting algorithm is resented, which algorithm is \evidently wrong" at the rst
Schedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
Five High Order Thinking Skills
Five High Order Introduction The high technology like computers and calculators has profoundly changed the world of mathematics education. It is not only what aspects of mathematics are essential for learning,
Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
Read this syllabus very carefully. If there are any reasons why you cannot comply with what I am requiring, then talk with me about this at once.
LOGIC AND CRITICAL THINKING PHIL 2020 Maymester Term, 2010 Daily, 9:30-12:15 Peabody Hall, room 105 Text: LOGIC AND RATIONAL THOUGHT by Frank R. Harrison, III Professor: Frank R. Harrison, III Office:
Writing Functions in Scheme. Writing Functions in Scheme. Checking My Answer: Empty List. Checking My Answer: Empty List
Writing Functions in Scheme Writing Functions in Scheme Suppose we want a function ct which takes a list of symbols and returns the number of symbols in the list (ct (a b c)) 3 (ct ()) 0 (ct (x y z w t))
Invalidity in Predicate Logic
Invalidity in Predicate Logic So far we ve got a method for establishing that a predicate logic argument is valid: do a derivation. But we ve got no method for establishing invalidity. In propositional
Brought to you by the NVCC-Annandale Reading and Writing Center
Brought to you by the NVCC-Annandale Reading and Writing Center WORKSHOP OBJECTIVES: To understand the steps involved in writing inclass essays To be able to decode the question so that you answer the
Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new
Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of
Reminder: Complexity (1) Parallel Complexity Theory. Reminder: Complexity (2) Complexity-new GAP (2) Graph Accessibility Problem (GAP) (1)
Reminder: Complexity (1) Parallel Complexity Theory Lecture 6 Number of steps or memory units required to compute some result In terms of input size Using a single processor O(1) says that regardless of
Formalization of the CRM: Initial Thoughts
Formalization of the CRM: Initial Thoughts Carlo Meghini Istituto di Scienza e Tecnologie della Informazione Consiglio Nazionale delle Ricerche Pisa CRM SIG Meeting Iraklio, October 1st, 2014 Outline Overture:
Math 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
The Euclidean Algorithm
The Euclidean Algorithm A METHOD FOR FINDING THE GREATEST COMMON DIVISOR FOR TWO LARGE NUMBERS To be successful using this method you have got to know how to divide. If this is something that you have
MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
Rigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
Set Theory Basic Concepts and Definitions
Set Theory Basic Concepts and Definitions The Importance of Set Theory One striking feature of humans is their inherent need and ability to group objects according to specific criteria. Our prehistoric
Correspondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
High Integrity Software Conference, Albuquerque, New Mexico, October 1997.
Meta-Amphion: Scaling up High-Assurance Deductive Program Synthesis Steve Roach Recom Technologies NASA Ames Research Center Code IC, MS 269-2 Moffett Field, CA 94035 sroach@ptolemy.arc.nasa.gov Jeff Van