What is the correct sequence of steps used by knowledge base designing? A. Ask questions about the intended interpretation. B. Chose task domain or world to represent. C. Select atoms to represent propositions of Interest. D. Tells the system propositions that are true in the intended interpretation/axiomatizing the domain. Choose the correct answer from the options given below:
B, C, D, A
Poole and Mackworth (Artificial Intelligence: Foundations of Computational Agents) describe how a knowledge base designer builds a propositional knowledge base: decide what to talk about, choose the vocabulary, axiomatise, and only then query.
Step 1 — Choose a task domain or world to represent (B): the part of the world the system must reason about.
Step 2 — Select atoms to represent propositions of interest (C): each atom gets a meaning in the intended interpretation.
Step 3 — Tell the system the propositions that are true in the intended interpretation (D): this is axiomatising the domain.
Step 4 — Ask questions about the intended interpretation (A): the system answers by deriving consequences of the axioms.
So the order is B, C, D, A. A, B, C, D begins with querying before any knowledge exists; C, D, A, B and D, A, B, C both pick atoms or state axioms before the domain has been chosen.
B, C, D, A option is correct.
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.
Given the following set of prolog clauses :
father(X, Y) :
parent(X, Y),
male(X),
parent(Sally, Bob),
parent(Jim, Bob),
parent(Alice, Jane),
parent(Thomas, Jane),
male(Bob),
male(Jim),
female(Salley),
female(Alice).
How many atoms are matched to the variable ‘X’ before the query
father(X, Jane) reports a Result ?
Match the following with respect to heuristic search techniques :
| List - I | List - II |
| (a) Steepest - ascent Hill Climbing | (i) Keeps track of all partial paths which can be candidate for further exploration |
| (b) Branch - and - bound | (ii) Discover problem state(s) that satisfy a set of constraints |
| (c) Constraint satisfaction | (iii) Detects difference between current state and goal state |
| (d) Means - end - analysis | (iv) Considers all moves from current state and selects best move |
Codes :
Match the following knowledge representation techniques with their applications :
| List - I | List - II |
| (a) Frames | (i) Pictorial representation of objects, their attributes and relationships |
| (b) Conceptual dependencies | (ii) To describe real world stereotype events |
| (c) Associative networks | (iii) Record like structures for grouping closely related knowledge |
| (d) Scripts | (iv) Structures and primitives to represent sentences |
Codes :
Match the following :
| List - I | List - II |
| (a) Intelligence | (i) Contextual, tacit, transfer needs learning |
| (b) Knowledge | (ii) Scattered facts, easily transferable |
| (c) Information | (iii) Judgemental |
| (d) Data | (iv) Codifiable, endorsed with relevance and purpose |
Codes :
Which of the following is false for the programming language PROLOG ?
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.
The process of removing detail from a given state representation is called ______.
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.