Our Completed playlist are : 1. Operating System (OS) : https://youtube.com/playlist?list=PLncy2sD7w4Yr3ZbiP_ipAjgjDRn86N_tT 2. Theory Of Computation (TOC) : https://youtube.com/playlist?list=PLncy2sD7w4YqBniaSEkOtzcZa3UNtWpMF 3. Software Engineering : https://youtube.com/playlist?list=PLncy2sD7w4YqcWltmTBXgCiyLB9llT703 4. Microprocessor 8085 : https://youtube.com/playlist?list=PLncy2sD7w4YrRdWllCJzNTB69yR9L69Fi #ArtificialIntelligence #AIBanglaTutorial #KnowledgeRepresentation #PropositionalLogic Propositional logic (PL) is the simplest form of logic where all the statements are made by propositions. A proposition is a declarative statement which is either true or false. It is a technique of knowledge representation in logical and mathematical form. Example: a) It is Sunday. b) The Sun rises from West (False proposition) c) 3+3= 7(False proposition) d) 5 is a prime number. Following are some basic facts about propositional logic: Propositional logic is also called Boolean logic as it works on 0 and 1. In propositional logic, we use symbolic variables to represent the logic, and we can use any symbol for a representing a proposition, such A, B, C, P, Q, R, etc. Propositions can be either true or false, but it cannot be both. Propositional logic consists of an object, relations or function, and logical connectives. These connectives are also called logical operators. The propositions and connectives are the basic elements of the propositional logic. Connectives can be said as a logical operator which connects two sentences. A proposition formula which is always true is called tautology, and it is also called a valid sentence. A proposition formula which is always false is called Contradiction. A proposition formula which has both true and false values is called Statements which are questions, commands, or opinions
[More]
