Lecture 11 of 42. Lecture 11 of 42

Similar documents
Proof Theory for Syntacticians

Knowledge-Based - Systems

Objectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

Lecture 1: Basic Concepts of Machine Learning

Foundations of Knowledge Representation in Cyc

Compositional Semantics

MYCIN. The MYCIN Task

COSI Meet the Majors Fall 17. Prof. Mitch Cherniack Undergraduate Advising Head (UAH), COSI Fall '17: Instructor COSI 29a

Knowledge based expert systems D H A N A N J A Y K A L B A N D E

Axiom 2013 Team Description Paper

Lecture 10: Reinforcement Learning

Rule-based Expert Systems

Evolution of Collective Commitment during Teamwork

Visual CP Representation of Knowledge

Part III: Semantics. Notes on Natural Language Processing. Chia-Ping Chen

Segmented Discourse Representation Theory. Dynamic Semantics with Discourse Structure

Causal Link Semantics for Narrative Planning Using Numeric Fluents

Replies to Greco and Turner

KBS : Knowledge Representation. Motivation. Epistemology. Objectives

TEACHING AND EXAMINATION REGULATIONS PART B: programme-specific section MASTER S PROGRAMME IN LOGIC

Self Study Report Computer Science

School of Innovative Technologies and Engineering

Two-Valued Logic is Not Sufficient to Model Human Reasoning, but Three-Valued Logic is: A Formal Analysis

THE UNIVERSITY OF SYDNEY Semester 2, Information Sheet for MATH2068/2988 Number Theory and Cryptography

MYCIN. The embodiment of all the clichés of what expert systems are. (Newell)

B.S/M.A in Mathematics

(Sub)Gradient Descent

Natural Language Processing. George Konidaris

AQUA: An Ontology-Driven Question Answering System

Chapter 2 Rule Learning in a Nutshell

Transfer Learning Action Models by Measuring the Similarity of Different Domains

Seminar - Organic Computing

LFG Semantics via Constraints

Neuro-Symbolic Approaches for Knowledge Representation in Expert Systems

ENME 605 Advanced Control Systems, Fall 2015 Department of Mechanical Engineering

Undergraduate Program Guide. Bachelor of Science. Computer Science DEPARTMENT OF COMPUTER SCIENCE and ENGINEERING

We are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming.

CS4491/CS 7265 BIG DATA ANALYTICS INTRODUCTION TO THE COURSE. Mingon Kang, PhD Computer Science, Kennesaw State University

GRADUATE STUDENT HANDBOOK Master of Science Programs in Biostatistics

Multisensor Data Fusion: From Algorithms And Architectural Design To Applications (Devices, Circuits, And Systems)

Mathematics Program Assessment Plan

Chapter 2. Intelligent Agents. Outline. Agents and environments. Rationality. PEAS (Performance measure, Environment, Actuators, Sensors)

INTERMEDIATE ALGEBRA Course Syllabus

POLA: a student modeling framework for Probabilistic On-Line Assessment of problem solving performance

arxiv: v1 [cs.se] 20 Mar 2014

Introduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.

Exploration. CS : Deep Reinforcement Learning Sergey Levine

SEMAFOR: Frame Argument Resolution with Log-Linear Models

Probabilistic Model Checking of DTMC Models of User Activity Patterns

Python Machine Learning

Discriminative Learning of Beam-Search Heuristics for Planning

Mathematics. Mathematics

RUDOLF CARNAP ON SEMANTICAL SYSTEMS AND W.V.O. QUINE S PRAGMATIST CRITIQUE

Evolutive Neural Net Fuzzy Filtering: Basic Description

Grade 6: Correlated to AGS Basic Math Skills

How to analyze visual narratives: A tutorial in Visual Narrative Grammar

The Use of Statistical, Computational and Modelling Tools in Higher Learning Institutions: A Case Study of the University of Dodoma

CAAP. Content Analysis Report. Sample College. Institution Code: 9011 Institution Type: 4-Year Subgroup: none Test Date: Spring 2011

A Genetic Irrational Belief System

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

Sacramento State Degree Revocation Policy and Procedure

Artificial Neural Networks written examination

EGRHS Course Fair. Science & Math AP & IB Courses

Clackamas CC BI 231, 232, 233 BI 231,232, BI 234 BI 234 BI 234 BI 234 BI 234 BI 234 BIOL 234, 235, 323 or 244

FF+FPG: Guiding a Policy-Gradient Planner

DIDACTIC MODEL BRIDGING A CONCEPT WITH PHENOMENA

AP Calculus AB. Nevada Academic Standards that are assessable at the local level only.

Intension, Attitude, and Tense Annotation in a High-Fidelity Semantic Representation

Georgetown University at TREC 2017 Dynamic Domain Track

Planning in Intelligent Systems: Model-based Approach to Autonomous Behavior

Content-free collaborative learning modeling using data mining

A BOOK IN A SLIDESHOW. The Dragonfly Effect JENNIFER AAKER & ANDY SMITH

Using AMT & SNOMED CT-AU to support clinical research

Constraining X-Bar: Theta Theory

Study and Analysis of MYCIN expert system

Using the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the SAT

Shared Mental Models

Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition

Lecture 1: Machine Learning Basics

A Comparison of the Rule and Case-based Reasoning Approaches for the Automation of Help-desk Operations at the Tier-two Level

Math 181, Calculus I

Controlled vocabulary

Predicting Students Performance with SimStudent: Learning Cognitive Skills from Observation

Probability and Game Theory Course Syllabus

Speeding Up Reinforcement Learning with Behavior Transfer

Designing A Computer Opponent for Wargames: Integrating Planning, Knowledge Acquisition and Learning in WARGLES

CUNY ASSESSMENT TESTS Webinar for International Students

INTERMEDIATE ALGEBRA PRODUCT GUIDE

Basic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1

A R "! I,,, !~ii ii! A ow ' r.-ii ' i ' JA' V5, 9. MiN, ;

Rule Chaining in Fuzzy Expert Systems

SANTIAGO CANYON COLLEGE Reading & English Placement Testing Information

PH.D. IN COMPUTER SCIENCE PROGRAM (POST M.S.)

Agents and environments. Intelligent Agents. Reminders. Vacuum-cleaner world. Outline. A vacuum-cleaner agent. Chapter 2 Actuators

Language properties and Grammar of Parallel and Series Parallel Languages

Intelligent Agents. Chapter 2. Chapter 2 1

Using focal point learning to improve human machine tacit coordination

Emporia State University Degree Works Training User Guide Advisor

The Conversational User Interface

Transcription:

Propositional Logic William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://snipurl.com/v9v3 Course web site: http://www.kddresearch.org/courses/cis730 Instructor home page: http://www.cis.ksu.edu/~bhsu Reading for Next Class: Section 8.1 8.2, p. 240-253, Russell & Norvig 2 nd edition Lecture Outline Reading for Next Class: Sections 8.1 8.2 (p. 240 253), R&N 2 e Last Class: Intro to KR and Logic, Sections 7.1-7.4 (p. 194-210), R&N 2 e Today: Prop. Logic Syntax, Semantics, Proofs, 7.5-7.7 (211-232), R&N 2 e Propositional calculus aka propositional logic Syntax: propositions and connectives Semantics: models, truth assignments (relation to Boolean algebra) Proof procedures: enumeration, forward/backward chaining Clausal form (conjunctive normal form, aka CNF) Properties of sentences: entailment and provability, satisfiability and validity of proof rules: soundness and completeness This Month: Alternative Knowledge Representations Elements of logic: ontology and epistemology Section III: Propositional (Ch. 7), first-order (8 9), temporal logics (10) Section V: Probability (Chapters 13-15), fuzzy logic (Chapter 14) Coming Weeks: KR/Reasoning in First-Order Logic (Ch. 8 10)

Learning to Play Checkers: Design Choices Determine Type of Training Experience Games against experts Board move Determine Target Function Games against self Board value Table of correct moves Polynomial Determine Representation of Learned Function Linear function of six features Artificial neural network Determine Learning Algorithm Gradient descent Completed Design Linear programming Adapted from materials 1997 T. M. Mitchell. Reused with permission. Chapter 7 Continued

Simple Knowledge-Based Agent: Review Wumpus World Peas Description: Review Performance measure gold +1000, death -1000-1 per step, -10 for using the arrow Environment Squares adjacent to wumpus are smelly Squares adjacent to pit are breezy Glitter iff gold is in the same square Shooting kills wumpus if you are facing it Shooting uses up the only arrow Grabbing picks up gold if in same square Releasing drops the gold in same square Actuators: Left turn, Right turn, Forward, Grab, Release, Shoot Sensors: Stench, Breeze, Glitter, Bump, Scream Adapted from slides

Wumpus World Example: Review P? B OK P? OK Adapted from slides Possible Worlds Semantics: Review Based on slide

Wumpus Models [1] [2]: Review KB {Rules} Breeze (1, 1) Breeze (2, 1) Adapted from slides Wumpus Models [3] KB {Rules} Breeze (2, 1) Excludes possible world where neither (2, 2) nor (3, 1) has a pit Adapted from slide

Wumpus Models [4] Adapted from slides Inference

Propositional Logic: Syntax Propositional Logic: Semantics

Truth Tables for Connectives Wumpus World Sentences

Truth Tables for Inference Inference by Enumeration

Logical Equivalence Logical Equivalence

Validity and Satisfiability Proof Methods

Forward and backward Chaining: Modus Ponens Sequent Rule Based on slide Forward Chaining [1] Intuition Based on slide

Forward Chaining [2] Algorithm Based on slide Forward Chaining [3]: Example 0 1 n: number of antecedents (LHS conjuncts) still unmatched 10 2 02 1 2 0 1 2 01 Adapted from slides

Proof of Completeness Backward Chaining [1]: Intuition

Backward Chaining [2]: Example Forward vs. Backward Chaining

Terminology Intro to Knowledge Representation (KR) and Logic Representations: propositional, first-order, temporal; probabilistic, fuzzy Propositional calculus (aka propositional logic) Syntax, semantics, proof rules aka rules of inference, sequent rules Boolean algebra: equivalent to classical propositional calculus & inference Properties of sentences (and sets of sentences, aka knowledge bases) entailment provability/derivability validity: truth in all models (aka tautological truth) satisfiability: truth in some models Properties of proof rules soundness: KB α KB α (can prove only true sentences) completeness: KB α KB α (can prove all true sentences) Next: Propositional and First-Order Predicate Calculus (FOPC) Ontology: what objects/entities, and relationships exist Epistemology: what knowledge an agent can hold Summary Points Propositional Calculus (aka Propositional Logic) Relationship to Boolean algebra Sentences: syntax and semantics Proof procedures Truth table enumeration (very simple form of model checking) Forward chaining Backward chaining Properties of sentences: entailment, derivability/provability; validity, satisfiability of proof rules: soundness and completeness Overview of Knowledge Representation (KR) and Logic Elements of logic: ontology and epistemology Representations covered in this course, by ontology and epistemology Still to Cover in Chapter 7: Resolution, Conjunctive Normal Form (CNF) Next Class: Sections 8.1 8.2 (p. 211 232), R&N 2 e First-order predicate calculus (FOPC) aka first order logic (FOL) Syntax of FOL: constants, variables, functions, terms, predicates Semantics of FOL: objects, functions, relations