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

Synchronization latency problem, Synchronization Latency Problem:  If two s...

Synchronization Latency Problem:  If two simultaneous processes are performing remote loading, then it is not recognized by what time two processes will load, as the issuing proces

Develop a calculator in masm, Assignment:  develop a calculator in MASM. ...

Assignment:  develop a calculator in MASM. Text chapters covered:  1 through 4, 5.4, 5.5, 6.3, 7.4 You will develop a "calculator" algorithm in MASM using reverse-polish nota

Explain about the mini computers, Explain about the MINI COMPUTER Minic...

Explain about the MINI COMPUTER Minicomputers are much smaller in size than mainframe computers and they are also less expensive.  The cost of these computers can differ from a

Explain performance evaluation in parallel computing, Explain Performance E...

Explain Performance Evaluation in parallel Computing In this section, we will discuss the key attributes used to measure performance of a computer system. The performance chara

Implemented in a program developed for sorting , A student counted up the n...

A student counted up the number of statements implemented in a program developed for sorting n integers and came up with a recurrence of the form: T(n) = a * n + b + 2T(n/2), an

Illustrate abstract class, What is an abstract class? Please, expand by exa...

What is an abstract class? Please, expand by examples of using both. Explain why?   Abstract classes are closely related to interfaces. They are classes that cannot be instanti

Illustrate left shift register with parallel load, Q. Illustrate Left shift...

Q. Illustrate Left shift register with parallel load? A register that shifts data in one direction only is known as Uni-directional shift register and a register that can shift

Show the dynamic range and colour depth, Q. Show the Dynamic Range and Colo...

Q. Show the Dynamic Range and Colour Depth? Dynamic Range is the number of colours a colour scan or number of grays a monochrome scanner can distinguish. The dynamic range is t

Delete the leaves of a binary tree, Write a recursive algorithm to delete t...

Write a recursive algorithm to delete the leaves of a binary tree. Programming Requirements You must use the binary search tree code provided.  Each algorithm must be impleme

Sort Wars, If quicksort is so quick, why bother with anything else? If bubb...

If quicksort is so quick, why bother with anything else? If bubble sort is so bad, why even mention it? For that matter, why are there so many sorting algorithms?

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