Reasoning Under Uncertainty: Introduction to Probability

Similar documents
Reasoning Under Uncertainty: Introduction to Probability

Propositional Logic: Semantics and an Example

Propositional Logic: Bottom-Up Proofs

Logic: Resolution Proofs; Datalog

Reasoning Under Uncertainty: Conditional Probability

Propositional Definite Clause Logic: Syntax, Semantics and Bottom-up Proofs

Individuals and Relations

Reasoning under Uncertainty: Intro to Probability

Logic: Top-down proof procedure and Datalog

Probability. CS 3793/5233 Artificial Intelligence Probability 1

Decision Theory Intro: Preferences and Utility

Reasoning under Uncertainty: Intro to Probability

Künstliche Intelligenz

Modal Logics. Most applications of modal logic require a refined version of basic modal logic.

Propositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1

THE LANGUAGE OF FIRST-ORDER LOGIC (FOL) Sec2 Sec1(1-16)

Logic: Intro & Propositional Definite Clause Logic

Contents Chapters 2 & 3

Learning Goals of CS245 Logic and Computation

Decision Theory: Q-Learning

How to determine if a statement is true or false. Fuzzy logic deal with statements that are somewhat vague, such as: this paint is grey.

Logic I - Session 22. Meta-theory for predicate logic

Computer Science CPSC 322. Lecture 18 Marginalization, Conditioning

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Logic: Bottom-up & Top-down proof procedures

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

First Order Logic: Syntax and Semantics

Modal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014

Reasoning Under Uncertainty: Conditioning, Bayes Rule & the Chain Rule

Logic: Propositional Logic (Part I)

09 Modal Logic II. CS 3234: Logic and Formal Systems. October 14, Martin Henz and Aquinas Hobor

Formal Logic Lecture 11

Decision Theory: Markov Decision Processes

Predicate Logic: Sematics Part 1

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

CS 730/730W/830: Intro AI

Uncertainty and Bayesian Networks

COMP219: Artificial Intelligence. Lecture 19: Logic for KR

Propositional Logic: Logical Agents (Part I)

CS 4649/7649 Robot Intelligence: Planning

Logic and machine learning review. CS 540 Yingyu Liang

Overview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR

INTRODUCTION TO NONMONOTONIC REASONING

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning

KB Agents and Propositional Logic


Propositional Logic: Review

Propositional logic. First order logic. Alexander Clark. Autumn 2014

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

Towards A Multi-Agent Subset Space Logic

STAT 201 Chapter 5. Probability

INTRODUCTION TO PREDICATE LOGIC HUTH AND RYAN 2.1, 2.2, 2.4

CS589 Principles of DB Systems Fall 2008 Lecture 4e: Logic (Model-theoretic view of a DB) Lois Delcambre

Stanford University CS103: Math for Computer Science Handout LN9 Luca Trevisan April 25, 2014

Automated Reasoning Lecture 5: First-Order Logic

Knowledge based Agents

Pengju

An AI-ish view of Probability, Conditional Probability & Bayes Theorem

10/18/2017. An AI-ish view of Probability, Conditional Probability & Bayes Theorem. Making decisions under uncertainty.

CSCI 5582 Artificial Intelligence. Today 9/28. Knowledge Representation. Lecture 9

Intelligent Agents. First Order Logic. Ute Schmid. Cognitive Systems, Applied Computer Science, Bamberg University. last change: 19.

Propositional Logic: Logical Agents (Part I)

Intelligent Systems (AI-2)

Pengju XJTU 2016

Lecture 4: Proposition, Connectives and Truth Tables

Logical Agents. Knowledge based agents. Knowledge based agents. Knowledge based agents. The Wumpus World. Knowledge Bases 10/20/14

Logical Inference. Artificial Intelligence. Topic 12. Reading: Russell and Norvig, Chapter 7, Section 5

Lecture 1: Probability Fundamentals

A Logic Primer. Stavros Tripakis University of California, Berkeley

CS156: The Calculus of Computation

Logic. Stephen G. Ware CSCI 4525 / 5525

Web Science & Technologies University of Koblenz Landau, Germany. Models in First Order Logics

Chapter 4: Classical Propositional Semantics

CS560 Knowledge Discovery and Management. CS560 - Lecture 3 1

Nathan Sturtevant FOL

Reasoning with Uncertainty

Uncertainty. Outline

Intensionality. 1. Intensional Propositional Logic (IntPL).

Nonclassical logics (Nichtklassische Logiken)

Preliminary Statistics Lecture 2: Probability Theory (Outline) prelimsoas.webs.com

MAI0203 Lecture 7: Inference and Predicate Calculus

Logic Background (1A) Young W. Lim 5/14/18

First-Order Logic First-Order Theories. Roopsha Samanta. Partly based on slides by Aaron Bradley and Isil Dillig

To every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.

Syntax of propositional logic. Syntax tree of a formula. Semantics of propositional logic (I) Subformulas

PROPOSITIONAL LOGIC. VL Logik: WS 2018/19

Tecniche di Verifica. Introduction to Propositional Logic

CSC242: Intro to AI. Lecture 11. Tuesday, February 26, 13

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Advanced Topics in LP and FP

Logic. Readings: Coppock and Champollion textbook draft, Ch

MULTI-AGENT ONLY-KNOWING

Probabilistic Reasoning

Markov Networks. l Like Bayes Nets. l Graph model that describes joint probability distribution using tables (AKA potentials)

Propositional Logic Part 1

SOEN331 Winter Tutorial 4 on Logic

DISCRETE STRUCTURES WEEK5 LECTURE1

An analogy from Calculus: limits

Logic in AI Chapter 7. Mausam (Based on slides of Dan Weld, Stuart Russell, Subbarao Kambhampati, Dieter Fox, Henry Kautz )

Transcription:

Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1 Textbook 6.1 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 1

Lecture Overview 1 Recap 2 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 2

Syntax of Datalog Definition (variable) A variable starts with upper-case letter. Definition (constant) A constant starts with lower-case letter or is a sequence of digits. Definition (term) A term is either a variable or a constant. Definition (predicate symbol) A predicate symbol starts with lower-case letter. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 3

Syntax of Datalog (cont) Definition (atom) An atomic symbol (atom) is of the form p or p(t 1,..., t n ) where p is a predicate symbol and t i are terms. Definition (definite clause) A definite clause is either an atomic symbol (a fact) or of the form: }{{} a b 1 b }{{ m } head body where a and b i are atomic symbols. Definition (knowledge base) A knowledge base is a set of definite clauses. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 4

Formal Semantics Definition (interpretation) An interpretation is a triple I = D, φ, π, where D, the domain, is a nonempty set. Elements of D are individuals. φ is a mapping that assigns to each constant an element of D. Constant c denotes individual φ(c). π is a mapping that assigns to each n-ary predicate symbol a relation: a function from D n into {TRUE, FALSE}. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 5

Variables Definition (variable assignment) A variable assignment is a function from variables into the domain. Given an interpretation and a variable assignment, each term denotes an individual and each clause is either true or false. A clause containing variables is true in an interpretation if it is true for all variable assignments. Variables are universally quantified in the scope of a clause. Now we can use our previous definition of logical entailment. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 6

Lecture Overview 1 Recap 2 Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 7

Using Uncertain Knowledge Agents don t have complete knowledge about the world. Agents need to make decisions based on their uncertainty. It isn t enough to assume what the world is like. Example: wearing a seat belt. An agent needs to reason about its uncertainty. When an agent makes an action under uncertainty, it is gambling = probability. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 8

Numerical Measures of Belief Belief in proposition, f, can be measured in terms of a number between 0 and 1 this is the probability of f. The probability that f is 0 means that f is believed to be definitely false. The probability that f is 1 means that f is believed to be definitely true. Using 0 and 1 is purely a convention. f has a probability between 0 and 1, doesn t mean f is true to some degree, but means you are ignorant of its truth value. Probability is a measure of your ignorance. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 9

Frequentists vs. Bayesians Probability is the formal measure of uncertainty. There are two camps: Frequentists: believe that probability represents something objective, and compute probabilities by counting the frequencies of different events Bayesians: believe that probability represents something subjective, and understand probabilities as degrees of belief. They compute probabilities by starting with prior beliefs, and then updating beliefs when they get new data. Example: Your degree of belief that a bird can fly is your measure of belief in the flying ability of an individual based only on the knowledge that the individual is a bird. Other agents may have different probabilities, as they may have had different experiences with birds or different knowledge about this particular bird. An agent s belief in a bird s flying ability is affected by what the agent knows about that bird. Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 10

Possible World Semantics Probability is a formal measure of uncertainty. A random variable is a variable that is randomly assigned one of a number of different values. The domain of a variable X, written dom(x), is the set of values X can take. A possible world specifies an assignment of one value to each random variable. w = X = x means variable X is assigned value x in world w. Let Ω be the set of all possible worlds. Define a nonnegative measure µ(w) to each world w so that the measures of the possible worlds sum to 1. The probability of proposition f is defined by: P (f) = w =f µ(w). Reasoning Under Uncertainty: Introduction to Probability CPSC 322 Uncertainty 1, Slide 11