Artificial Intelligence Introduction Alison Cawsey room: G36 email: alison@macs.hw.ac.ukalison@macs.hw.ac.uk Ruth Aylett Room: 1.37 Email: ruth@macs.hw.ac.uk. - презентация

1 Artificial Intelligence Introduction Alison Cawsey room: G36 Ruth Aylett Room:

2 What is AI? n Various definitions: u Building intelligent entities. u Getting computers to do tasks which require human intelligence. n But what is intelligence? n Simple things turn out to be the hardest to automate: u Recognising a face. u Navigating a busy street. u Understanding what someone says. n All tasks require reasoning on knowledge.

3 Why do AI? n Two main goals of AI: u To understand human intelligence better. We test theories of human intelligence by writing programs which emulate it. u To create useful smart programs able to do tasks that would normally require a human expert.

4 Who does AI? n Many disciplines contribute to goal of creating/modelling intelligent entities: u Computer Science u Psychology (human reasoning) u Philosophy (nature of belief, rationality, etc) u Linguistics (structure and meaning of language) u Human Biology (how brain works) n Subject draws on ideas from each discipline.

5 Typical AI Problems n Intelligent entities (or agents) need to be able to do both mundane and expert tasks: n Mundane tasks - consider going shopping: u Planning a route, and sequence of shops to visit! u Recognising (through vision) buses, people. u Communicating (through natural language). u Navigating round obstacles on the street, and manipulating objects for purchase. n Expert tasks are things like: u medical diagnosis. u equipment repair. n Often mundane tasks are the hardest.

6 Philosophical Issues n What is intelligence? n Can a machine be truly intelligent? Is there more to human intelligence than rules, data and calculations? Tests: n Turing Test: Can someone tell which is the machine, when communicating to human and to a machine in another room? If not, can we call the machine intelligent? n Chinese room: Searle says no. Describes a thought experiment where talk in Chinese by looking up what to say from huge rule book. n Loebner contest: Contest for most human-like conversation system.

7 Example conversation with system winning Loebner prize n P: No worries! Hey! I didnt come here to be subjected to bad language! How rude! n J: Sorry, sorry. Didnt mean to offend. So, how old are you? n P: Thats OK. Just dont do it again. Well, should my age really matter. Just for the record Im 24. How old are you then. But.. System was based on fairly simple methods, with pre- stored amusing replies. These simple methods first used in Eliza - a program to emulate psychotherapist. Try esc-x doctor while in emacs for a version of Eliza. n Human-like performance doesnt guarantee intelligence.

8 About this Module Covers following AI topics u AI Programming, using Prolog. u Knowledge representation: F How do we represent knowledge about the world in a formal manner that can be manipulated in a sound and efficient manner? u Search: F How can an AI system go through all the possibilities in a systematic manner when looking for solutions to complex problems.

9 About this Module u Natural Language: F How can a system communicate in a natural language such as English. u Machine learning and neural networks: F How can a system learn from experience, or from past case data. u Agents: F How can we develop and use practical intelligent agents. u Knowledge Engineering: F How do we elicit the human expertise required to build intelligent applications.

10 Labs and Coursework n Weekly lab, starting Wed 16 th April! n Labs give you experience of two AI programming languages: Prolog and NetLogo. n Weeks 1-4: Exercises on AI Programming in Prolog. u Some of these must be ticked off by Lab demonstrators and will contribute to your coursework mark. n Weeks 5-8: NetLogo with assessed exercise.

11 Books etc. n Essence of Artificial Intelligence by Alison Cawsey, Prentice Hall. u Review: I missed most of the lectures but thanks to this short and sweet book I passed my first year introduction to AI course. If you are a slack student taking an AI course - buy this book. n Artificial Intelligence: A Modern Approach (second edition), Russell & Norvig, Prentice Hall n Artificial Intelligence: Structures and Strategies for Complex Problem Solving, Luger, Benjamin Cummings. n Slides, lab exercises etc for weeks 1-4 on

12 Module prerequisites/assumptions n Programming (software engineering). n CS students will benefit from: u Logic and Proof n IT students will benefit from u Cognitive Science. n Relevant material from logic and proof will be reviewed again for benefit of IT students.

13 Getting Started with Prolog n Prolog is a language based on first order predicate logic. (Will revise/introduce this later). n We can assert some facts and some rules, then ask questions to find out what is true. n Facts: n Note: lower case letters, full stop at end. likes(john, mary). tall(john). tall(sue). short(fred). teaches(alison, artificialIntelligence).

14 Prolog n Rules: u John likes someone if that someone is tall. u A person examines a course if they teach that course. u NOTE: :- used to mean IF. Meant to look a bit like a backwards arrow u NOTE: Use of capitals (or words starting with capitals) for variables. likes(fred, X) :- tall(X). examines(Person, Course) :- teaches(Person, Course).

15 Prolog n Your program consists of a file containing facts and rules. n You run your program by asking questions at the prolog prompt. n John likes who? n Answers are then displayed. Type ; to get more answers: (Note: darker font for system output) |?- likes(fred, X). X = john ? ; X = sue ? ; no

16 Prolog and Search n Prolog can return more than one answer to a question. n It has a built in search method for going through all the possible rules and facts to obtain all possible answers. n Search method depth first search with backtracking.

17 Summary n AI about creating intelligent entities, with a range of abilities such as language, vision, manipulation/navigation.. n Intelligence involves knowledge - this must be represented with and reasoned with. n Solving problems involves search. n Prolog is a language geared to representing knowledge and searching for solutions. n Prolog programs based on facts and rules, and run by asking questions.