Propositional inference rules - artificial intelligence, Computer Engineering

Propositional Inference Rules -Artificial intelligence :

Equivalence rules are specifically useful because of the vice-versa aspect,that means we can discover forwards andbackwards in a search space using them. So, we may perform bi-directional search, which is bonus. However, what if we know that 1 sentence (or set of sentences) being true implies that another set of sentences is true. For example, the following sentence is used ad nauseum in logic text books:

All men are mortal

Socrates was man so,

Socrates is mortal

This is an instance of the application of a rule of deduction call as Modus Ponens. We see that we have deduced the fact that Socrates is mortal from the 2 true facts that all men are mortal and Socrates was a man. Hence , because we know that the rule regarding men being mortal and classification of Socrates as a man are true, we may infer with surely (because we know that modus ponens is sound), that Socrates will be die - which, in fact, he did. Of course, it does not make any sense to go backwards as with equivalences: we would deduce that, Socrates as being mortal implies that he was a man and that all men are mortal!

The common format for the modus ponens rule is following: if we have a true sentence which states that proposition A denotes proposition B and we know that proposition A is true, then we cansuppose that proposition B is true. For this the notation we use is following:

A -> B, A

B

It is an instance of an inference rule. The comma above the line showsin our knowledge base, we know both these things, and the line stands for the deductive step. That is, if we know that the both propositions above the line are true, then we may deduce that the proposition below the line is also true. An inference rule,in general

A/B

is sound if we may be certain that A entails B, for example. B is true when A is true.Tobe More formally, A entails B means that if M is a model of A then M is also a model of B. We write this as A ≡  B.

This gives us a way to examine the soundness of propositional inference rules: (i) draw a logic table for B and A both evaluating them for all models and (ii) check that whenever A is true, then B is also true. We do not care here about the models for which A is false.

This is a small example, but it highlights how we use truth tables: the first line is the just  one where both above-line propositions ( A->B and A) are true. We see that on this line, the proposition B is also true. This indicates us that we have an entailment: the above-line propositions entail the below-line one.

To see why such kind of inference rules is useful, remember what the basic application of automated deduction is: to prove theorems. Theorems are usually part of a big theory, and that theory has axioms. Axioms are special theorems which are taken to be true without question. Therefore whenever we have a theorem statement we want to prove, we should be enabling to start from the axioms and deduce the theorem statement using sound inference rules such as modus ponens.

Posted Date: 10/2/2012 8:08:38 AM | Location : United States







Related Discussions:- Propositional inference rules - artificial intelligence, Assignment Help, Ask Question on Propositional inference rules - artificial intelligence, Get Answer, Expert's Help, Propositional inference rules - artificial intelligence Discussions

Write discussion on Propositional inference rules - artificial intelligence
Your posts are moderated
Related Questions
Why disable statements are not allowed in functions? If  disble  statement  is used  in function,it  invalids  function  and  its  return  value.  So  disable statements aren't

How many address bits are required to represent 4K memory ? Ans. 12 address bits are required for representing 4K memory, as 4K = 2 2 x 2 10   = 2 12 Therefore 1K = 1024

Concept of Temporal Parallelism  In order to make clear what is meant by parallelism inherent in solution of a problem, let's discuss an example of submission of electricity b

Explain crossbar exchange, with all call processing steps and diagrams. The fundamental idea of crossbar switching is to give a matrix of n x m sets of contacts with only n + m

Q. Convert the following from octal to binary, decimal, hexadecimal and BCD. a) 7.7 b) 4037 c) 23.34

dynamic storage allocation technique

I/O devices need to be matched up to computer application. -  Computer-aided design (graph plotters, large screens, etc.) -  Virtual reality (data gloves, data goggles, etc.)

• Moral and Ethical Implications o Will this be safe to have on the road    Will the computers on board be able to handle extreme circumstances • Hazardous conditions o Ex

How do you pass basic types by reference?   In the case of basic types like bool, int, uint, etc. you can in fact choose among the two forms. If you prefix the method parameter

Q. Define Parameters used in Program Annotation? Parameters: A parameter refines and extends the meaning that assembler attributes to keyword in a statement.  Number of param