And-elimination-introduction rule - artificial intelligence, Computer Engineering

And-Elimination-Introduction rule - Artificial intelligence:

And-Elimination

In English, this says that "if you know that many things are all true, then you know that any 1 of them is also true". It means that you can make a simple conjunction by just taking 1 of the conjuncts (in effect, eliminating the   s).

A1   A2 ... An /Ai

Note that 1 ≤ i ≤ n.

And-Introduction

In English language, this says that "if we know that many things are true, then we know that the conjunction of all of them is true", so we may introduce conjunction ('and') symbols.

A1,   A2,  ...,   An/ A1 ∧ A2   ...   An

This cannot seem to be saying much. Though, lets that at our knowledge base we are working with very different sentences at different places, and we know some of them are true.  Then we may make a bigger sentence out of them by conjoining the smaller ones.

Posted Date: 10/2/2012 8:17:05 AM | Location : United States







Related Discussions:- And-elimination-introduction rule - artificial intelligence, Assignment Help, Ask Question on And-elimination-introduction rule - artificial intelligence, Get Answer, Expert's Help, And-elimination-introduction rule - artificial intelligence Discussions

Write discussion on And-elimination-introduction rule - artificial intelligence
Your posts are moderated
Related Questions
Define the meaning of business-to-business. B2B (business-to-business): The consensus is universal: it is the priority; it is where the money is. It’s rather true; theref

Pipelined Processor Having discussed pipelining; now we can describe a pipeline processor. A pipeline processor can be distinct as a processor that consists of a series of proc

A protocol is a formal description of message formats and the rules two or more machines must follow to exchange those messages. Because TCP (transmission control protocol) and IP

Problem: (a) Cellular systems are based on two types of multiplexing, what are those two types of multiplexing? Describe how they are used to improve channel allocation in cel

Draw the circuit diagram of a Master-slave J-K flip-flop using NAND gates. What is race around condition? How is it eliminated in a Master-slave J-K flip-flop? Ans. Using NA

Explain FIFO Page replacement algorithm. FIFO policy: This policy only removes pages in the order they entered in the main memory. By using this policy we simply eliminate a

Displaying a number Supposing that two digit number 59 is stored as number 5 in BH and number 9 in BL to convert them to equivalent ASCII we will add "0" to each one of them.

SCSI Bus:   Defined by ANSI - X3.131   50, 68 or 80 pins   Max. transfer rate - 160 MB/s, 320 MB/s. SCSI Bus Signals   Small Computer System Interface

Boolean algebra. Boolean algebra mathematical method based on human reasoning. In Boolean algebra only two states exist; true and false which are written as 1 (true) and 0 (fa

Q. Diffrence between CD-R vs CD RW? A CD-R disc looks same as a CD. Though all pressed CDs are silver, CD-R discs are gold or silver on their label side and a deep cyan or gree