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
How many TCP connections are in the "Established" state? Contain relevant output. For one of the established TCP connections, what are the IP address and port number at the remote

Ending transactions: Either side may request that a burst end after the present data phase. Simple PCI component that do not support multi-word bursts will always request this

Scientific Applications/Image processing Most of parallel processing functions from science and other academic subjects, are mainly have based upon arithmetical simulations whe

Explain about the term business-to-customer. B2C (business-to-customer): "Electronic commerce" is usually understood mostly as selling goods or services to people ("last

The chief reason why digital computers use complemented subtraction is that it ? Ans. By using complemented subtraction method negative numbers can easily be subtracted.

Equivalences: In this following miscellaneous equivalence rules are often useful during rewriting sessions. So there the first two allow us to completely get rid of implicatio

How to clear a datagrid on a button click? You require to Clear the DataSource of the dataGrid. So try this: dataSet1.Clear(); dataGrid1.DataSource = dataSet1.TableNam


Message passing is possible the most widely used parallel programming paradigm these days. It is the most portable, natural and efficient scheme for distributed memory systems. It

A keyword that states the types in a particular namespace can be referred to without requiring their full qualified type names. 'using' reserved word always come with namespace