Manipulation of Boolean functions has important applications in such fields as hardware verification, non-monotonic reasoning, and decision support. Most often, in such applications, the set of prime implicates/implicants of a large formula must be compute
Anti-LinksforBooleanFunctionManipulation
BernhardBeckertReinerH¨ahnleNeilV.Murray
InstituteforLogic,Complexity,
andDeductionSystems
UniversityofKarlsruhe,D-76128Karlsruhe
@ira.uka.de
doc.guandang.net /AnavaiRameshInstituteforProgramming&LogicsDepartmentofComputerScienceUniversityatAlbany,Albany,NY12222rameshag,nvm@cs.albany.edu
ManipulationofBooleanfunctionshasimportantapplicationsinsuch eldsashardwareveri cation,non-monotonicreasoning,anddecisionsupport.Mostoften,insuchapplications,thesetofprimeimplicates/implicantsofalargeformulamustbecomputed.
ManyalgorithmshavebeenproposedtocomputetheprimeimplicatesofpropositionalBooleanformu-las,e.g.[4,5].Mostofthemassumethattheinputisinconjunctive/disjunctivenormalform(CNF/DNF).Thebottleneckofsuchalgorithmsisusuallythelargenumberofsubsumed(i.e.non-minimal)disjunc-tive/conjunctivepathsthroughthegivenformula.Therefore,itiscrucialtoremoveasmuchredundancyofthiskindaspossible,beforeanyexplicitenumerationofprimeimplicates/implicantsstarts.Evenifsuchexplicitcomputationofprimeimplicates/implicantsisnotanimmediategoal,removinganyredundanciesduetosubsumeddisjunctive/conjunctivepathsisusuallyhighlydesirable.
Amongthemostsuccessfulmethodsusedtodealwiththistaskarebinarydecisiondiagrams(BDDs)[2,3].Itis,however,wellknownthatBDDmethodsdonotworkwellonsomeclassesofformulas,inparticular,whentheyareusedtocomputeprimeimplicants.AnotherrestrictionofBDDsisthatthey(atleasttheef cientversions)essentiallyproduceanXOR-ANDnormalform,butthisisnotalwayswhatisneeded.
Here,wepresentatechniquebasedonanti-linksforidentifyingandremovingsubsumedpaths,thatoperatesonformulasinnegationnormalform(NNF).1ItisnotanalternativetoBDDsandothermethodsforcomputingprimeimplicants,butisintendedtobeusedasasupplementarypre-processingstepthatenhancestheoverallperformanceofthesystem.
consistsofoccurrencesandofaliteralinanNNFformula.IftheAnanti-link
(largest)subformulasandofthatcontainand,respectively,aredisjunctivelyconnected,wecalladisjunctiveanti-link.Ifandareconjunctivelyconnected,thenwecallaconjunctiveanti-link.
Iftheformulacontainsadisjunctivepaththatissubsumedbyadistinctpath,thencontainsadisjunctiveoraconjunctiveanti-link.Unfortunately,theconverseisnottrue:thepresenceofanti-linksdoesnotimplythepresenceofsubsumedpaths.Thereis,however,alargeclassofanti-links,thatwecallredundant,thatisalwaysanindicatorforsubsumedpaths:Adisjunctiveanti-linkinisredundantifeitheroristheargumentofaconjunction.Inthatcasecertaindisjunctivepathsthroughandthatcontainoraresubsumedbyadisjunctivepathinthatcontainstheanti-link.
Example1Considertheformula
Thetwooccurrencesofformaredundantdisjunctiveanti-link.Thedisjunctivepathissubsumedbythepath(withliteralset),thatcontainstheanti-link.Thetwooccurrencesofarebothargumentsofdisjunctions,andthuscompriseanon-redundantanti-link.
Murray Anavai Ramesh Institute for Logic, Complexity, and Deduction Systems University of Karlsruhe, D-76128 Karlsruhe hnamei@ira.uka.de http://i12www....
Improving temporal logic tableaux using integer constraints In this position ...Institute for Logic, Complexity and Deduction Systems 76128 Karlsruhe, Germany...
Towards an e cient Tableau Proof Procedure for Multiple-Valued Logics Reiner Hahnle Institute for Logic, Complexity and Deduction Systems University of ...
Computational Properties of Fuzzy Logic Deduction ...Institute for Research and Applications of Fuzzy ...Basic algorithm has exponential complexity with ...
Multiple–Valued Logics Bernhard Beckert Reiner H¨hnle a Stefan Gerberding Werner Kernig Institute for Logic, Complexity and Deduction Systems University of ...
Natural Deduction for Intuitionistic Non-Commutative Linear Logic Je? Polakow...framework, such as resource usage, computational complexity, and sequentiality....
In this paper we describe the logic, the automated deduction system, and ...Introduction Real systems usually involve considerable complexity in their design...
Gerberding AP 3T September 1994 3rd Edition Institute for Logic, Complexity and Deduction Systems University of Karlsruhe Abstract This is the 3TAP handbook....
暂无评价 15页 免费 and Deduction Systems 暂无评价 2页 免费...in Assessing an Argument A Few Rules of Inference Basic Syllogistic Logic I...
Natural Deduction for Intuitionistic Non-Commutative Linear Logic Je Polakow?...framework, such as resource usage, computational complexity, or sequentiality....
热门文档