Variables and quantifiers for first-order models , Computer Engineering

Assignment Help:

Variables and Quantifiers for First-order models -artificial intelligence:

So what do sentences containing variables mean? In other words, how does first order model select whether such a sentence is false ortrue? The first step is to ensure that the sentence does not contain any unrestricted variables, variables which are not bound by (associated with) a quantifier. Firmly speaking, a first-order expression is not a sentence unless all the variables are bound. However, we typically assume  that  if  a  variable  is  not  explicitly  bound  then  actually  it  is  implicitly commonly quantified.

Next we look for the outermost quantifier in our sentence. If it is   X then we consider the truth of the sentence for each value X could take. When the outermost quantifier is   X we have to search only a single possible value of X. To make it more formal we may use a concept of substitution. Here {X\t} is a substitution that replaces all occurrences of variable X with a term representing an object t:

  • X. A is true if and only if A.{X\t} for all t in Δ
  • X. A is true if and only if A.{X\t} for at least one t in Δ

Repeating this for all the quantifiers we get a set of ground formulae which we have to check to see if the original sentence is true or false. Unluckily, we haven't specificed that our domain Δ is finite for an example, it may contain the natural numbers - so there may be a infinite number of sentences to check for a given model! There may be also be an infinite number of models .So even though we have a right definition of model, and so a proper semantics for first-order logic, so we cannot  rely  on  having  a  finite  number  of  models  as  we  did  when  drawing propositional truth tables.


Related Discussions:- Variables and quantifiers for first-order models

Differentiate between protected and real modes of an intel, Differentiate b...

Differentiate between protected and real modes of an Intel microprocessor Operation of Real mode interrupt: When microprocessor completes executing the current instruction, it

Search method for searching a sorted file, The search method for searchi...

The search method for searching a sorted file that needs increased amount of space is The search technique for searching a sorted file that needs increased amount of space

Explain the working of a 2-bit digital comparator, Explain the working of a...

Explain the working of a 2-bit digital comparator with the help of Truth Table. Ans. Digital comparator is a combinational circuit which compares two numbers, A and B; and

What is read only memory (rom) and define the use of it?, What is Read only...

What is Read only memory (ROM) and Define the Use of it? A simple kind of ROM can be constructed from a decoder, Or gates, and a number of wires. Input

List in a pop-up screen other than full-size stacked list, Can we display a...

Can we display a list in a pop-up screen other than full-size stacked list? Yes, we can show a list in a pop-up screen using the command WINDOW with the additions beginning at

Where protocol operates to monitor and control n/w devices, Protocol used t...

Protocol used to monitor and control network devices operates at? Protocol operates at application layer to monitor and control network devices operates.

Explain the operation of JK flip flop when all inputs are 0, Write the trut...

Write the truth table for a clocked J-K flip-flop that is triggered by the positive-going edge of the clock signal. Explain the operation of this flip-flop for the following condit

Set up to use parallel virtual machine, Q. Set up to Use parallel virtual m...

Q. Set up to Use parallel virtual machine? PVM employs two environment variables when starting and running. Each and every PVM user needs to set these two variables to employ P

Handling interrupts - computer architecture, Handling Interrupts: Pre...

Handling Interrupts: Precise interrupts (sequential semantics) Complete instructions before the offending instructions o   Force trap instruction into IF o

Describe big notation, Q. Describe Big Notation? Big O Notation : The ...

Q. Describe Big Notation? Big O Notation : The set O (g(n)) comprises all functions f(n) for that there exists   positive constants c such that for satisfactorily large values

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