ARTIFICIAL INTELLIGENCE DR. ABRAHAM 6303. AI a field of computer science that is concerned with mechanizing things people do that require intelligent.

Slides:



Advertisements
Similar presentations
Some Prolog Prolog is a logic programming language
Advertisements

ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
Software Development Languages and Environments. Programming languages High level languages are problem orientated contain many English words are easier.
Artificial Intelligence Chapter 21 The Situation Calculus Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Part2 AI as Representation and Search
Formal Logic Mathematical Structures for Computer Science Chapter 1 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFormal Logic.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 7– Predicate Calculus and Knowledge Representation.
Intelligent systems Lecture 6 Rules, Semantic nets.
Best-First Search: Agendas
Knowledge Engineering.  Process of acquiring knowledge from experts and building knowledge base  Narrow perspective  Knowledge acquisition, representation,
Chapter 11 Artificial Intelligence and Expert Systems.
Introduction to Expert Systems
1 5.0 Expert Systems Outline 5.1 Introduction 5.2 Rules for Knowledge Representation 5.3 Types of rules 5.4 Rule-based systems 5.5 Reasoning approaches.
Production Rules Rule-Based Systems. 2 Production Rules Specify what you should do or what you could conclude in different situations. Specify what you.
Theories of Mind: An Introduction to Cognitive Science Jay Friedenberg Gordon Silverman.
Marakas: Decision Support Systems, 2nd Edition © 2003, Prentice-Hall Chapter Chapter 7: Expert Systems and Artificial Intelligence Decision Support.
EXPERT SYSTEMS Part I.
Building Knowledge-Driven DSS and Mining Data
CPSC 433 Artificial Intelligence CPSC 433 : Artificial Intelligence Tutorials T01 & T02 Andrew “M” Kuipers note: please include.
Sepandar Sepehr McMaster University November 2008
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
Computer Architecture Computational Models Ola Flygt V ä xj ö University
School of Computing and Mathematics, University of Huddersfield Computing Science: WEEK 17 Announcement: next few weeks… 9 nd Feb: Comparative Programming.
1 Software Development Topic 2 Software Development Languages and Environments.
Artificial Intelligence Lecture No. 15 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Notes for Chapter 12 Logic Programming The AI War Basic Concepts of Logic Programming Prolog Review questions.
Artificial Intelligence
School of Computer Science and Technology, Tianjin University
1 Artificial Intelligence Introduction. 2 What is AI? Various definitions: Building intelligent entities. Getting computers to do tasks which require.
Overall course structure AI Artificial Intelligence ( A modern approach ) AI-2 Spring semester TDT4171 Methods in artificial intelligence AI-1 Fall semester.
Logical Agents Logic Propositional Logic Summary
CS 415 – A.I. Slide Set 5. Chapter 3 Structures and Strategies for State Space Search – Predicate Calculus: provides a means of describing objects and.
Introduction From: Chapter 1, Building Expert Systems in Prolog, htm.
Computing & Information Sciences Kansas State University Wednesday, 20 Sep 2006CIS 490 / 730: Artificial Intelligence Lecture 12 of 42 Wednesday, 20 September.
Artificial Intelligence (AI) is the science known for making intelligent machines. In this context intelligence means the ability of machines to simulate.
 Dr. Syed Noman Hasany 1.  Review of known methodologies  Analysis of software requirements  Real-time software  Software cost, quality, testing.
Presentation for CS490 Other Topics By: Chihwei Hsu By: Chihwei Hsu Date: Nov 17, 2003 Date: Nov 17, 2003 Class: CS490 Class: CS490.
Logic Programming CSC 358/ Outline Pattern matching Unification Logic programming.
Chapter 15: KNOWLEDGE-BASED INFORMATION SYSTEMS. What is Knowledge? Data: Raw facts, e.g., Annual Expenses = $2 million Information: Data given context,
The AI War LISP and Prolog Basic Concepts of Logic Programming
The Scientific Method An approach to acquiring knowledge.
COM362 Knowledge Engineering Inferencing 1 Inferencing: Forward and Backward Chaining John MacIntyre
Generic Tasks by Ihab M. Amer Graduate Student Computer Science Dept. AUC, Cairo, Egypt.
Automated Reasoning Early AI explored how to automated several reasoning tasks – these were solved by what we might call weak problem solving methods as.
Intelligent Control Methods Lecture 7: Knowledge representation Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Introduction to Prolog. Outline What is Prolog? Prolog basics Prolog Demo Syntax: –Atoms and Variables –Complex Terms –Facts & Queries –Rules Examples.
KNOWLEDGE BASED SYSTEMS
Basic Problem Solving Search strategy  Problem can be solved by searching for a solution. An attempt is to transform initial state of a problem into some.
Data Structure Introduction Dr. Bernard Chen Ph.D. University of Central Arkansas Fall 2010.
Logic Programming Tarik Booker. What will we cover?  Introduction  Definitions  Predicate Calculus  Prolog  Applications.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
Artificial Intelligence CIS 342 The College of Saint Rose David Goldschmidt, Ph.D.
CMPB454 ARTIFICIAL INTELLIGENCE (AI) CHAPTER 1.1 Background Information CHAPTER 1.1 Background Information Instructor: Alicia Tang Y. C.
Abdul Rahim Ahmad MITM 613 Intelligent System Chapter 10: Tools.
Artificial Intelligence
Forward and Backward Chaining
1 ARTIFICIAL INTELLIGENCE Gilles BÉZARD Version 3.16.
Logic Programming Logic programming Candidates should be familiar with the concept of logic programming for declaring logical relationships.
EXPERT SYSTEMS BY MEHWISH MANZER (63) MEER SADAF NAEEM (58) DUR-E-MALIKA (55)
By Muhammad Safdar MCS [E-Section].  There are times in life when you are faced with challenging decisions to make. You have rules to follow and general.
Lecture 14. Recap Problem Solving GA Simple GA Examples of Mutation and Crossover Application Areas.
Knowledge Representation Part I Ontology Jan Pettersen Nytun Knowledge Representation Part I, JPN, UiA1.
Knowledge Representation Techniques
Artificial Intelligence, P.I
Introduction to Expert Systems Bai Xiao
Architecture Components
Knowledge Representation
CS62S: Expert Systems Based on:
Information Systems General Information.
CPSC 433 : Artificial Intelligence Tutorials T01 & T02
Presentation transcript:

ARTIFICIAL INTELLIGENCE DR. ABRAHAM 6303

AI a field of computer science that is concerned with mechanizing things people do that require intelligent behavior requirements for intelligent behavior are the knowledge and searching. AI must be concerned with acquiring knowledge and application of it using rules.

Knowledge Data consists of raw numbers, measurements, characters, etc. without any added meaning Information is obtained as a result of processing of the data and carries with it some specific meaning. Knowledge is a collection of related facts, procedures, models and logics that can be used in learning and problem solving.

Knowledge Randomly picked data items from a database would not provide any meaningful results and could be classified as data. However all related data about a particular person is picked, it gives information about that person. When this information is applied to derive a solution to a problem that is not evident in the person’s record, the tools and information used together is called knowledge.

Knowledge Knowledge can be represented as part of a rule. Any rule consists of an ‘if part’ and a ‘then part’ as in ‘if it is cloudy then it will rain’, or ‘if Thomas is the son of John and Mercy is the wife of John then Mercy is the mother of Thomas’. Knowledge can also be represented using predicate and prepositional calculus. Examples of predicate statements are: likes(john, mercy), mother(mercy, thomas).

Searching In searching for a solution each rule is compared with the facts contained in the database. When the ‘if’ part of the rule matches a fact, then the ‘then’ part is executed.

Searching There are two ways in which rules are compared and executed, forward chaining and backward chaining.

Forward Chaining In forward chaining (also known as data- driven search), the search begins with the given facts applying to the rules and proceeds to create new facts, which in turn may create additional new facts, eventually satisfying the ‘if’ portion.

Backward Chaining In backward chaining (also known as goal-driven reasoning), the process start with the desired goal (hypothesis) and finds rules that satisfy the goal, as in solving a maze from the finish back to the start.

Programming Languages for AI Programs for Artificial Intelligence can be developed using any high level language, but will require many complex ‘if then else’ statements. Common Lisp and Prolog are languages developed specifically for AI programming that reduces number of lines of code dramatically. –The Lisp was developed specifically for list processing. –Prolog (Programming in Logic) is used for solving problems that involve objects and relationships between objects.

Prolog If a statement reads, “John is a sibling of Thomas”, it can be coded into Prolog since it describes relationship between two objects. What makes them brothers? There are various ways to describe this relationship, children have same parents, children have same father, children have same mother, etc. For example, “two children are siblings if they have the same father”

Prolog: sibling(Child1,Child2) :-father(Child1,Fname), father(Child2,Fname)