Professional Documents
Culture Documents
Neural networks are also ideally suited to help people solve complex problems in real-life situations.
They can learn and model the relationships between inputs and outputs that are nonlinear and complex;
make generalizations and inferences; reveal hidden relationships, patterns and predictions; and model
highly volatile data (such as financial time series data) and variances needed to predict rare events (such
as fraud detection). As a result, neural networks can improve decision processes in areas such as:
Such agents are also known as Rational Agents. The rationality of the agent is measured by its
performance measure, the prior knowledge it has, the environment it can perceive and actions it can
perform.
An ideal rational agent is the one, which is capable of doing expected actions to maximize its
performance measure, on the basis of −
A rational agent always performs right action, where the right action means the action that causes the
agent to be most successful in the given percept sequence. The problem the agent solves is
characterized by Performance Measure, Environment, Actuators, and Sensors (PEAS).
Rule-based systems are used as a way to store and manipulate knowledge to interpret information
in a useful way. Often used in artificial intelligence applications and research.
Rule based system or knowledge based systems are specialized software that encapsulate ‘Human
Intelligence’ like knowledge there by make intelligent decisions quickly and in repeatable form.
What are various issues in knowledge representation?
5) Write the time & space complexity associated with depth limited search?
To solve the problem of DFS getting stuck in a search tree with infinite depth, depth-
limited search restricts the depth of the tree to a predetermined depth limit l. Time
complexity is O(b^l), and space complexity is O(bm) (It is same as DFS, only with
restricted depth to l).
6) What are the limitations of propositional logic to represent the knowledge base?
o We cannot represent relations like ALL, some, or none with propositional logic.
Example:
Some other applications of Backward Chaining include automated theorem proving tools,
inference engines, proof assistants and other artificial intelligence applications.
Steps of working for Backward Chaining
Step 1. In the first step, we’ll take the Goal Fact and from the goal fact, we’ll derive other facts
that we’ll prove true.
Step 2: We’ll derive other facts from goal facts that satisfy the rules
Step 3: At step-3, we will extract further fact which infers from facts inferred in step 2.
Step 4: We’ll repeat the same until we get to a certain fact that satisfies the conditions.
Let’s take the same example as taken in Forward Chaining, to prove this time that Robert is the
criminal.
Step 1:
In the first step, we’ll take the Goal Fact and from the goal fact, we’ll derive other facts that
we’ll prove true.