Chains of inference, Computer Engineering

Chains of Inference:

Now we have to look at how to get an agent to prove a given theorem using various search strategies? Thus we have noted in previous lectures that, there is to specify a search problem, we require to describe the representation language for the artefacts being searched for such the initial state that the goal state or some information about that a goal should look like, and the operators: just how to go from one state to another. 

Here we can state the problem of proving a given theorem from some axioms like a search problem. Means three different specifications give rise to three different ways to solve the problem, by namely forward and backward chaining and by proof contradiction. In this specifications, all the representation language is predicate logic that are not surprisingly so the operators are the rules of inference that allow us to rewrite a set of sentences as another set. However we can think of each state in our search space as a sentence in first order logic. But the operators will traverse this space and finding new sentences. Moreover, we are really only interested in finding a path from the start states to the goal state like this path will constitute a proof. Always notice that there are other ways to prove theorems like exhausting the search for a counterexample and finding none -  in this case but we don't have a deductive proof for the truth of the theorem so we know it is true.

Posted Date: 1/11/2013 6:05:31 AM | Location : United States







Related Discussions:- Chains of inference, Assignment Help, Ask Question on Chains of inference, Get Answer, Expert's Help, Chains of inference Discussions

Write discussion on Chains of inference
Your posts are moderated
Related Questions
What are Addressing Modes Many of instructions that a computer actually executes during running of a program concern movement of data to and from memory. It is not possible sim

SMTP is a Protocol used for transferring message among end user & Mail Server.

Coding advantages of casex or casez By using casex or casez has the following coding advantages: -  It reduces number of lines, especially if the number of bits had been m

luminous jewels polishing game

Do you provide storage and destruction services? We will assess your storage and destruction needs as part of our evaluation process. Our destruction services can be performed

I have converted my MS Access database to a present conversion. I am getting conversion errors? Ans) Design specs have changed in new releases of MS Access. Visit the on-line

Problem: (a) Describe how a Mobile Terminating call, from a PSTN phone, is processed in a GSM network. Illustrate your answer with a diagram. (b) What is a GPRS Support node

What is a Decoder ? Ans. Decoder: - This decodes the information. The decoders contain n inputs 7 at the end maximum 2 n outputs since n bit no can decode max 2n infor

The NOR gate. The NOR gate is equivalent to an OR gate followed by a NOT gate so that the output is at logic level 0 when any of the inputs are high otherwise it is at logic le

Q. Define Resolution versus Accuracy in mouse? Resolution of mouse is known in CPI (Counts per Inch) it implies that number of signals per inch of travel.  This implies the mou