Similar documents
Knowledge-Based - Systems

AQUA: An Ontology-Driven Question Answering System

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

Proof Theory for Syntacticians

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

Self Study Report Computer Science

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

CS 598 Natural Language Processing

Some Principles of Automated Natural Language Information Extraction

Machine Learning from Garden Path Sentences: The Application of Computational Linguistics

Probabilistic Latent Semantic Analysis

An Interactive Intelligent Language Tutor Over The Internet

Semi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17.

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

A Version Space Approach to Learning Context-free Grammars

Language Acquisition Fall 2010/Winter Lexical Categories. Afra Alishahi, Heiner Drenhaus

Visual CP Representation of Knowledge

Natural Language Processing. George Konidaris

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation

Version Space. Term 2012/2013 LSI - FIB. Javier Béjar cbea (LSI - FIB) Version Space Term 2012/ / 18

MYCIN. The MYCIN Task

Lecture 1: Basic Concepts of Machine Learning

Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments

Chapter 2 Rule Learning in a Nutshell

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm

Laboratorio di Intelligenza Artificiale e Robotica

Applications of memory-based natural language processing

GACE Computer Science Assessment Test at a Glance

Discriminative Learning of Beam-Search Heuristics for Planning

Grammars & Parsing, Part 1:

Evolution of Collective Commitment during Teamwork

Courses in English. Application Development Technology. Artificial Intelligence. 2017/18 Spring Semester. Database access

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

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

An Experimental Comparison of Knowledge Representation Schemes

Lecture 1: Machine Learning Basics

Compositional Semantics

Learning and Transferring Relational Instance-Based Policies

FUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria

Radius STEM Readiness TM

A Case Study: News Classification Based on Term Frequency

Parsing of part-of-speech tagged Assamese Texts

Developing True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability

Seminar - Organic Computing

University of Groningen. Systemen, planning, netwerken Bosman, Aart

Iterative Cross-Training: An Algorithm for Learning from Unlabeled Web Pages

Word Segmentation of Off-line Handwritten Documents

SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF)

Pre-Processing MRSes

Lecture 10: Reinforcement Learning

The Interface between Phrasal and Functional Constraints

Good-Enough Representations in Language Comprehension

Target Language Preposition Selection an Experiment with Transformation-Based Learning and Aligned Bilingual Data

STA 225: Introductory Statistics (CT)

Computerized Adaptive Psychological Testing A Personalisation Perspective

Laboratorio di Intelligenza Artificiale e Robotica

Generative models and adversarial training

Evolutive Neural Net Fuzzy Filtering: Basic Description

Transfer Learning Action Models by Measuring the Similarity of Different Domains

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

The 9 th International Scientific Conference elearning and software for Education Bucharest, April 25-26, / X

EXPERT SYSTEMS IN PRODUCTION MANAGEMENT. Daniel E. O'LEARY School of Business University of Southern California Los Angeles, California

Ensemble Technique Utilization for Indonesian Dependency Parser

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

Toward Probabilistic Natural Logic for Syllogistic Reasoning

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

Linking Task: Identifying authors and book titles in verbose queries

A student diagnosing and evaluation system for laboratory-based academic exercises

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

(Sub)Gradient Descent

Content Language Objectives (CLOs) August 2012, H. Butts & G. De Anda

Developing a TT-MCTAG for German with an RCG-based Parser

Switchboard Language Model Improvement with Conversational Data from Gigaword

Firms and Markets Saturdays Summer I 2014

Using computational modeling in language acquisition research

Ontologies vs. classification systems

Approaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque

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

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

Rule-based Expert Systems

Predicting Students Performance with SimStudent: Learning Cognitive Skills from Observation

Which verb classes and why? Research questions: Semantic Basis Hypothesis (SBH) What verb classes? Why the truth of the SBH matters

A Bayesian Learning Approach to Concept-Based Document Classification

A Genetic Irrational Belief System

UNIVERSITY OF CALIFORNIA SANTA CRUZ TOWARDS A UNIVERSAL PARAMETRIC PLAYER MODEL

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

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

B.S/M.A in Mathematics

Math-U-See Correlation with the Common Core State Standards for Mathematical Content for Third Grade

Axiom 2013 Team Description Paper

LTAG-spinal and the Treebank

Learning Methods for Fuzzy Systems

Course Content Concepts

Innovative Methods for Teaching Engineering Courses

An Investigation into Team-Based Planning

Extending Place Value with Whole Numbers to 1,000,000

CLASSIFICATION OF PROGRAM Critical Elements Analysis 1. High Priority Items Phonemic Awareness Instruction

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

Using Web Searches on Important Words to Create Background Sets for LSI Classification

Software Maintenance

Transcription:

ANNA UNIVERSITY SUBJECT NAME : ARTIFICIAL INTELLIGENCE SUBJECT CODE : CS2351 YEAR/SEM :III / VI QUESTION BANK UNIT I PROBLEM SOLVING 1. What is Intelligence? 2. Describe the four categories under which AI is classified with examples. 3. Define Artificial Intelligence. 4. List the fields that form the basis for AI. 5. What is a Knowledge Based System? Explain. 6. List a few of the task domains of AI. 7. Describe the components of a KBS. 8. What id meta-knowledge? 9. Expand LISP and PROLOG. 10. What is a Production System? 11. Define state-space search technique. 12. List the steps in performing a state-space search. 13. What is heuristic search? 14. Differentiate Informed & Uninformed search. Give examples. 15. Define the logic behind Hill climbing, Best-First Search, BFS and DFS. 16. What do you mean by Game Playing? 17. What are the components of a Game software? 18. What is a plausible-move generator? What is its role? 19. Define alpha & beta values in a game tree. 20. Mention some of the knowledge representation techniques. 1) What are the four basic types of agent program in any intelligent system? Explain how did you convert them into learning agents?. (16) 2) Explain the following uninformed search strategies with examples. (a) Breadth First Search. (4) (b) Uniform Cost Search (4) (c) Depth First Search (4) (d) Depth Limited Search (4) 3) What is PEAS? Explain different agent types with their PEAS descriptions. (16) 4) Explain in detail the properties of Task Environments. (16) 5) Define a problem and its components. Explain how a problem solving agent works? (16) 6) Explain real-world problems with examples. (16) 7) Explain in detail with examples (i) Iterative deepening search (8) (ii) Bidirectional search (8) 8) How an algorithm s performance is evaluated? Compare different uninformed search strategies in terms of the four evaluation criteria. (16)

UNIT II LOGICAL REASONING 1. Differentiate prepositional & predicate logic. 2. What is clausal form? How is it useful? 3. Define a well-formed formula (wff). 4. List some of the rules of inference. 5. What is resolution /refutation? 6. Define unification. 7. What are semantic nets? 8. What are frames? How do they differ from semantic nets. 9. What are script? What is its use? 10. List the components of a script. 11. Mention the frame manipulation primitives. 12. Define forward and backward chaining. Differentiate the same. 13. What is means-end analysis? 14. Mention the strategies used in resolving clauses (unit-preference, set-of-support, best first) 1) What is Greedy Best First Search? Explain with an example the different stages of Greedy Best First search. (16) 2) What is A* search? Explain various stages of A* search with an example. (16) 3) Explain in detail with examples (i) Recursive Best First Search(RBFS) (8) (ii) Heuristic Functions (8) 4) Explain the following local search strategies with examples. (i) Hill climbing (4) (ii) Genetic Algorithms (4) (iii) Simulated annealing (4) (iv) Local beam search (4) 5) Define constraint satisfaction problem (CSP). How CSP is formulated as a search prob- lem? Explain with an example. (16) 6) Explain with examples (i) Constraint graph (4) (ii) Cryptarithmetic problem (4) (iii) Adversarial search problem (4) (iv) Game (4) 7) Explain with algorithm and example : i. Minimax algorithm (8) ii. Alpha-Beta Pruning (8)

UNIT III 1. Describe Bayes theorem. 2. What are the disadvantages of Closed World Assumption (CWA). How will you over-come it? 3. Define Non monotonic reasoning. 4. What are Truth Maintenance Systems? Draw its block diagram. 5. What are Bayesian networks? Give an example. 6. What is fuzzy logic? What is its use? 7. How Knowledge is represented? 8. What is propositional logic? 9. What are the elements of propositional logic? 10. What is inference? 11. What are modus ponens? 12. What is entailment? 13. What are knowledge based agents? 1) (i) Define the syntactic elements of first-order logic (8) (ii) Illustrate the use of first-order logic to represent knowledge. (8) 2) Explain the steps involved in the knowledge Engineering process. Give an example. (16) 3) Explain with an example (a) forward chaining (8) (b) Backward chaining (8) 4) Give resolution proof for example problem statement : (a) West is a criminal (8) (b) Curiosity killed the cat (8) 5) What is Ontological Engineering? Explain with the diagram the upper ontology of the world. (16) 6) How categories are useful in knowledge representation. (16) 7) What is situation calculus? Explain the ontology of situation calculus. (16) 8) What is a frame problem? (4) How do you solve the following problems in situation calculus? (a) Solving the representational frame problem (6) (b) Solving the inferential frame problem (6) 9) Write sort notes on (a) Event calculus (4) (b) Generalized events (4) (c) Intervals (4) (d) Fluents and objects (4) 10) Explain in detail the shopping agent for the Internet shopping world example. (16)

Unit IV Part A 1. Define linguistics. List the general classification of languages. 2. Construct parse trees for given sentences. 3.Waht are grammars? 4.Give the syntactic tree for the sentence The boy ate the apple. 5. List the types of grammars. 6. What is parsing? What is its importance? 7. Differentiate Top down & Bottom Up parsing, Deterministic & Non deterministic parsing,. 8. What are Recursive transition networks (RTN), Augmented Transition Networks (ATN)? 9. What is the role of semantic analysis in NLP? 10. Define Natural Language generation. 11.List any two NLP systems. 12.What is distributed reasoning? 13. What are Intelligent Agents? What are its use? 1) What are the components of agents? (16) 2) Define and explain (i) Supervised learning (6) (ii) Unsupervised learning (6) (iii) Reinforcement learning (4) 3) How hypotheses formed by pure inductive inference or induction?explain with ex - amples. (16) 4) (a) What is a decision tree? (4) b) Explain the process of inducing decision trees from examples. (6) c) Write the decision tree learning algorithm (6) 5) How the performance of a learning algorithm is assessed? Draw a learning curve for the decision tree algorithm (16) 6) Explain with an example (a) Ensemble learning (4) (b) Cumulative learning process (4) (c) Relevant based learning(rbl) (4) (d) Inductive logic programming (4) 7) What is explanation based learning? Explain in detail with an example. (16) 8) What is Inductive Logic Programming? Write FOIL algorithm for learning sets of firstorder horn clauses from example. (16) 9) Discuss on learning with hidden variables : the EM algorithm. (16) 10) What is reinforcement learning? Explain (a) Passive reinforcement learning (b) Active reinforcement learning (16)

UNIT V 1. What are Expert Systems? 2. Briefly explain the knowledge acquistion process. 3. List the characteristic features of a expert system. 4. Mention some of the key applications of ES. 5. What is learning? What are its types? 6. Define generalization. 7. Define Inductive Bias. 8. What is Explanation Based Learning? How is it useful? 1) Define the terms a) Communications (b) Speech act (c) Formal Language and (d) Grammar (16) 2) What are the component steps in communication? Explain the steps for the example sentence The wumpus is dead (16) 3) Contruct a lexicon and grammar for a small fragment of English Language. (16) 4) What is parsing? Explain in detail two parsing methods and give a trace of a bottom up parse on the string The wumpus is dead (16) 5) What is augmented grammar? Explain with examples (a) Verb sub categorization (8) (b) Semantic interpretation (8) 6) Discuss ambiguity and disambiguation. (16) 7) What is Grammar indication? Explain with an example (16) 8) Explain in detail (a) Information Retrieval (8) (b) Information Extraction (8) 9) What is machine translation? What are different types of machine translation? (16) 10) Draw the schematic of a machine translation and explain for an example problem (16)