In: Computer Science
Represent the above sentences into FOL(first Order Logic)
formulas with defining your ontology.
-> Every man does not hit a woman whom he marries. Jason and
Kale are men and Mary is a woman. Mary marries either Jason or
Kale. Kale hit Mary. Does Mary marries Jason?
First order logic is also known as predicate logic or first order predicate calculus. It is an extension of propoaproposi logic and is used for knowledge representation.
There are three components of FOL:
1) objects: people, theories, etc
2) relatives: black, red,etc
3) functions: father of, right to, etc
There are two parts of FOL:
1) syntax: this is a collection of symbols
a) constant: 1,2,3, Jason, Mary, etc
b) variable: X,y, a,b,etc
c) predicate: brother, mither, etc
d) function: right hand of, hit, etc
e) connectives: ^,=>, etc
f) equality: ==
g) quantifiers: universal, specific
2) semantics: collection of sentences in words
There are two types of statements in FOL:
1) atomic: it is a basic statement, written in a sentential formula.
If B and C are sentential formulas, then:
-| B means not B
B^C means B and C
BvC means B or C
B =>C means B implies C
2) Complex: this is a combination of atomic sentences and connectives.
Now, let's examine the given set of sentences to represent as FOL. This use of intuition and logic to represent knowledge and derive at a decision is known as ontology.
The given solution is attached as an image format.