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
Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Write a recursive algorithm to delete the leaves of a binary tree. Programming Requirements You must use the binary search tree code provided.  Each algorithm must be impleme

Q. LIFO under perpetual inventory procedure? LIFO under perpetual inventory procedure observes Exhibit to see the LIFO method using perpetual inventory procedure. In this proce

Explain adaptive routing. Adaptive routing defines the ability of a system, by which routes are characterised through their destination, to change the path that the route takes

Q. Explain about Floating Point Representation? Floating-point number representation includes two parts. The first part of number is a signed fixed-point number which is called

Information Technology or Information System Before going further we need to clarify what we mean by the term information system. It is easy to confuse terminology as many tex

Example of the horizon problem: It is also worth bearing in mind the horizon problem, however a game-playing agent cannot see much far satisfactory into the search space. Now

Translate each of the following sentences into predicate calculus, conceptual dependencies, and conceptual graphs: 1. Bill sold the book to the book store." 2. "John borrowed

what is java?

Advantages and Disadvantages of Structured Analysis With time, you will find out that most customers understand structured methods better than object oriented (OO) methods. As