一种基于扩展规则的#SAT求解系统.pdf

ISSNl RUXUEW 000—9825，CODEN Journal 2009，PP．1714--1725 ofSoftware，V01．20，No．7，July doi：10．3724／SP．J．1001．2009．03320 Chinese reserved． o Institute rigllts by ofSoftware,theAcademyofSciences．All 一种基于扩展规则的#SAT求解系统 殷明私3+，林海1,2，囫1，2 1(吉林大学计算机科学与技术学院，吉林长春130012) 2(吉林大学符号计算与知识工程教育部重点实验室，吉林长春130012) 1301 3(东北师范大学计算机学院，吉林长春 17) ExtensionRules Solving#SATUsing YIN Ming．Haol2，3+，LINHail，一，匮巫至亘固1’2 Scienceand 130012，China) 1(CollegeofComputerTechnology。JilinUniversity，Changchun ofSymbolic and EngineeringofMinistryofEducation,Changchun130012，China) 2(KeyLaboratory ComputationKnowledge Normal 1301 Science，NortheastUniversity，Changchun17，China) 3(CollegeofCompmer +Correspondingauthor：E—mail：mhyin@nenu．edu．cn rules．Journal Yin extension MH，LinH，Sun of JG．Solving#SATusing http：／／www．jos．org．cn／1000-9825／3320．htm Abstract：#SAT istheextensionofSAT involves modelsofa setof problem problem．It counting given theinverseofresolutionandtheinclusion·exclusiontocircumventthe formulae．Byusing principle proposition of a frameworkforbothmodel and model spacecomplexity,thispaperproposes countingweighted problem a methodforcurrentmodel methods．Thesemethodsare tobe counting．Itsuggestscomplementary counting proved soundand model builtbasedonthesemeth