Showing posts with label MCSE-003. Show all posts
Showing posts with label MCSE-003. Show all posts
What are Agent?
An agent is anything that can perceive its environment through sensors and acts upon that environment through effectors.
- A human agent has sensory organs such as eyes, ears, nose, tongue and skin parallel to the sensors, and other organs such as hands, legs, mouth, for effectors.
- A robotic agent replaces cameras and infrared range finders for the sensors, and various motors and actuators for effectors.
- A software agent has encoded bit strings as its programs and actions.
The Types of Intelligent Agents
Agent’s structure can be viewed as −
- Agent = Architecture + Agent Program
- Architecture = the machinery that an agent executes on.
- Agent Program = an implementation of an agent function.
1. Simple Reflex Agents
- They choose actions only based on the current percept.
- They are rational only if a correct decision is made only on the basis of current precept.
- Their environment is completely observable.
Condition-Action Rule − It is a rule that maps a state (condition) to an action.
2. Model Based Reflex Agents
They use a model of the world to choose their actions. They maintain an internal state.
Model − The knowledge about “how the things happen in the world”.
Internal State − It is a representation of unobserved aspects of current state depending on percept history.
Updating the state requires the information about −
- How the world evolves.
- How the agent’s actions affect the world.
3. Goal Based Agents
They choose their actions in order to achieve goals. Goal-based approach is more flexible than reflex agent since the knowledge supporting a decision is explicitly modeled, thereby allowing for modifications.
Goal − It is the description of desirable situations.
4. Utility Based Agents
They choose actions based on a preference (utility) for each state. Goals are inadequate when −
- There are conflicting goals, out of which only few can be achieved.
- Goals have some uncertainty of being achieved and you need to weigh likelihood of success against the importance of a goal.
Non-monotonic Reasoning
The definite clause logic is monotonic in the sense that anything that could be concluded before a clause is added can still be concluded after it is added; adding knowledge does not reduce the set of propositions that can be derived.
A logic is non-monotonic if some conclusions can be invalidated by adding more knowledge. The logic of definite clauses with negation as failure is non-monotonic. Non-monotonic reasoning is useful for representing defaults. A default is a rule that can be used unless it overridden by an exception.
For example, to say that b is normally true if c is true, a knowledge base designer can write a rule of the form
b ←c ∧ ∼ aba.
where aba is an atom that means abnormal with respect to some aspect a. Given c, the agent can infer bunless it is told aba. Adding aba to the knowledge base can prevent the conclusion of b. Rules that imply abacan be used to prevent the default under the conditions of the body of the rule.
a) For the following fuzzy sets:
X = {x/0.7, y/0.3, z/0, u/1, v/0.4} and Y = {x/0.3, y/0.8, z/0.6,
u/0.9, v/0}
Find (i) X U Y (ii) X ∩Y’ (iii) (X U Y)’ (iv) (X ∩Y)’
(b) Write a note on Non-monotonic reasoning systems.
(c) Discuss briefly various methods/ mechanism for handling
incompleteness of a knowledge-base.
(d) Describe briefly each of the components of an expert system shell.
(e) What is an agent? Discuss briefly different (at least four) types of
agents.
X = {x/0.7, y/0.3, z/0, u/1, v/0.4} and Y = {x/0.3, y/0.8, z/0.6,
u/0.9, v/0}
Find (i) X U Y (ii) X ∩Y’ (iii) (X U Y)’ (iv) (X ∩Y)’
(b) Write a note on Non-monotonic reasoning systems.
(c) Discuss briefly various methods/ mechanism for handling
incompleteness of a knowledge-base.
(d) Describe briefly each of the components of an expert system shell.
(e) What is an agent? Discuss briefly different (at least four) types of
agents.
a) Transform the FOPL statement given below in to equivalent
conceptual graph
∀x (Has Wings(x)Λ Layseggs(x) → Bird(x))
b) Transform the following conceptual graph in to FOPL statement
[PERSONA: Anil] ←(AGENT)←[DRINK] →(OBJECT) →[Food:
Milk]→←(Instrument Glass)
(c) Give Semantic Net representation of the facts given below :
“Shobhit is a 52 year old Professor of Computer Science in a
University. The name of his wife, son and daughter are
respectively Seema, Yashasvi and Savita”.
(d) Create a frame network for terrestrial motor vehicles (cars, trucks,
motorcycles) and give one complete frame in detail for cars which
includes the slots for the main component parts, their attributes,
and relations between parts. Include an as-needed slot for the gas
of each type mileage.
conceptual graph
∀x (Has Wings(x)Λ Layseggs(x) → Bird(x))
b) Transform the following conceptual graph in to FOPL statement
[PERSONA: Anil] ←(AGENT)←[DRINK] →(OBJECT) →[Food:
Milk]→←(Instrument Glass)
(c) Give Semantic Net representation of the facts given below :
“Shobhit is a 52 year old Professor of Computer Science in a
University. The name of his wife, son and daughter are
respectively Seema, Yashasvi and Savita”.
(d) Create a frame network for terrestrial motor vehicles (cars, trucks,
motorcycles) and give one complete frame in detail for cars which
includes the slots for the main component parts, their attributes,
and relations between parts. Include an as-needed slot for the gas
of each type mileage.
How Programming Languages like C/C++/Java differs from
Programming languages used for the purpose of Artificial
intelligence viz. PROLOG, LISP. What are the additi onal
components present in LISP & PROLOG, which makes them
intelligent enough. What is the mathematical basis of PROLOG?
Which polish notation supports the LISP ? Write theFollowing
codes(provide suitable comments with code to express your logic)
(a) Write a recursive function in LISP named power that takes two
numeric arguments, n and m, that computes nth power of m (i.e.,
m
n
).
(b) Write a PROLOG programme that answers questionsabout
family members and relationships. Include predicates and rules
which define sister, brother, father, mother, grandfather, grand-child and uncle. The programme should be able to answer
queries such as the following:
? – father (X, mohit)
? – grandson (X, Y)
? – uncle (abdul, ruksana)
? – mother (mary, X)
Programming languages used for the purpose of Artificial
intelligence viz. PROLOG, LISP. What are the additi onal
components present in LISP & PROLOG, which makes them
intelligent enough. What is the mathematical basis of PROLOG?
Which polish notation supports the LISP ? Write theFollowing
codes(provide suitable comments with code to express your logic)
(a) Write a recursive function in LISP named power that takes two
numeric arguments, n and m, that computes nth power of m (i.e.,
m
n
).
(b) Write a PROLOG programme that answers questionsabout
family members and relationships. Include predicates and rules
which define sister, brother, father, mother, grandfather, grand-child and uncle. The programme should be able to answer
queries such as the following:
? – father (X, mohit)
? – grandson (X, Y)
? – uncle (abdul, ruksana)
? – mother (mary, X)
Translate the following three statements in First Order Predicate
Logic, and then deduce (iii) from (i) and (ii): Firstly without using
Resolution Method and then by using the Resolution method
(i) Lord Krishna is loved by everyone who loves someone.
(ii) No one loves nobody
(iii) Lord Krishna is loved by everyone.
Logic, and then deduce (iii) from (i) and (ii): Firstly without using
Resolution Method and then by using the Resolution method
(i) Lord Krishna is loved by everyone who loves someone.
(ii) No one loves nobody
(iii) Lord Krishna is loved by everyone.
Write the process of transforming a Well Form Formula or FOPL
expression in to a clausal form. What is the role of achieving Prenex
Normal Form (PNF) in the above process, what is itsutility? How
Prenex Normal Form (PNF) contributes to the processof
Skolomization. Write the steps involved in achieving PNF and
Skolomization. What is the role of clausal form in the process of
Resolution, in context of Artificial Intelligence? Skolomize the
expression below :
∃x1∃x2∀y1∀y2∃x3∀y3 P(x1 , x2 , x3 , y1 , y2 , y3 )
expression in to a clausal form. What is the role of achieving Prenex
Normal Form (PNF) in the above process, what is itsutility? How
Prenex Normal Form (PNF) contributes to the processof
Skolomization. Write the steps involved in achieving PNF and
Skolomization. What is the role of clausal form in the process of
Resolution, in context of Artificial Intelligence? Skolomize the
expression below :
∃x1∃x2∀y1∀y2∃x3∀y3 P(x1 , x2 , x3 , y1 , y2 , y3 )
Why do we need to do the Normalization of any Well Form Formula
(WFF)? What is the practical utility of deriving the Conjunctive
Normal Form (CNF) & Disjunctive Normal Form (DNF)? Determine
whether the equivalence between the formulae on twosides of ‘=’
holds or not (A ®B) ®C = (A ®B) ®(A ®C)? Reduce each of
the given formulae on the two sides of ‘=’ to one of the normal forms
(DNF or CNF).
(WFF)? What is the practical utility of deriving the Conjunctive
Normal Form (CNF) & Disjunctive Normal Form (DNF)? Determine
whether the equivalence between the formulae on twosides of ‘=’
holds or not (A ®B) ®C = (A ®B) ®(A ®C)? Reduce each of
the given formulae on the two sides of ‘=’ to one of the normal forms
(DNF or CNF).
Differentiate between Predicate & Propositional logic. Identify some
application areas where Predicate & Propositional logic is used.
Write De-Morgan’s laws for Predicate & Propositional logic. Do the
Universal Quantification & Existential Quantification, represents
generalized version of conjunction & disjunction operations,
respectively? Justify your answer with suitable arguments. Using
which mechanism you verify the validity of the statement? Discuss
with suitable example.
For each of the following formulae, construct a truth-table, and then
determine whether it is valid, consistent or inconsistent:
(i) (~ C ®~ D) ®(D ®C)
(ii) ((~ C nD) →B) ®(~ C ®B)
application areas where Predicate & Propositional logic is used.
Write De-Morgan’s laws for Predicate & Propositional logic. Do the
Universal Quantification & Existential Quantification, represents
generalized version of conjunction & disjunction operations,
respectively? Justify your answer with suitable arguments. Using
which mechanism you verify the validity of the statement? Discuss
with suitable example.
For each of the following formulae, construct a truth-table, and then
determine whether it is valid, consistent or inconsistent:
(i) (~ C ®~ D) ®(D ®C)
(ii) ((~ C nD) →B) ®(~ C ®B)
Discuss the Turing Test & Chinese room test in detail. How these two tests addresses the machine intelligence over the human intelligence? Which test has edge over the other? Justify your answer with suitable arguments
