Artificial Intelligence Principles and Logic Systems
Search and Problem Solving in AI
1. Define AI
Artificial Intelligence (AI) is the branch of computer science that develops machines capable of performing tasks that normally require human intelligence.
2. What is an Intelligent Agent?
An Intelligent Agent is an entity that perceives its environment through sensors and acts upon it using actuators to achieve goals.
3. Define a Problem-Solving Agent.
A Problem-Solving Agent is an intelligent agent that finds a sequence of actions to reach a goal from an initial state.
4. What is a State Space?
A State Space is the collection of all possible states that can be reached from the initial state to the goal state.
5. Define BFS
Breadth-First Search (BFS) is an uninformed search algorithm that explores nodes level by level using a queue (FIFO).
6. Define DFS
Depth-First Search (DFS) is an uninformed search algorithm that explores one branch completely before backtracking using a stack (LIFO) or recursion.
7. What is Hill Climbing Search?
Hill Climbing is a heuristic local search algorithm that repeatedly moves to the neighboring state with the highest evaluation value.
8. Define Simulated Annealing.
Simulated Annealing is a heuristic search algorithm that occasionally accepts worse solutions to escape local optima.
9. What is Local Search?
Local Search is a search technique that improves the current state by exploring its neighboring states without constructing a search tree.
10. What is meant by Continuous State Space?
A Continuous State Space is a state space where variables can take any real-valued (continuous) values instead of discrete values.
Game Playing and Logic
1. Define Game Playing in AI
Game Playing is an AI technique in which an agent selects the best move to achieve victory against an opponent.
2. What is the Minimax Algorithm?
The Minimax Algorithm is a decision-making algorithm used in two-player games to maximize a player’s gain while minimizing the opponent’s gain.
3. Define Alpha-Beta Pruning.
Alpha-Beta Pruning is an optimization technique for the minimax algorithm that eliminates branches that cannot affect the final decision.
4. What is a Constraint Satisfaction Problem (CSP)?
A Constraint Satisfaction Problem (CSP) is a problem of assigning values to variables while satisfying all given constraints.
5. Define Constraint Propagation.
Constraint Propagation is the process of reducing variable domains by applying constraints before or during search.
6. What is Backtracking Search?
Backtracking Search is a depth-first search algorithm that assigns values to variables and backtracks when a constraint is violated.
7. Define a Knowledge-Based Agent.
A Knowledge-Based Agent uses stored knowledge and logical inference to make intelligent decisions.
8. What is Propositional Logic?
Propositional Logic is a formal logic that represents facts using propositions connected by logical operators.
9. Define Theorem Proving.
Theorem Proving is the process of proving that a conclusion logically follows from a set of premises.
10. What is a Horn Clause?
A Horn Clause is a logical clause containing at most one positive literal.
First-Order Logic (FOL)
1. Define First-Order Logic (FOL)
First-Order Logic (FOL) is a knowledge representation language that uses predicates, variables, functions, and quantifiers to describe objects and relationships.
2. What is the Syntax of FOL?
The Syntax of FOL specifies the rules for writing valid logical expressions using constants, variables, predicates, functions, connectives, and quantifiers.
3. What is the Semantics of FOL?
Semantics of First-Order Logic (FOL) defines the meaning and truth of logical statements based on an interpretation.
4. Define Unification.
Unification is the process of finding substitutions that make two logical expressions identical.
5. What is Forward Chaining?
Forward Chaining is a data-driven inference method that starts from known facts and applies rules to derive new facts.
6. What is Backward Chaining?
Backward Chaining is a goal-driven inference method that starts with a goal and works backward to prove it using known facts.
7. What is Resolution?
Resolution is an inference rule used in logic to derive new conclusions by eliminating complementary literals.
8. Define Knowledge Engineering.
Knowledge Engineering is the process of creating, organizing, and maintaining knowledge bases for AI systems.
9. What is Ontology?
Ontology is a formal representation of concepts, relationships, and properties within a domain.
10. Categories and Objects in Knowledge Representation
Categories are classes of similar objects, while objects are individual instances belonging to those categories.
Planning in AI
1. Define Planning in AI
Planning is the process of finding a sequence of actions to achieve a goal from an initial state.
2. What is Classical Planning?
Classical Planning is planning in a fully observable, deterministic, and static environment.
3. Define State Space Search.
State Space Search is a search technique that explores all possible states to find a path from the initial state to the goal state.
4. What is a Planning Algorithm?
A Planning Algorithm is a method used to generate an action sequence that achieves a specified goal.
5. Define a Planning Graph.
A Planning Graph is a layered graph of states and actions used to find efficient plans.
6. What are Planning Approaches?
Planning Approaches are different methods used in AI planning, such as Classical Planning, Hierarchical Planning, and Planning Graphs.
7. What is Hierarchical Planning?
Hierarchical Planning is a planning method that decomposes a complex task into smaller subtasks.
8. Define Goal State.
A Goal State is the desired final state that the agent aims to achieve.
9. What is an Initial State?
An Initial State is the starting condition of a problem before any action is performed.
10. What is an Action Sequence?
An Action Sequence is an ordered list of actions that transforms the initial state into the goal state.
Uncertainty and Probability
1. What is Uncertainty in AI?
Uncertainty is the lack of complete or certain knowledge about a situation or outcome.
2. Define Probability.
Probability is the numerical measure of the likelihood of an event occurring.
3. State Bayes’ Theorem.
Bayes’ Theorem: P(A|B) = [P(B|A) × P(A)] / P(B)
4. What is Conditional Probability?
Conditional Probability is the probability of an event occurring given that another event has already occurred.
5. Define Probabilistic Reasoning.
Probabilistic Reasoning is the process of making decisions under uncertainty using probability theory.
6. What is an Uncertain Domain?
An Uncertain Domain is an environment where information is incomplete, ambiguous, or unpredictable.
7. Define Bayesian Network.
A Bayesian Network is a probabilistic graphical model that represents variables and their conditional dependencies using a Directed Acyclic Graph (DAG).
8. What is Prior Probability?
Prior Probability is the initial probability of an event before considering new evidence.
9. What is Posterior Probability?
Posterior Probability is the updated probability of an event after considering new evidence.
10. What is Probabilistic Inference?
Probabilistic Inference is the process of calculating unknown probabilities from known probabilities and observed evidence.