Lovely Professional University

CSE- 452 (Artificial intelligence )

Assg:-3

Submitted by: -
Name: Nitin Khajuria
Roll no: A28
Section : A1812
Reg no: 10804879
Submitted to:- Mrs. Rinku Garg
PART: A

Q1:-Construct partitioned semantic net representation for the

following

a) All the batters like the pitcher.

Ans: Vx: Batters(x)&Pitcher(y)->likes(x,y).

Q2:- Which types of knowledge representation techniques are used

by weak slot and filler structure?

Ans: The problem solving with Artificial Intelligence techniques for knowledge
representation, there exists several techniques. However two of the most
significant AI techniques are:

1. Weak slot and filler structures

2. Strong slot and filler structures

In weak slot and filler structures we study technique such as “semantic nets”
with the “isa” and “has ” and “instance mechanisms” and also the technique of
“frames” apart from these we also study the logic of predicate calculus
mathematical analysis techniques which is also a part of prepositional logic
and/or prepositional logical mathematics.
In Strong slot and filler structures we study techniques such as scripts and
Schamks conceptual dependency theory.
There are certain issues in knowledge representation in order to exhibit the
knowledge prior to study of above two techniques.

Q3:- What is transition network parser?

Ans: An augmented transition network (ATN) is a type of graph theoretic

structure used in the operational definition of formal languages, used especially
in parsing relatively complex natural languages, and having wide application in
artificial intelligence. An ATN can, theoretically, analyze the structure of any
sentence, however complicated.

ATNs build on the idea of using finite state machines (Markov model) to parse
sentences. W. A. Woods in "Transition Network Grammars for Natural
Language Analysis" claims that by adding a recursive mechanism to a finite
state model, parsing can be achieved much more efficiently. Instead of building
an automaton for a particular sentence, a collection of transition graphs are
built. A grammatically correct sentence is parsed by reaching a final state in any
state graph. Transitions between these graphs are simply subroutine calls from
one state to any initial state on any graph in the network. A sentence is
determined to be grammatically correct if a final state is reached by the last
word in the sentence.

This model meets many of the goals set forth by the nature of language in that it
captures the regularities of the language. That is, if there is a process that
operates in a number of environments, the grammar should encapsulate the
process in a single structure. Such encapsulation not only simplifies the
grammar, but has the added bonus of efficiency of operation. Another
advantage of such a model is the ability to postpone decisions. Many grammars
use guessing when an ambiguity comes up. This means that not enough is yet
known about the sentence. By the use of recursion, ATNs solve this inefficiency
by postponing decisions until more is known about a sentence.
PART:B

Q4:- How do semantic Networks function as an alternative to

Predicate Logic?

Ans: The main idea behind semantic nets is that the meaning of a concept comes
from the ways in which it is connected to other concepts. In a semantic net,
information is represented as a set of nodes connected to each other by a set of
labelled arcs, which represent relationship among the nodes. In knowledge
representation, when we do network representation it is semantic nets.

Moreover, A semantic network is a network which represents semantic relations

among concepts. This is often used as a form of knowledge representation. It is
a directed or undirected graph consisting of vertices, which represent concepts,
and edges.

Example : chair has four legs.

L There are two key parts of prdeicate logic. The syntax determines which
collections of symbols are legal expressions in prdeicate logic, while the
semantics determine the meanings behind these expressions. o An interpretation
of a predicate language assigns a denotation to all non-logical constants in that
language. It also determines a domain of discourse that specifies the range of
the quantifiers. The result is that each term is assigned an object that it
represents, and each sentence is assigned a truth value. In this way, an
interpretation provides semantic meaning to the terms and formulas of the
language. The study of the interpretations of formal languages is called formal
semantics.
The domain of discourse D is a nonempty set of "objects" of some kind.
Intuitively, a first-order formula is a statement about these objects; for example,
states the existence of an object x such that the predicate P is true where
referred to it. The domain of discourse is the set of considered objects. For
example, one can take D to be the set of integer numbers.

Q5:- Represent the following properties in frame

a) Default values

b) Many values for slot

Ans:

a) Default values-

• Two examples of frame- or frame based- languages are OIL and

F-logic.

• An editor for frame-based ontologies is Protégé.

• The Knowledge Machine (KM) is a knowledge representation

language and reasoning engine. The knowledge is represented as
frames, but KM is also influenced by logic. This combination
makes KM very expressive and provides it with a clear, formal
semantics.

• KL-ONE is a well known knowledge representation system in

the tradition of semantic networks and frames. The system is an
attempt to overcome semantic indistinctness in semantic
network representations and builds upon the idea of Structured
inheritance networks.

b) Many values for slot

The slots describe the frame with attribute-value pairs
<slotname value> or alternatively a triple containing
framename, slotname and value in some order. In many frame
systems the slots are complex structures that have facets
describing the properties of the slot. The value of a slot may be
a primitive such as a text string or an integer, or it may be
another frame. Most systems allow multiple values for slots and
some systems support procedural attachments. These
attachments can be used to compute the slot value, or they
can be triggers used to make consistency checking or updates
of other slots. The triggers can be trigged by updates on slots

Q6:- Explain frames with examples?

Ans: Frames are also an extensive part of knowledge representation and

reasoning schemes. Frames were originally derived from semantic networks and
are therefore part of structure based knowledge representations. Structured
representation is frames.

• Frames- semantic net with properties.

• A frame represent an entity as a set of slots (attributes) and associated

values.

• A frame can represent a specific entity or a general concept.

Examples: example 1 of book frame:
example 2: