Which of the following is not a component of the classic Planning Definition?
Domain
In classical planning (Russell and Norvig, the PDDL / STRIPS style of representation), a planning problem is written down with a small fixed set of schemas: the initial state, the goal, and the action schemas that transform one state into another.
Init — a conjunction of ground fluents describing the initial state of the world, e.g. Init(At(C1, SFO) ∧ Plane(P1)).
Goal — a conjunction of literals that a final state must satisfy, e.g. Goal(At(C1, JFK)).
Action — each action schema is given by its name and parameters, a precondition (what must hold before it can be applied) and an effect (the add and delete lists that change the state).
A planner searches the state space, starting from Init, applying Actions whose preconditions hold, until a state that satisfies Goal is reached. Domain is only a general word for the problem area; it is not one of the components in the classic planning definition, so it is the item that does not belong.
Domain option is correct.
Similar Questions
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.
Important Questions from Approaches to AI
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 __________.
