0% found this document useful (0 votes)
55 views4 pages

Concepts OF Artificial Intelligence (CS-304) : Propositional Logic

This document discusses propositional logic and its concepts. Propositional logic uses variables to represent statements and logical connectives to combine them. It defines various connectives such as negation, conjunction, disjunction, implication and bi-implication. It also discusses equivalence laws in propositional logic and how propositions can be built from simpler ones. The author obtained a PhD from CMU and wrote textbooks on artificial intelligence.

Uploaded by

Shivam Rathore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
55 views4 pages

Concepts OF Artificial Intelligence (CS-304) : Propositional Logic

This document discusses propositional logic and its concepts. Propositional logic uses variables to represent statements and logical connectives to combine them. It defines various connectives such as negation, conjunction, disjunction, implication and bi-implication. It also discusses equivalence laws in propositional logic and how propositions can be built from simpler ones. The author obtained a PhD from CMU and wrote textbooks on artificial intelligence.

Uploaded by

Shivam Rathore
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

CONCEPTS OF ARTIFICIAL INTELLIGENCE (CS-

304)
PROPOSITIONAL LOGIC

SHIVAM SINGH RATHORE - 16/ICS/050

SHUBHANKUR - 16/ICS/052

SANDEEP KUMAR - 16/ICS/048


1

1) INTRODUCTION AND THESIS - One of the points of logic is that you can reason about statements

even when you don't know what those statements mean. We can replace statements, or

"propositions," with variable names.

So, for example, you can say "It's raining and I'm wet," which is a representation as characters

describing an utterance in natural language. In logic, we might represent this like so:

In this case the proposition "It's raining" is represented by "a" and "I'm wet" is represented by b.

The symbol stands for "and."

Propositions can be built from simpler propositions using logical connectives.

● ¬p (read "not p")--the negation of p

● p∧ q (read "p and q")--the conjunction of p and q

● p∨ q (read "p or q")--the disjunction of p and q

● p→q (read "p implies q")--the implication of q from p

● p←q (read "p if q")--the implication of p from q

● p ↔q (read "p if and only if q" or "p is equivalent to q")

The names of the symbols can be anything from alphabets like a, b or c and may hold

meaning relative to their contexts in the concept.

2) MAIN POINTS –

● The propositional calculus is defined in the context of Boolean constants, where two or

more values are computed against each other to produce an accurate description of a

concept. Each variable used in the calculus holds a value for it, which is either true to the

context or false.
2

● The precedence of the operators is in the order they are given above. That is, a

compound proposition can be disambiguated by adding parentheses to the

subexpressions in the order the operations are defined below

● Propositional logic deals with the determination of the truth of a sentence. An allowable

sentence is called the syntax of proposition. A syntax or sentence holds various

propositional symbols, where each symbol holds a proposition that can either be True of

false.

● The zero-order logic is only capable of describing concepts in a limited context and do

not hold much of a descriptive power.

● Some of the Equivalence laws followed by these statements are :

○ Idempotency

○ Involution

○ Commutative

○ Associative

○ Distributive

● Propositions can be built from simpler propositions using logical connectives. Such as :

○ Negation

○ Conjunction

○ Disjunction

○ Implication

○ Bi- Implication

3) AUTHOR - He got a Ph.D. in CS in 1979 from CMU, with a dissertation, entitled Building and

Exploiting User Models. In that work, he showed that stereotypes (models of groups of users who

share common interests or characteristics) could be effectively exploited by a system.

While at CMU, he also did a small project on the differences between men and women in their

use of color terms. Not surprisingly, women, on average, use a wider array of color expressions
3

than men do. When he left CMU, he moved to Austin to teach in the Computer Sciences

department at The University of Texas.

In the meantime, he wrote an Artificial Intelligence text-book, which later came out in a second

edition co-authored with Kevin Knight.

4) MY EVALUATION – In my opinion , in this author the author really understood what he wanted to

convey an he did that amazingly well. Author was completely through and understandable all the

way. The complete understanding of the teaching premise helped him in making sure that the

content was understandable and readable.

Any question that formed during the study session were eventually answered in a satisfactory way.

His prior experience in teaching really helped him in expecting the right questions from the reader.

5) CONCLUSION - propositional logic is a way to symbolize and understand real world statements

that always returns in TRUE or FALSE.

In my opinion author did amazingly well , as good as one can do but it really suffered from the lack

of physical presentation. you will understand his work only if you are introduced to the topic

beforehand which in my case I was.

So you definitely need someone who has the prior knowledge in this field if you are riding blind in

this book.

Otherwise i would say this is an amazing book for anyone who is even remotely interested in

Artificial Intelligence basics and logical resolution.

You might also like