First-order inference rules - artificial intelligence, Computer Engineering

Assignment Help:

First-Order Inference Rules -artificial intelligence:

Now we have a perfect definition of a first-order model is,in the same way, we may define soundness for first-order inference rules as we did for propositional inference rules: the rule is sound if given a model of the sentences above the line, this is always a model of the sentence below.

To be able to specify these new rules, we might use the notion of substitution. We've already seen substitutions which replace propositions with propositional expressions (7.2 above) and other substitutions which replace variables with terms that represent a given object (7.5 pt. above). In this section we use substitutions which replace variables with ground terms (terms without variables) so being clear we will call these ground substitutions. Another name for the ground substitution is an instantiation,

I.e. If we begin with the superbly optimistic sentence that everyone likes everyone else:X, Y (likes(X, Y)), then we can select specific values for X and Y. So, we may instantiate this sentence to say: likes(tony,George). Because we have selected a specific value, the quantification not makes sense longer, so we might drop it.

The activity of performing an instantiation is a function, as there is just one possible outcome, so we may write it as a function. The notation

Subst({X/george, Y/tony}, likes(X,Y)) = likes(george, tony)

Show that we have made a ground substitution.

We also need to recognize that we are working with sentences which form part of a knowledge base of various such like sentences. More to the point, there will be constants which seem throughout the knowledge base and some which are local to a specific sentence.


Related Discussions:- First-order inference rules - artificial intelligence

Designing logic circuits, When designing a logic circuit with multipleoutpu...

When designing a logic circuit with multipleoutputs it is usual to treat it as several circuitseach with one output. So for our example wewould design three circuits; one with outp

Shared-memory programming model, Q. Shared-memory programming model? In...

Q. Shared-memory programming model? In shared-memory programming model tasks share a common address space that they read and write asynchronously. Several mechanisms like semap

Boardcoloring, write a java program to board coloring

write a java program to board coloring

Show mpi functions, Q. Show MPI functions? MPI comprises hundreds of fu...

Q. Show MPI functions? MPI comprises hundreds of functions which are a small subset of which is enough for most practical purposes. We will discuss some of them here. Int M

What is cyclomatic complexity, What is cyclomatic complexity? Cyclomati...

What is cyclomatic complexity? Cyclomatic complexity is a computer science metric (measurement) developed by Thomas McCabe used to generally calculate the complexity of a progr

Explain the generic framework for electronic commerce, Explain the generic ...

Explain the generic framework for electronic commerce along with suitable diagram? Generic Framework for electronic commerce comprises the Applications of EC (as like banking,

What is mask operation, What is MASK OPERATION The mask operation is si...

What is MASK OPERATION The mask operation is similar to selective-clear operation except which the bits of Aare cleared only where there are corresponding 0's in register B. th

Explain about deadlock avoidance, Q. Explain about Deadlock Avoidance? ...

Q. Explain about Deadlock Avoidance? To prevent deadlocks two kinds of techniques are used: 1) Static prevention:  It employs P and V operators in addition to Semaphores to

Data structure in which an element is added, A data structure in which an e...

A data structure in which an element is added and detached only from one end, is known as Stack

What are different adder circuits you studied, Half Adder (for addition of ...

Half Adder (for addition of two bits) Full Adder (for addition of three bits) Carry look ahead adder Carry save adder Carry propagate adder

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