We gave some examples and defined in FOL. We covered the aspects of FOL Diagrams and Syntax as a whole. We skimmed through the FOL syntax and different Ontologies in FOL. We also did the code in this lab which was very interesting to work woth .

In computer science, the expressive power of a language is refered as what can be said in the language (at all) and how concisely it can be said.

First Order Logic provides better or increased expressive power than Propositional Logic (PL) to define various worlds.

In First Order Logic we follow the following steps

* Identify the task * Assemble the relevant knowledge. * Third step is to decide on a vocabulary of predicates, functions and constants. * We have to Encode general knowledge about the domain and a description of the specific problem instance. * Pose queries to the interface procedure and then get answers. * The final step is to Debug the knowledge Objects : An object is a noun that is linked with parameters and instructions that work on the parameters. Eg:People, houses, numbers Relations (Relatings) : Relations are verbs that give a value of True or False to objects & its parameters with a given instruction. Eg. If agnet falls in pit, it dies. Eg red,round, prime Functions – one-to-one relations, such as “location of the agent at time t.” The domain is the set of all objects in a model, such as “the agent,” “the locations,” father of, best friend, third inning of, one more than, end of .

Reify – one-to-many relations, such as “locations of the pits at time t.”

Syntax of First Order Logic : Basic Elements Constants- Obama, 2, Parul, . . .

Predicates- Brother, >, . . .

Functions- Sqrt, Leftblockof, . . .

Variables- x, y, a, b, . . .

Connectives- ∧ ∨ ¬ ⇒ ⇔

Equality- =

Quantifiers- ∀ ∃ Existential quantifier

The opposite is not true that is all sons will not become fathers. Some might not choose to marry or have kids. But it also says that there exists one person at least who is a son and also becomes a father (Most of them are fathers I have just taken this to explain existential quantifiers). E x Son(x) V not(Father(x))

Nested quantifier

The nested quantifier is used to specify more complex sentences. Vx Vy Neighbors(x,y)=> Neighbors(x,y)

Vx Ey likes(x,y)

Propositional logic is not adequate for formalizing valid arguments that rely on the internal structure of the propositions involved