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
DLQ - Dead Letter Queue If an application tries to put a message to one more application and if it is not delivered then it goes to the DLQ. So DLQ is not anything but all und

Solve the following cryptarithmetic problem using Prolog: P I N G P O N G + F U N --------- I G N I P Each of the 7 different letters stands for a different digit. The

What is the working set of a process? The set of pages that are referred by the method in the last "n", references, where "n" is called the window of the working set of the pro

1- The Privacy Policy: The vendor must explain to the customer how all his information especially sensitive ones will be totally private, and no one can read them or use them i

Explain the use of structures with pointers C permits a pointer to a structure variable. In fact a pointer to a structure is same to a pointer to any other variable. The pointe

Conjunctive Normal Form -artificial intelligence : For the resolution law to determine two sentences, they should both be in a normalized format known as conjunctive normal fo

Explain what is a transaction in SAP terminology. In SAP terminology, a transaction is series of logically linked dialog steps.

Why we need to construct state transition diagram Basically you need to construct a state transition diagram for each object with important behaviour. You need not construct on

Problem: Develop three sub-systems namely Staff Profiling System, Inventory Management System and Time-tabling systems. (a) Show about any three design patterns you have us

Explain with the help of Nyquist theorem, the data rate limitations in PSTN's. Data rates in PSTNs : A voice channel in a public switched telephone network is band restricted