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

Differences b/w user level and kernel supported threads, What are the diffe...

What are the differences between user level threads and kernel supported threads? A thread, sometimes termed a lightweight process (LWP), is a fundamental unit of CPU utilizati

What is visibility give uml notation, What is visibility give UML notation?...

What is visibility give UML notation? Visibility refers to the ability of a process to reference a feature from another class and has possible valued of public, private, protec

Differentiate between motion and shape tween, Question: 1. In Flash, w...

Question: 1. In Flash, what is the purpose of a motion guide layer? 2. Differentiate between Motion and Shape tween. 3. Give the steps to create a layer mask in flash.

Why cyclomatic complexity is important, Why cyclomatic complexity is import...

Why cyclomatic complexity is important? Cyclomatic complexity is computed using a graph that verifies the control flow of the program. The nodes of the graph correspond to the

Determine the simplified sop boolean expression, Reduce the following equat...

Reduce the following equation using k-map Y = BC‾D‾ + A‾BC‾D + ABC‾D + A‾BCD + ABCD Ans. Multiplying the first term with (A+A') Y = A'BC'D' + ABC'D' + A'BC'D + ABC'D + A'BCD + A

Define step by step procedure in computer programming, Define Step by Step ...

Define Step by Step Procedure in Computer Programming? The Computer programming is the skill and art of creating a computer program a defined set of instructions in source code

What is constrained-random verification, What is Constrained-Random Verific...

What is Constrained-Random Verification ? As ASIC and system-on-chip (SoC) designs continue to increase in size and complexity, there is an equal or greater increase in the si

Explain register marker, Explain Register marker. Register marker: St...

Explain Register marker. Register marker: Strowger selectors doing searching and counting. Conversely, the crossbar switch has no 'intelligence'. Something external to the

Search-based tools in parallel computers, The search-based tools initially ...

The search-based tools initially recognize problem and afterwards suitably give advice on how to correct it.  AT Expert from Cray Research is one of the tools being employed for

What is a recursively enumerable language, What is a recursively enumerable...

What is a recursively enumerable language?            The languages that is accepted by TM is said to be recursively enumerable (r. e) languages.  Enumerable means that the stri

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