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
Observed Speedup Observed speedup of a system which has been parallelized, is defined as:                             Granularity is one of the easiest and most extensi


A group of 20 servers carry traffic of 10 erlangs. If the average duration of a call is three minutes, calculate the number of calls put through by a single server and the group as

How aliases are used in DNS? Explain. CNAME entries are analogous to a symbolic link in a file system- the entry gives an alias for other DNS entry. Corporation of expertsmind

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

What is a accepting computation history?  An accepting computation history is explained as , Let M be a Turing machine and w be a input string,  for M on w is a sequence of con

Difficulties - canonical genetic algorithm: Therefore the first big problem we face whether designing an "AI" agent to perform a GA-style search is how to represent the soluti

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

What is the decimal equivalent of the hexadecimal number 'A0' ? Ans. The decimal equivalent value is 160 of the hexadecimal number 'A0'. As   A        0      16 1     16 0    =

Customized User Preferences offer tremendous versatility to your individual Bugzilla experience. Let's plunge into what you can do! The first step is to click the "Edit prefs" link