First-order models -artificial intelligence, Computer Engineering

Assignment Help:

First-Order Models - Artificial intelligence:

We proposed first-order logic like good knowledge representation language rather than propositional logic because it is more expressive, so we may write more of our sentences in logic. So the sentences we want to apply inference andrewrites rules will include quantification. All of the rewrite rules we have seen so far may be used in propositional logic (and hence first-order logic). Now we consider rules in which rely on information regarding the quantifiers, so there are not available to an agent working with a propositional logic representation scheme.

Before we look at first-order inference rules we have to pause to consider what it means for such an inference rule to be sound. Previously we defined it as meaning the top entails the bottom: that any model of the former was a model of the latter. But first order logic introduces new syntactic elements (quantifiers, functions, constants, variables, and predicates) alongside the propositional connectives. It means we have to fully revise our definition of model, a notion of a 'possible world' that defines whether a sentence is  false ortrue in that world.

A propositional model was only an assignment of truth values to propositions. A first-order model is a pair (Δ, Θ) in contrast where

  • Δ is a domain, a non-empty set of 'objects', for example things which our first-order sentences are referring to.
  • Θ is an interpretation, a process for calculating the truth of sentences relative to Δ.

This appears very different from propositional logic. Luckily, everything we have discussed so far regarding deduction carries over into first-order logic when we use this new definition of model.

First-order logic lets us to talks regarding properties of objects, so the first task for our model (Δ, Θ) is to assign a meaning to the terms that represent objects. A ground term is any arrangement of constant and function symbols, and Θ maps each specific ground term to a specific object in Δ. This means that a ground term refers to a single particular object. The meaning of sub terms is always not dependent of the term they appear in.

The  specific  way  that  terms  are  mapped  to  objects  depends  on  the  model. Different models may define terms as referring to different things. Note down that although father (john) and jack are separate terms, they must both be mapped to the same object (say Jack) in Δ. That is, the 2 terms are syntactically different but (in this model) they are semantically the similar, for example, they both refer to the same thing!

Terms may also contain variables (for example father(X)) - these are non-ground terms. They do not refer to any particular object, and so our model cannot directly assign any single meaning to them. We will come back to what variables mean.


Related Discussions:- First-order models -artificial intelligence

Example of unification, Example of Unification: Let now here, assume i...

Example of Unification: Let now here, assume instead that we had these two sentences as:  knows(john,X) → hates(john, X)  knows(jack, mary)  Thus here the predicate n

How to create dlq rules table, DLQ - Dead Letter Queue If an applicati...

DLQ - Dead Letter Queue If an application tries to put a message to one more application and if it is not delivered then it goes to the DLQ. So DLQ is not anything but all und

How to fix an asic-based design from easiest to most extreme, How to fix an...

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

Natural interfaces, A breakthrough in the AI intelligence the development ...

A breakthrough in the AI intelligence the development of natural interfaces is a prerequisite to the optimal use of computers by human beings. It incorporates: a. Natural La

What is an i/o buffer, What is an I/O buffer? I/O buffer: One ty...

What is an I/O buffer? I/O buffer: One type of input-output requirement arises from devices which have a very high character density as disks and tapes. With these chara

Binary resolution - artificial intelligence, Binary Resolution: We look...

Binary Resolution: We looked at unit resolution (a propositional inference law) in the last lecture: A ∨ B,   ¬B /A We may have this a bit further to propositional bin

Representation in prolog - logic programs, Representation in Prolog - Logic...

Representation in Prolog - Logic Programs: If we justimpose some additional constraints on first-order logic, so than we get to a representation language knowing as logic prog

Define flowchart, Define Flowchart. A  process  of  expressing  an  alg...

Define Flowchart. A  process  of  expressing  an  algorithm  by  a  collection  of  linked  geometric  shapes   containing explanations of the algorithm's steps.

What is literal, Meaning of Literal is:- Literal is string constant.

Meaning of Literal is:- Literal is string constant.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd