Intelligent Systems Quiz 1-12

Select the sentence that is in the Conjunctive Normal Form (CNF). + (x∨¬y)∧(¬z)∧(y∨¬z) + x⇒(¬y∨z) + (x⇒y)∨(z∧¬x) + x∧¬y∨z

+ (x∨¬y)∧(¬z)∧(y∨¬z)

Select the contraposition equivalence. + (α∧β)≡(β∧α) + (α⇒β)≡(¬β⇒¬α) + (α∨β)≡(β∨α) + (α⇒β)≡(¬α∨β)

+ (α⇒β)≡(¬β⇒¬α)

Given the following game tree, what would be the utility value for the node A? Does not transfer to Quiz well. + 9 + 5 + 3 + 1

+ 5

This is the solution to a problem where the environment is either partially observable or non-deterministic (or both), + A contingency plan (strategy). + A sequence of states. + A belief state. + A final state.

+ A contingency plan (strategy).

Select the statement that is not true. + A knowledge-based agent stores sentences and inferences in databases. + Intelligent agents need knowledge about the world in order to reach good decisions. + A knowledge-based agent is composed of a knowledge base and an inference mechanism. + Knowledge is contained in agents in the form of sentences in a knowledge representation language that are stored in a knowledge base.

+ A knowledge-based agent stores sentences and inferences in databases.

The relationship of entailment between sentences is crucial to our understanding of reasoning. Select the correct definition of entailment. + A sentence α entails another sentence β if β is false in all worlds where α is true. + A sentence α entails another sentence β if β is exactly the same as α. + A sentence α entails another sentence β if β is true in all worlds where α is true. + A sentence α entails another sentence β if β is true in all worlds where α is false.

+ A sentence α entails another sentence β if β is true in all worlds where α is true.

These are the four categories of the Artificial Intelligence definition. + Acting humanly, Thinking humanly, Acting rationally, Thinking rationally. + Acting humanly, Thinking humanly, Acting ethically, Thinking ethically. + Acting ethically, Thinking ethically, Acting rationally, Thinking rationally. + Acting, learning, thinking and reasoning like humans.

+ Acting humanly, Thinking humanly, Acting rationally, Thinking rationally.

In our course we will consider the following Artificial Intelligence definition: + Acting rationally. + Thinking ethically. + Thinking humanly. + Acting humanly.

+ Acting rationally.

Select the statement that is NOT correct + An agent program runs on the physical architecture to implement the agent function. + Percepts are agent's perceptual inputs at any given instant. + Agent actions depend only on information that are not percepts. + A percept sequence is a complete history of everything the agent has perceived.

+ Agent actions depend only on information that are not percepts.

Select what is NOT a characteristic of an agent. + Agents operate autonomously. + An agent is an entity that perceives and acts. + Agents persist over prolonged time periods. + Agents are simple computer programs.

+ Agents are simple computer programs.

Which of the following statements is NOT correct? + A path through the state space from the initial state to a goal state is a solution. + An agent can start searching for solutions even if the problem is not well defined. + A goal test function is an element that defines formally a search problem. + The environment of the problem is represented by a state space.

+ An agent can start searching for solutions even if the problem is not well defined.

What is an agent? + An agent is something that thinks like human. + An agent is something that perceives and acts in an environment. + An agent is something that moves objects. + An agent is a computer program.

+ An agent is something that perceives and acts in an environment.

Select the statement that is NOT correct. + Artificial Intelligence has not been used for proving mathematical theorems. + Artificial Intelligence (AI) is a relatively new field of study (1956). + Artificial Intelligence is a wide area with many sub-fields. + Artificial Intelligence is a very active research area with applications to a variety of problems.

+ Artificial Intelligence has not been used for proving mathematical theorems.

A(an) ________________________ is formed from a predicate symbol optionally followed by a parenthesized list of terms. + Term + Connective + Interpretation + Atomic sentence

+ Atomic sentence

Select what is NOT a characteristic of Logic Programming. + Avoids closed-world assumption. + Uses depth-first, left-to-right backward chaining. + Efficient unification by open coding. + Efficient retrieval of matching clauses by direct linking.

+ Avoids closed-world assumption.

Select a sentence which is not derived from other sentences. + Entailed sentence. + Sentence beta β + Axiom. + Sentence alpha α

+ Axiom.

The following form of depth-first search, is commonly used for solving CSPs. + Greedy best-first search. + Backtracking search. + Adversarial search. + Bread-first search.

+ Backtracking search.

This method expands the shallowest nodes first; it is complete, optimal for unit step costs, but has exponential space complexity. + Breadth-first search. + Iterative deepening search. + Uniform-cost search. + Depth-first search.

+ Breadth-first search.

Stochastic game trees include the following nodes besides the MAX and MIN nodes. + Chance nodes. + Expected nodes. + Deterministic nodes. + Prune nodes.

+ Chance nodes.

Select the crucial property common to all CSP's. + Closure Property. + Additive Identity Property. + Commutative Property. + Associative Property.

+ Commutative Property.

Which field of study deals with answering the question: How can artifacts operate under their own control? + Linguistics + Control Theory + Statistics + Mechanics

+ Control Theory

In games with imperfect real-time decisions, select the function that returns an estimate of the expected utility of the game from a given position. + Real-time function + Piece-wise function + Continuous function + Evaluation function

+ Evaluation function

Select the characteristic that is NOT required for a good evaluation function. + The function computation should be fast. + For internal states, the function should have random values. + The function should order the terminal states like a true utility function. + For non-terminal states, the function should be strongly correlated with the actual chances of winning.

+ For internal states, the function should have random values.

The following lifted version of Modus Ponens uses unification to provide a natural and powerful inference rule. + Generalized Modus Ponens. + Modus Ponens Plus. + Lifted Modus Ponens + Unified Modus Ponens

+ Generalized Modus Ponens.

This method is a type of stochastic hill-climbing search in which a large population of states is maintained. New states are generated by mutation and by crossover, which combines pairs of states from the population. + Hill climbing with restart. + Local beam search. + Genetic algorithm. + Simulated annealing.

+ Genetic algorithm.

This algorithm avoids consideration of redundant paths. + Graph-Search algorithm. + Iterative-Search algorithm. + Reduced-Search algorithm. + Tree-Search algorithm.

+ Graph-Search algorithm.

Select the method, which is NOT a local search method. + Simulated annealing. + Hill climbing. + Greedy best-first search. + Hill climbing with random restart.

+ Greedy best-first search.

What is the result of applying existential instantiation to ∃y Hat(y) ∧ OnHead(y,Richard) + ∃C2 Hat(C2) ∧ OnHead(C2,Richard) + ∀y Hat(y) ∨ OnHead(y,Richard) + ∃y Hat(y) ∨ OnHead(y,Richard) + Hat(C1) ∧ OnHead(C1,Richard)

+ Hat(C1) ∧ OnHead(C1,Richard)

These methods may have access to a heuristic function h(n) that estimates the cost of a solution from n. + Uniform-cost search methods. + Informed search methods. + Uninformed search methods. + Functional search methods.

+ Informed search methods.

What is not true regarding a representation language? + It is defined by its syntax, which specifies the structure of sentences. + It contains a definite number of sentences. + Each sentence represents some assertion about the world. + It is defined by its semantics, which defines the truth of each sentence in each possible world or model.

+ It contains a definite number of sentences.

Select the best description of Problem Formulation. + It is a process of describing all the constraints of the problem given a goal. + It is the process of deciding what actions and states to consider, given a goal. + It is the process to select a problem that has a goal. + It is the process of finding a formula for the given goal.

+ It is a process of describing all the constraints of the problem given a goal.

This method calls depth-first search with increasing depth limits until a goal is found. + Depth-first search. + Depth-limited search. + Bidirectional search. + Iterative deepening search.

+ Iterative deepening search.

This method calls depth-first search with increasing depth limits until a goal is found. + Depth-limited search. + Bidirectional search. + Depth-first search. + Iterative deepening search.

+ Iterative deepening search.

Select the best Uninformed Search Strategy for solving problems with large state spaces and the depth of the solution is not known. + Iterative deepening. + Depth-limited. + Uniform cost. + Breadth-first.

+ Iterative deepening.

This method is a local search method applied to problems in continuous spaces. + Genetic algorithm. + Linear programming. + Hill climbing. + Simulated annealing.

+ Linear programming.

In two-player zero-sum games with perfect information, this algorithm can select optimal moves by a depth-first enumeration of the game tree. + Simulated annealing. + Hill climbing. + Genetic algorithm. + Mini-max algorithm.

+ Mini-max algorithm.

They discovered some facts about how the brain works and the ways in which it is similar to and different from computers. + Psychologists + Neuroscientists + Biologists + Philosophers

+ Neuroscientists

Select what is TRUE about constraint graphs. + Nodes are variables and arcs are constraints. + Nodes are constraints and arcs are variables. + Nodes are domains and arcs are the variables. + Nodes are variables and arcs are domains.

+ Nodes are variables and arcs are constraints.

In first-order logic, what is not a knowledge representation language. + Compositional. + Non expressive. + Context independent. + Declarative.

+ Non expressive.

In these environments, agents can apply AND-OR search to generate contingent plans that reach the goal regardless of which outcomes occur during execution. + Non-deterministic environments. + Static environments. + Deterministic environments. + Non-static environments.

+ Non-deterministic environments.

How is calculated the node values in a stochastic game tree? + Obtaining the average over all possible outcomes of the MAX nodes. + Obtaining the average over all possible outcomes of the chance nodes. + Obtaining the average over all possible outcomes of the MAX and MIN nodes. + Obtaining the mean value of all possible outcomes of the chance nodes.

+ Obtaining the average over all possible outcomes of the chance nodes.

Which statement is NOT correct? + Only goal-based agents can improve their performance through learning. + Utility-based agents try to maximize their own expected "happiness." + The appropriate design of the agent program depends on the nature of the environment. + The agent program implements the agent function.

+ Only goal-based agents can improve their performance through learning.

They made AI conceivable by considering the ideas that the mind is in some ways like a machine, that it operates on knowledge encoded in some internal language, and that thought can be used to choose what actions to take. + Logicians + Mathematicians + Philosophers + Economists

+ Philosophers

The basic syntax of the first-order logic represents relations using ______________________. + Operators. + Constant symbols. + Predicate symbols. + Function symbols.

+ Predicate symbols.

Select the statement which is false. + Proofs are patterns of sound inference that can be used to find inference rules. + Inference rules are patterns of sound inference that can be used to find proofs. + The resolution rule yields a complete inference algorithm for knowledge bases that are expressed in conjunctive normal form. + Forward chaining and backward chaining are very natural reasoning algorithms for knowledge bases in Horn form.

+ Proofs are patterns of sound inference that can be used to find inference rules.

In models of first-order logic there are unary relations which represents _________________. + Values. + Objects. + Properties. + Operators.

+ Properties.

In first-order logic we express properties of entire collections of objects, instead of enumerating the objects by name, using __________________________. + Connectives. + Quantifiers. + Terms + Sentences.

+ Quantifiers.

Select the step that is NOT part of the Genetic Algorithm. + Selection + Cross-over + Mutation + Recombination

+ Recombination

Select what is not correct about Constraint Satisfaction Problems (CSP). + Represent the conditions for a solution by a set of constraints on the variables. + Represent a state with a set of variable/value pairs. + Represent variables with only two possible values. + Its solution is an assignment to all variables which don't conflict with the constraints.

+ Represent variables with only two possible values.

Select the area whose problems CANNOT be formulated as convex optimization problems. + Control Theory + Route-finding + Linear Programming + Machine Learning

+ Route-finding

Given the following sentence select the statement that is correct. S1⇒S2 + S2 is called antecedent. + S1 is called conclusion. + the statement is a conjunction. + S1 is called premise.

+ S1 is called premise.

Select what is NOT a property of a task environment. + Semiflexible. + Semidynamic. + Fully observable. + Stochastic.

+ Semiflexible.

Select the best description for the Frontier of a Search Tree. + It is the maximum depth of the Search Tree. + The set of all nodes already expanded. + The level of the tree at which the solution node is found. + Set of all leaf nodes available for expansion at any given point.

+ Set of all leaf nodes available for expansion at any given point.

This is an stochastic algorithm which returns optimal solutions when given an appropriate cooling schedule. + Simulated annealing. + Hill climbing. + Genetic algorithm. + Local beam search.

+ Simulated annealing.

Existential instantiation is a particular case of a general process called _____________________. + Universalization + Skolemization + Inference + Substitution

+ Skolemization

Select the space that is searched when we solve sensorless problems. + Space of belief states. + Space of the goal states. + Space of the root state. + Space of the visible states.

+ Space of belief states.

In Constraint Satisfaction Problems how states are defined? + States are assignments of values to some or all of the variables. + States are the set of variables. + States are the set of constraints. + States are relations between variables.

+ States are assignments of values to some or all of the variables.

Which statement is NOT correct? + Task environments can be rigid or flexible. + Task environments can be single-agent or multi-agent. + In designing an agent, the first step must always be to specify the task environment as fully as possible. + Task environments vary along several significant dimensions.

+ Task environments can be rigid or flexible.

In partially observable games, select what is the set of all logically possible board states given the complete history of percepts to date. + The strategy state. + Set of the leaf states. + The belief state. + The chances state.

+ The belief state.

What is the test that determines whether a given state is a goal state. + The performance test. + The solution test. + The goal test. + The verification test.

+ The goal test.

Select the statement that is NOT true. + The history of AI has had systematic continuous optimism, enthusiasm and funding. + Economists formalized the problem of making decisions that maximize the expected outcome to the decision maker. + Control theory deals with designing devices that act optimally on the basis of feedback from the environment. + Mathematicians set the groundwork for understanding computation and reasoning about algorithms.

+ The history of AI has had systematic continuous optimism, enthusiasm and funding.

Select the statement that IS correct. + The performance measure calculates how long the agent should act. + The performance measure evaluates how complex is the environment. + The performance measure always takes values between 0 and 1. + The performance measure evaluates the behavior of the agent in an environment.

+ The performance measure evaluates the behavior of the agent in an environment.

Select the problem that CANNOT be solved by a Search Method. + The root finding problem. + Robot Navigation. + The traveling salesperson problem. + The touring problem.

+ The root finding problem.

In this process the agent can construct sequences of actions that achieve its goals, provided that the environment is deterministic, observable, static, and completely known. + The sort process. + The traveling process. + The search process. + The goal process..

+ The search process.

Select the evaluation function that computes separate numerical contributions from each feature and then combines them. + The combination function. + The weighted linear function. + The quadratic function. + The gather function.

+ The weighted linear function.

Given the following set of variables X = {x1, x2, x3, x4} where xi is the number of personnel assigned to task i. The Domain is Di={4, 5, 6, 7}. If the constraint is that no more than 15 personnel can be assigned total. Select the best inference for this problem. + The domain is reduced toDi={5, 6} + There is no solution. + The domain is reduced to Di={4, 5, 6} + The domain is reduced toDi={5, 6, 7}

+ There is no solution.

In Constraint Satisfaction Problems (CSP) a number of inference techniques use the constraints to infer which variable/value pairs are consistent and which are not. Select which is not an inference technique. + Tree consistency. + Node consistency. + Arc consistency. + k-consistency.

+ Tree consistency.

Select the statement that is false. + Local search using the min-conflicts heuristic has also been applied to constraint satisfaction problems with great success. + Tree decomposition techniques are never used for transforming CSP. + In a CSP, the least-constraining-value heuristic helps in deciding which value to try first for a given variable. + In a CSP, the conflict-directed backjumping backtracks directly to the source of the problem.

+ Tree decomposition techniques are never used for transforming CSP.

The following test was designed to provide a satisfactory operational definition of intelligence. + Intelligence Test + Turing Test + IQ Test. + Control Test

+ Turing Test

Select what is the process of finding substitutions that make different logical expressions look identical. It is required for lifted inference rules. + Skolemization + Unification + Universalization + Generalization

+ Unification

What is NOT true regarding to the alpha-beta search algorithm? + Uses a breath-first enumeration of the tree. + It computes the same optimal move as mini-max, + It achieves much greater efficiency than mini-max alone. + It eliminates sub-trees that are provably irrelevant.

+ Uses a breath-first enumeration of the tree.

Select the correct sentence. + While first-order logic commits only to the existence of facts, propositional logic commits to the existence of objects and relations. + While propositional logic commits only to the existence of facts, first-order logic commits to the existence of objects and relations. + Propositional logic and first-order logic both commit only to facts. + Propositional logic and first-order logic both commit only to the existence of objects and relations.

+ While propositional logic commits only to the existence of facts, first-order logic commits to the existence of objects and relations.

"It is a disjunction of literals of which at most one is positive" is the definition of ___________________________. + a tautological clause. + a Horn clause. + a definite clause. + a valid clause.

+ a Horn clause.

In games with imperfect real-time decisions we replace the utility function with _________________. + a function generates expected values. + a recursive evaluation function. + a symmetric evaluation function. + a heuristic evaluation function.

+ a heuristic evaluation function.

An agent that responds directly to percepts is + a model-based reflex agent. + a goal-based agent. + an utility-based agent. + a simple reflex agent.

+ a simple reflex agent.

In a constraint satisfaction problem (CSP), a global constraint involves __________________. + one variable. + one variable. + an arbitrary number of variables but not necessarily all variables. + an arbitrary number of values but not necessarily all values.

+ an arbitrary number of variables but not necessarily all variables.

Select one important higher-order constraint in a constraint satisfaction problem. + unary constraint. + binary constraint. + hyper constraint. + atmost constraint.

+ atmost constraint.

When the environment is partially observable, this state represents the set of possible states that the agent might be in. + belief state. + multi-state. + chance state. + global state.

+ belief state.

An upper ontology is based on the following + objectives and the event calculus. + objectives and the integral calculus. + categories and the event calculus. + categories and the differential calculus.

+ categories and the event calculus.

What is not required in developing a knowledge base in first-order logic? + careful process of analyzing the domain. + encoding the axioms required to support the desired inferences. + classifying and organizing all sentences. + choosing a vocabulary.

+ classifying and organizing all sentences.

An inference algorithm is sound if it _______________________________________. + connects all the sentences in the knowledge base. + can derive any sentence that is entailed. + entails sentences faster than other algorithms. + derives only entailed sentences.

+ derives only entailed sentences.

If the sentence P⇒Q is false and P is true, what is the logical value of Q? + false + It is not possible to determine. + either true or false + true

+ false

Large-scale knowledge representation requires ........... + general-purpose ontology. + domain-specific ontology. + small-size ontology. + basic ontology.

+ general-purpose ontology.

The use of unification to identify appropriate substitutions for variables, has the following characteristics except + is a key component of all first-order inference algorithms. + eliminates the instantiation step in first-order proofs. + makes the process more efficient in many cases. + increases the number of steps for producing inferences.

+ increases the number of steps for producing inferences.

Backward chaining suffers from redundant inferences and infinite loops; these can be alleviated by + compilation. + logic regression. + memoization. + algorithmic memory.

+ memoization.

The Alpha-Beta search is highly dependent on the _____________________________. + minimax values of the root node. + order in which the states are examined. + number of leaf nodes. + branching factor of the tree.

+ order in which the states are examined.

The syntax of first-order logic builds on that of propositional logic. The following are what it adds except + terms to represent objects. + patterns of behavior. + universal quantifiers. + existential quantifiers.

+ patterns of behavior.

Which of the following is NOT included in a task environment specification? + actuators. + performance measure. + programs. + external environment.

+ programs.

Actions, events, and time can be represented in + integral calculus or differential calculus. + situation calculus or event calculus. + situation calculus or differential calculus. + integral calculus or event calculus.

+ situation calculus or event calculus.

An agent function... : + activates the agent behavior. + moves objects based on percepts. + specifies the action taken by the agent in response to any percept sequence. + replaces actions by percepts.

+ specifies the action taken by the agent in response to any percept sequence.

Ideally, an intelligent agent + takes the best possible action in a situation. + thinks like a human. + takes an action ignoring the environment. + acts quickly and then evaluates the action.

+ takes the best possible action in a situation.

Which of the following is NOT part of a game definition? + a terminal test. + the initial state. + the belief state. + the legal actions.

+ the belief state.

A rational agent chooses whichever action that maximizes __________________________. + the expected value of the performance measure given the percept sequence to date. + the percept value given the performance measure. + the number of percepts given the expected value of the performance measure. + the expected value of the actions given the percept sequence to date.

+ the expected value of the performance measure given the percept sequence to date.

Which of the following is NOT a component that define a problem formally. + a transition model. + the initial state. + set of actions. + the size of the environment.

+ the size of the environment.

These inference rule(s) are used in logical inference in first-order logic to propositionalize the inference problem. + formal and classical instantiation. + only universal instantiation. + universal instantiation and existential instantiation. + only existential instantiation.

+ universal instantiation and existential instantiation.

When we extend the idea of the minimax algorithm to multiplayer games, the minimax value for each node will be changed to ________________________________. + an evaluation value. + vector of values. + 2 utility values. + the alpha and beta values.

+ vector of values.

Select the tautology. + ¬A + ¬A∨A + A⇒B + False

+ ¬A∨A

What is the first-order logic representation of the following sentence: "Everyone loves somebody" + ∀x Loves(x,y) + ∃y Loves(x,y) + ∀x ∀y Loves(x,y) + ∀x ∃y Loves(x,y)

+ ∀x ∃y Loves(x,y)