Artificial Intelligence

In the context of AI and information theory, intelligence is defined as the ability to apply knowledge to solve problems, which is a higher level than mere data or information.

A control strategy in AI or robotics is fundamentally designed to initiate or manage action, making 'it causes motion' the primary requirement for a system to be considered active or controlled.

Depth-First Search (DFS) is a classic algorithm that traverses tree or graph structures by going as deep as possible before backtracking, which is naturally implemented using recursion.

Artificial Intelligence is a subfield of computer science focused on creating systems capable of performing tasks that typically require human intelligence.

Search provides the fundamental framework for exploring state spaces to find solutions. It defines how to move from an initial state to a goal state using operators.

A commutative production system is both monotonic (the number of facts never decreases) and partially commutative (the order of rule application doesn't affect the final state). The question uses confusing numbering but expects both properties to be selected.

Breadth-First Search (BFS) must store all nodes at the current depth level in the queue, which leads to exponential memory usage as the search tree grows. Depth-First Search (DFS) only needs to store the current path, making it more memory-efficient.

Cryptarithmetic is a type of mathematical puzzle where digits are replaced by letters, and the goal is to find the digit associated with each letter to satisfy the arithmetic equation.

Heuristics are rules of thumb or informed guesses that guide the search process toward promising states, significantly reducing the number of nodes explored compared to blind search.

In optimization and search, the heuristic function is often referred to as the objective function because it defines the goal or the 'cost' that the algorithm aims to minimize or maximize.

Hill climbing is a form of generate and test where the next move is chosen based on the feedback (evaluation) of the current state relative to the goal, allowing it to improve its path iteratively.

Steepest-Ascent Hill-Climbing evaluates all possible successors of the current state and chooses the one that provides the greatest improvement, rather than just taking the first better move found.

A* is a classic informed search algorithm that uses a heuristic function to guide a Best-First Search, balancing the cost from the start and the estimated cost to the goal.

AND-OR graphs are used to represent problems that can be decomposed into subproblems. An AND node represents a decomposition into multiple subproblems that must all be solved, while an OR node represents alternative ways to solve a problem.

Best-First Search combines the benefits of BFS (exploring nodes) and DFS (going deep into promising paths) by using a heuristic to prioritize which node to expand next.

Constraint satisfaction problems involve finding values for variables that satisfy a set of constraints, operating within a space defined by those constraints.

Representational adequacy refers to the ability of a knowledge representation system to capture all the necessary information and nuances required for a specific problem domain.

Cryptarithmetic puzzles require assigning digits to letters such that the arithmetic holds true, which is a classic example of a constraint satisfaction problem where each letter is a variable with constraints on its possible values.

The AO* algorithm is designed to search AND-OR graphs, which are used for problem reduction, where a complex problem is broken down into smaller, simpler subproblems.

In propositional logic, the basic units of representation are propositions, which are statements that are either true or false.

Resolution is a rule of inference used in automated theorem proving that works by showing that the negation of the goal leads to a contradiction, thus proving the goal by refutation.

In predicate logic, facts are represented as statements (often involving predicates, variables, and quantifiers) that describe relationships between objects.

In the sentence 'John spotted Sue', John is the subject performing the action, making him the agent.

Means-ends analysis is a problem-solving strategy that compares the current state to the goal state and identifies the differences, working both forward from the current state and backward from the goal to bridge the gap.

The knowledge level, as defined by Allen Newell, is the level of abstraction where we describe a system in terms of its knowledge (facts) and goals, independent of how that knowledge is implemented.

Forward reasoning (or data-driven reasoning) starts from the known facts (the start state) and applies rules to derive new facts until the goal state is reached.

Strong slot-and-filler structures (like scripts or frames) are considered 'strong' because they contain domain-specific knowledge that provides a detailed context for understanding or processing information.

De Morgan's Law states that the negation of a conjunction (AND) is the disjunction (OR) of the negations. Specifically, NOT (A AND B) = (NOT A) OR (NOT B).

De Morgan's laws state that the negation of a conjunction is the disjunction of the negations, and the negation of a disjunction is the conjunction of the negations. Specifically, NOT (A AND B) = (NOT A) OR (NOT B). The provided options use symbols for logical operators, and option B correctly reflects the distribution of the negation operator.

Frames are considered weak slot-and-filler structures because they provide a general framework for representing knowledge about objects or concepts without enforcing strict procedural constraints. Conceptual dependency and scripts are typically classified as strong slot-and-filler structures.

Conceptual dependency is a strong slot-and-filler structure because it provides a detailed, primitive-based representation of actions and states, aiming for a deep understanding of meaning. Frames and semantic nets are generally considered weaker or more general structures.

In procedural representation, knowledge is encoded as a set of instructions or procedures to be executed. Therefore, logical assertions are viewed as programs that perform actions to solve problems.

Weak slot-and-filler structures are considered weak because they represent general knowledge that can be applied across various domains, rather than specific, highly constrained knowledge. This generality makes them flexible but less powerful for deep reasoning in specific contexts.

At the symbol level, knowledge is represented using symbols that correspond to objects, properties, and relations. These symbols are manipulated by the system to perform reasoning.

Predicate logic is a formal system used to represent facts and relationships between objects in a domain. It allows for the expression of complex statements about entities and their properties.

In declarative representation, knowledge is represented as a collection of facts or assertions. These are treated as data that can be queried or manipulated by a separate inference engine.

Slot-and-filler systems, such as frames or semantic networks, organize knowledge into entities and their associated attributes. Inheritance is facilitated by the hierarchical structure of these entities and attributes.

Backward reasoning (or backward chaining) starts from the goal state and works backward to determine the necessary conditions or sub-goals to reach that state.