s

About Academy  |  About IRSS  |    Contact Us                                                                   ISSN (Online) : 2309-0081 | ISSN (Print) : 2710-0057

International Review of
Social Sciences (IRSS)

Home     Editorial Board     Current Issue     Archive     Indexing      Call for papers     Authors Guideline      Manuscript Submission      Contact

News & Events

Saturday, December 20, 2025
IRSS Volume 13, Issue 4 has been published.
  
Saturday, December 20, 2025
IRSS Volume 14 Issue 1 (Quarter I), will publish in Jan-Mar 2026.
  
Saturday, September 28, 2024
International Review of Social Sciences (IRSS) is now HEC Recognized in Category Y.
  
Saturday, March 25, 2023
IRSS Published on Quarterly basis from Volume 11 2023.
  
Saturday, January 09, 2021
Article English Proofreading Process.
  
Monday, July 27, 2020
IRSS is now HEC Recognized in Category Y
  

IRSS Citation Report

  All Since 2026
 Citation  1134 47
 h-index 16 01
 i10-index 25 01

Hit Counter

Total 1683175
Today's 143
Yesterday's 3032

 Country Wise Counter

Academy Publication Ethics


IRSS Paper Details

← Back to Volume 6, July 2018 issue

Title Condition Simplification by Logic
AuthorsSADIA TARIQ, SAJJAD ABBAS and HABIB ULLAH
Abstract

Formal specification of software is the major concern for every software client nowadays. No organizations try to get the reliable and accurate software solutions. The one of the best way to get maximum accuracy in solutions is achieved by the techniques used for formal specification of software engineering. Propositional Logic (PL) is the one the simplest and oldest techniques with its grounds in mathematics to formally specify a program with the using of Hoare’s Triple. Propositional logic is the branch of mathematics which is being used by many of science disciplines for formal specification of real time problems. Every problem which exists can be stated in any English like language can also be transferred using propositional logic and its validity and invalidity can be checked, verified and proved using laws and logical equivalence of Propositional Logic. PL provides us verity of rules that can be applied into computer programming to formally specify a computer program and provide several mechanisms for checking their valid and proof. This paper will present a unique and different use of propositional logic, its laws, and especially the logical equivalence in the processing of Software development life cycle. We have used Pl in coding part of software for condition simplification. Conditions are the primitive and basic parts of software code and it enable to get a simplified version of complex conditions prior to code it; it will surely give us simplification of code. With the help of code examples it will be proved that how propositional logic can be used for the condition simplification, and hence reduction of code size and logic circuitry of a computer program. Keywords: Logic, Laws of Logic, Logical Equliances, AND, OR, NOT, Implifciation and Bi-conditioanl implification.

Volume 6
Issue July
Pages 316-325
Download Download PDF (427 downloads)
AUN

Copyright © www.academyirmbr.com : 2012-25. All Rights Reserved.