Propositional inference rules - artificial intelligence, Computer Engineering

Assignment Help:

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.


Related Discussions:- Propositional inference rules - artificial intelligence

What are the process states, What are the Process states? By the course...

What are the Process states? By the courses of implementation, processes change state. Status of a process is express by its present activity. Dissimilar practical states of

Explain about RISC pipelining, Q. Explain about RISC PIPELINING? Instru...

Q. Explain about RISC PIPELINING? Instruction pipelining is frequently used to increase performance. Let's consider this in context of RISC architecture. In case of RISC machin

Convert the following decimal numbers into octal, Q. Convert the following ...

Q. Convert the following DECIMAL numbers into OCTAL, double check by converting the result OCTAL to DECIMAL. a) 932 b) 4429.625 c) 19

How to use an assembler, Q. How to use an Assembler? Symbolic instructi...

Q. How to use an Assembler? Symbolic instructions which we code in assembly language is called as- Source program. An assembler program translates source program in machine

What is block started by symbol, What is BSS(Block Started by Symbol)? ...

What is BSS(Block Started by Symbol)? A data showing at the machine level, that has initial values when a program begins and tells about how much space the kernel assigns for t

Which one is better hardware or software firewall, Which one is better hard...

Which one is better hardware or software firewall While deciding whether to buy a hardware or software firewall, the user must consider important factors such as performance an

Computers, Purpose: Front line client service. Make bookings for vehicle se...

Purpose: Front line client service. Make bookings for vehicle servicing, accesses client database, prints invoices for clients etc. The mechanics complete worksheets for the variou

Explain creating files for writing only in c, Creating Files for Writing On...

Creating Files for Writing Only Creating Files for Writing Only : To create a text file for writing only, pass "w" into fopen as the second argument. This example follows along

Combinatorial and scheduling problems, Combinatorial and Scheduling Proble...

Combinatorial and Scheduling Problems: One class of problems is concerned with specifying optimal scheduled. A classical example is the Travelling Salesperson Problem where

What is unique port number, Q. What is Unique port number? A port is an...

Q. What is Unique port number? A port is an extra 16-bit number which uniquely identifies particular service on any given machine on Internet. Port numbers are 16 bit wide, con

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd