Propositional logic, Computer Engineering

Assignment Help:

Propositional Logic:

This is a fairly restrictive logic, that allows us to be write sentences about ¬propositions - statements about the world - that can either be true or false. The symbols use in this logic are (i) capital letters like as P, Q and R which represent propositions such as: "It is raining" and "I am wet", (ii)connectives which are: and (^),or (?),implies (→)and not (¬).(iii) brackets and (iv) T that stands for the proposition "true", and F that stands for the proposition "false". The syntax of this logic are the rules specifying where that in a sentence the connectives can go, for example must be go among of two propositions, or between a bracketed conjunction of propositions, etc.

The semantics of this logic are rules just about how to consign truth values to a sentence if we know whether we have to mentioned the propositions in the sentence are may be true or not. For this instance, one rule is which the sentence P^Q is true only in the situation whether both P and Q are true. The rules also dictate how to need brackets. As a most easy example, we can represent the knowledge in

English which is "I always get wet and annoyed when it rains" as:

It is raining → I am wet ^ I am annoyed.

However, if at some stage if we just program our agent with the semantics of propositional logic, then we tell it that it's raining; it can infer which I will get wet and annoyed.


Related Discussions:- Propositional logic

A* search - artificial intelligence, A* Search - artificial intelligence: ...

A* Search - artificial intelligence: A* search in the combines is the best parts of uniform cost search, namely the fact that it's optimal and complete, and the other best par

Explain asynchronous decade counter, Draw the circuit diagram of Asynchrono...

Draw the circuit diagram of Asynchronous decade counter and explain its working. Ans: To  design  a  circuit diagram of decade  asynchronous  counter  initially  we  dr

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

Determine the 2's complement subtraction, Perform 2's complement subtractio...

Perform 2's complement subtraction of (7) 10 - (11) 10 . Ans. 2's Complements Subtraction of (7) 10 - (11) 10 Firstly convert the decimal numbers 7 and 11 to there binary e

Determine the block diagram of bcd adder, Determine the block diagram of bc...

Determine the block diagram of bcd adder To add 0110 to binary sum, we use a second 4-bit binary adder. The two decimal digits, together with input-carry, are first added in to

What is neg instruction, What is NEG instruction Arithmetic sign inver...

What is NEG instruction Arithmetic sign inversion or two's complement (NEG). NEG instruction two's complements a number which means that arithmetic sign of a signed number cha

Flat, nfa significance

nfa significance

How does tcp/ip decide the size of an ip fragment, How does TCP/IP decide t...

How does TCP/IP decide the size of an IP fragment? Explain. TCP/IP protocol utilizes the name IP datagram to refer to an Internet packet. The amount of data carried into a data

What does formal verification mean, What does formal verification mean? ...

What does formal verification mean? Formal verification uses Mathematical techniques by proving the design by assertions or properties. Correctness of the design can be achiev

Message passing model, In the message-passing model, there exists a set of ...

In the message-passing model, there exists a set of tasks that use their own local memories during computation. Multiple tasks can reside on the similar physical machine as well ac

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