Master this deck with 31 terms through effective study methods.
Generated from uploaded pdf
Artificial Intelligence (AI) is the simulation of human intelligence processes by machines, especially computer systems. It encompasses learning, reasoning, and self-correction. The primary goals of AI include problem-solving, understanding natural language, and perception.
An intelligent agent is an entity that perceives its environment and takes actions to achieve specific goals. It can be a software program or a physical robot. Intelligent agents can adapt their behavior based on their experiences.
In AI, an environment refers to the external context in which an intelligent agent operates. It includes everything the agent can sense and interact with. The environment can be static or dynamic, deterministic or stochastic.
Rationality in AI refers to the ability of an agent to act in a way that maximizes its expected performance based on its knowledge. A rational agent chooses actions that are expected to lead to the best outcomes.
A knowledge-based agent is an intelligent agent that uses a knowledge base to make decisions. It applies reasoning to its knowledge to derive conclusions and make informed choices in its environment.
The Wumpus World is a classic example used in AI to illustrate problem-solving and knowledge-based agents. It is a grid-based environment where an agent must navigate to find gold while avoiding a monster called the Wumpus.
A problem-solving agent is an intelligent agent that takes actions to achieve specific goals by solving problems. It uses search techniques and algorithms to find solutions in a given environment.
Uninformed search refers to search strategies that do not have any additional information about the goal's location. Examples include Breadth-First Search (BFS) and Depth-First Search (DFS), which explore the search space without heuristics.
Breadth-First Search (BFS) is an uninformed search algorithm that explores all the nodes at the present depth level before moving on to nodes at the next depth level. It uses a queue to keep track of nodes to be explored.
Depth-First Search (DFS) is an uninformed search algorithm that explores as far as possible along each branch before backtracking. It uses a stack to keep track of nodes, which can be implemented using recursion.
Heuristic search refers to search strategies that use heuristics or rules of thumb to guide the search process. These heuristics help in estimating the cost to reach the goal, making the search more efficient.
A* search is an informed search algorithm that combines the benefits of both uniform-cost search and greedy search. It uses a heuristic to estimate the cost from the current node to the goal, allowing it to find the shortest path efficiently.
The minimax algorithm is a decision-making algorithm used in two-player zero-sum games. It minimizes the possible loss for a worst-case scenario while maximizing the potential gain, effectively determining the best move for a player.
Alpha-beta pruning is an optimization technique for the minimax algorithm that reduces the number of nodes evaluated in the search tree. It eliminates branches that cannot possibly influence the final decision, improving efficiency.
A Constraint Satisfaction Problem (CSP) is a mathematical problem defined as a set of objects whose state must satisfy several constraints and conditions. Examples include scheduling problems and the classic N-Queens problem.
Breadth First Search (BFS) explores all the nodes at the present depth level before moving on to nodes at the next depth level. It guarantees the shortest path in an unweighted graph and is implemented using a queue.
Depth First Search (DFS) explores as far as possible along each branch before backtracking. It is memory efficient and can be implemented using recursion or a stack, but it does not guarantee the shortest path.
Iterative Deepening Search combines the space efficiency of DFS with the completeness of BFS. It repeatedly applies depth-limited search with increasing depth limits until the goal is found.
Best First Search is an informed search algorithm that selects the most promising node based on a heuristic evaluation function. It prioritizes nodes that appear to be closer to the goal, improving search efficiency.
The Minimax algorithm is used in decision-making and game theory to minimize the possible loss for a worst-case scenario. It evaluates the game tree and selects the optimal move for a player, assuming the opponent plays optimally.
Backtracking search for Constraint Satisfaction Problems (CSPs) involves assigning values to variables and checking for constraints. If a constraint is violated, the algorithm backtracks to the previous variable and tries a different value.
BFS explores all nodes at the present depth before moving deeper, ensuring the shortest path in unweighted graphs, while DFS goes deep into a branch before backtracking. BFS uses more memory than DFS, which is more space-efficient.
A* search algorithm uses a heuristic to estimate the cost from the current node to the goal, combining it with the cost to reach the current node. For example, in a pathfinding scenario, it evaluates nodes based on both distance traveled and estimated distance to the goal.
Propositional logic is a branch of logic that deals with propositions, which are statements that can be either true or false. It uses logical connectives like AND, OR, and NOT to form complex expressions.
First-order predicate logic extends propositional logic by including quantifiers and predicates, allowing for more expressive statements about objects and their properties. It can represent relationships and functions.
Inference is the process of deriving logical conclusions from premises known or assumed to be true. In AI, inference mechanisms are used to draw conclusions from knowledge bases.
Unification is a process in logic and AI that makes two different logical expressions identical by finding a substitution for their variables. It is a key operation in automated theorem proving and logic programming.
Resolution is a rule of inference used in propositional and predicate logic to derive a conclusion from a set of premises. It involves combining two clauses to produce a new clause, facilitating automated reasoning.
Forward chaining is a data-driven inference technique that starts with known facts and applies inference rules to extract more data until a goal is reached. It is commonly used in expert systems.
Backward chaining is a goal-driven inference technique that starts with a goal and works backward to determine what facts must be true to achieve that goal. It is often used in rule-based systems.
Fuzzy logic is a form of many-valued logic that deals with reasoning that is approximate rather than fixed and exact. It is used in AI to handle the concept of partial truth, where the truth value may range between completely true and completely false.