Department of Computer Applications. BCA (C: 501): (Artificial Intelligence)

Similar documents
Logic in general. Inference rules and theorem proving

Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering

Artificial Intelligence 2014

Artificial Intelligence

Reusable Knowledge-based Components for Building Software. Applications: A Knowledge Modelling Approach

CpSc810 Goddard Notes Chapter 7. Expert Systems

CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs

Expert Systems : AI Course Lecture 35 36, notes, slides RC Chakraborty, rcchak@gmail.

Complexity Theory. IE 661: Scheduling Theory Fall 2003 Satyaki Ghosh Dastidar

3. Mathematical Induction

Course Outline Department of Computing Science Faculty of Science. COMP Applied Artificial Intelligence (3,1,0) Fall 2015

Lecture 13 of 41. More Propositional and Predicate Logic

CS510 Software Engineering

Topic 2: Structure of Knowledge-Based Systems

CPSC 211 Data Structures & Implementations (c) Texas A&M University [ 313]

IAI : Expert Systems

FUNDAMENTALS OF ARTIFICIAL INTELLIGENCE KNOWLEDGE REPRESENTATION AND NETWORKED SCHEMES

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.

Extending Data Processing Capabilities of Relational Database Management Systems.

CHAPTER 7 GENERAL PROOF SYSTEMS

1) Explain the following evolutionary process models: a) The spiral model. b) The concurrent development model.

Predicate Logic. For example, consider the following argument:

THE DEVELOPMENT OF AN EXPERT CAR FAILURE DIAGNOSIS SYSTEM WITH BAYESIAN APPROACH

Explore 2: Gathering Momentum

Improving Knowledge-Based System Performance by Reordering Rule Sequences

A Knowledge Base Representing Porter's Five Forces Model

COMPUTER SCIENCE TRIPOS

Open-Source, Cross-Platform Java Tools Working Together on a Dialogue System

COMP 590: Artificial Intelligence

CS MidTerm Exam 4/1/2004 Name: KEY. Page Max Score Total 139

Overview of the TACITUS Project

Likewise, we have contradictions: formulas that can only be false, e.g. (p p).

Ontological Model of Educational Programs in Computer Science (Bachelor and Master Degrees)

History of Artificial Intelligence. Introduction to Intelligent Systems

Handout #1: Mathematical Reasoning

Application Design: Issues in Expert System Architecture. Harry C. Reinstein Janice S. Aikins

BCS HIGHER EDUCATION QUALIFICATIONS Level 6 Professional Graduate Diploma in IT. March 2013 EXAMINERS REPORT. Knowledge Based Systems

each college c i C has a capacity q i - the maximum number of students it will admit

Algorithmic Software Verification

Introduction to Logic in Computer Science: Autumn 2006

Outline. NP-completeness. When is a problem easy? When is a problem hard? Today. Euler Circuits

2) Write in detail the issues in the design of code generator.

Knowledge Engineering (Ingeniería del Conocimiento)

WRITING PROOFS. Christopher Heil Georgia Institute of Technology

[Refer Slide Time: 05:10]

Scope. Cognescent SBI Semantic Business Intelligence

Preschool Development Assessment

Knowledge Representation (II)

How To Design An Expert System For Error Detection And Correction In Software Development Environment

Midterm Practice Problems

KS3 Computing Group 1 Programme of Study hours per week

Math 3000 Section 003 Intro to Abstract Math Homework 2

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

8. KNOWLEDGE BASED SYSTEMS IN MANUFACTURING SIMULATION

Requirements. Approaches to user support. Command assistance. Chapter 11 User support

Logic and Reasoning Practice Final Exam Spring Section Number

Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1

Why Study NP- hardness. NP Hardness/Completeness Overview. P and NP. Scaling 9/3/13. Ron Parr CPS 570. NP hardness is not an AI topic

Lecture 19: Introduction to NP-Completeness Steven Skiena. Department of Computer Science State University of New York Stony Brook, NY

Classification - Examples

Writing Learning Objectives

Ant Colony Optimization and Constraint Programming

Project and Production Management Prof. Arun Kanda Department of Mechanical Engineering Indian Institute of Technology, Delhi

Bounded Treewidth in Knowledge Representation and Reasoning 1

Module Catalogue for the Bachelor Program in Computational Linguistics at the University of Heidelberg

INTRUSION PREVENTION AND EXPERT SYSTEMS

Scheduling. Getting Started. Scheduling 79

Last time we had arrived at the following provisional interpretation of Aquinas second way:

CS311H. Prof: Peter Stone. Department of Computer Science The University of Texas at Austin

CSC384 Intro to Artificial Intelligence

Introduction to Machine Learning and Data Mining. Prof. Dr. Igor Trajkovski

DISCRETE MATH: LECTURE 3

The Basics of Graphical Models

Regular Languages and Finite Automata

Lecture 18 of 42. Lecture 18 of 42

Sources: On the Web: Slides will be available on:

How To Proofread

Neighborhood Data and Database Security

Analytic Modeling in Python

Oracle Turing machines faced with the verification problem

IAI : Knowledge Representation

Computer Network. Interconnected collection of autonomous computers that are able to exchange information

DELAWARE MATHEMATICS CONTENT STANDARDS GRADES PAGE(S) WHERE TAUGHT (If submission is not a book, cite appropriate location(s))

The Turing Test! and What Computer Science Offers to Cognitive Science "

Philosophical argument

Single machine models: Maximum Lateness -12- Approximation ratio for EDD for problem 1 r j,d j < 0 L max. structure of a schedule Q...

Lecture 2. What is the Normative Role of Logic?

Test case design techniques II: Blackbox testing CISS

(Refer Slide Time: 01:52)

Kant s deontological ethics

Solving Systems of Linear Equations Putting it All Together

8 Divisibility and prime numbers

Chapter 5: Fallacies. 23 February 2015

Ontologies for Enterprise Integration

Transcription:

C (C: 501): (rtificial Intelligence) Unit 1 1. Define and describe the difference between knowledge, belief, hypothesis and data. 2. What is the difference between declarative and procedural knowledge? 3. Look up the meaning of epistemology in a good encyclopedia and prepare a definition. 4. The Turing test has often been incorrectly interpreted as being a test of whether or not a person could distinguish between responses from a computer and responses from a person. How does this differ from the real Turing test? re the two tests equivalent? If not, explain why they are not? 5. What important knowledge products are currently being marketed like other commodities? What are some new knowledge products likely to be sold within the next ten years? 6. riefly describe the meaning of knowledge representation and knowledge acquisition. 7. Give four different ways to represent the fact that John is ill s father. 8. Given the following wffs P-Q, and P, show that P is a logical consequence of two preceding wffs: a) Using a truth table b) Using Theorem. 9. What is.i.give definition of.i.? 10. What is the Scope if.i. 11. Define general issues of.i. 13. What is State Space problem? Where it is applicable. 14..I. is useful in Vision and Speech processing and Expert system. 15. How can computer system will become intelligence. Describe briefly. Unit2 1. Give an example of a problem for which breadth-first-search would work better than Depth-first-search 2. Describe how the branch-and-bound technique could be used to find the Shortest to a water jug problem. 3. When would best-first-search be worse than simple breadth-first-search? 4. Suppose that first step of the operation of the best-first-search algorithm Results in the following situation (a+ b means that the value of h at a node is a and the value of g is b). Question ank of C(C-501): rtificial Intelligence Page 1/5

(4+1) C (3+1) The second and third steps then result in the following sequence of situation. (3+1) C C (4+1) (3+1) (4+1) E D D (4+2) (2+2) (4+2) (a) What node will be expanded at the next step? (b) Can we guarantee that the best solution will be found? 5. What is default reasoning and how can you perform it with non-monotonic reasoning? 6. What is Mean-End-nalysis? 7. Write * algorithm and show how * algorithm can be used to find Minimal-cost over all path or simply any path as quickly as possible. 8 How best-first-search algorithm supports heuristic evaluation function? 9. When would best-first-search be worse than simple-first-search? 10. Find a good heuristic function for following (a) Monkey and anana problem 11. Give an example of an admissible heuristic for the 8-puzzle. 12. Find a good heuristic function for following. (a) Traveling Salesman problem. 13. Write four properties a good system for the knowledge representation in Particular domain should posses. 14. What are issues for knowledge representation? 15. What is inferential knowledge and procedural knowledge? Unit3 1. Write four properties a good system for the knowledge representation in Particular domain should posses. Question ank of C(C-501): rtificial Intelligence Page 2/5

2. What are issues for knowledge representation? 3. What is inferential knowledge and procedural knowledge? 4. What is Frame problem? 5. Consider the following sentences John likes all kinds of food pples are food Chicken is food nything anyone eats and isn t killed by its food ill eats peanuts and is still alive Sue eats everything ill eats. (a) Translate these sentences into formulas in predicate logic (b) Prove that John likes peanuts using backward chaining (c) Convert the formulas of part a into clause form (d) Prove that John likes peanut using resolution (e) Use resolution to answer the question, what food does Sue eat? 6. ssume the following fact: Stove only likes easy courses Sciences courses are hard ll the courses in the basket weaving department are easy K301 is a basket weaving course. Use resolution to answer the question, what course would Steve like. 7. What is wrong the following argument. Men are widely distributed over the earth. Socrates is a man. Therefore, Socrates is widely distributed over earth. How the facts represented by these sentences should be represented in logic so that this problem does not arise? 8. problem-solving search can proceed either forward (from a known start State to desired goal state) or backward (from a goal state to a start state). What factors determine the choice of direction for a particular problem? 9. Under what conditions would it make sense to use both forward and ackward chaining? Give an example where both are used. 10. Explain the difference between forward and backward chaining and Under what conditions each would be best to use for a given set of problems. 11. What are the main advantages in keeping the knowledge base separate? From the control module in knowledge-based system? 12. Give five examples of facts that are difficult to represent and manipulate in Predicate logic. 14. Difference between semantic Nets and Partitioned Nets 15.Define modues ponens. Question ank of C(C-501): rtificial Intelligence Page 3/5

Unit4 1. Defined ND/ OR graph. 2. Differentiate forward chaining and backward chaining 3. Define structural knowledge representation 4. What are semantic nets? 5. Differentiate between semantic net and partitioned semantic net 6. What is WFFS and predicate Logic? 7. Defined briefly about associative net work 8. What is difference between uniform or blind search and FS? 9. Write the algorithm or brand and bound search and give an example. 10. What is conceptual graph design a conceptual graph for following (mammal s milk? hair mouse rodent. 11. Create a frame network for a terrestrial motor vehicle (car, truck, motorcycle) nd give one complete phrame in details for cars which includes the slots for main component parts,their attributes, their relationship etween parts 12. What is different type of learning? 13. How is machine learning distinguished from general knowledge acquisition? Explain why some editors can be distinguished as intelligent 14. Which searching algorithms is best among the following and why. (FS, DFS, est first search, hill climbing). 15. Where is State-Space problem is most suitable. Give an example. Unit 5 1. What characteristic feature of Expert system? 2. Write importance of Expert System. 3. Explain the production system inference cycle. 4. What is CSNET? What are its different knowledge types? 5. What is PIP? 6. Explain lackboard System rchitecture. 7. How knowledge can be structured in a top-to-bottom manner? Explain with example. 8. What is the feature & capabilities developer should offer in expert system? 9. What are KEC, OPS5 and Radian Rule Master? 10. How do rules in PROLOG differ from general production system rules? 11. Why is it important that an expert system be able to explains the why and how questions related to a problem solving session? 12. Give the advantages of expert system architecture based on decision tress over those of production rules. What are the main disadvantages? 13. Give three examples of applications for which the use of analogical rchitecture would be suitable in expert system. Question ank of C(C-501): rtificial Intelligence Page 4/5

14. Explain how uncertainty is propagated through a chain rules during a consultation with an expert system which is based on the MYCIN architecture. 15. Select a problem domain that requires some special expertise and consult with an expert in the domain to learn how he or she solves typical problems. fter collecting enough knowledge to solve a small subset of problems. Create Rules which could be used in a knowledge base to solve the problems. Test the Use of the rules on a few problems which have been suggested by the expert and Then get his or her confirmation. Question ank of C(C-501): rtificial Intelligence Page 5/5