Article(id=1327010734699032651, tenantId=1146029695717560320, journalId=1324759914146529478, issueId=1327010443811468006, articleNumber=null, orderNo=null, doi=10.7544/issn1000-1239.202440326, pmid=null, cstr=null, oa=null, hot=null, price=null, onlineType=0, articleFormat=0, articleType=null, articleTypeStr=research-article, receivedDate=1716220800000, receivedDateStr=2024-05-21, revisedDate=1727539200000, revisedDateStr=2024-09-29, acceptedDate=1728921600000, acceptedDateStr=2024-10-15, onlineDate=1794313613818, onlineDateStr=2026-11-10, pubDate=1746028800000, pubDateStr=2025-05-01, doiRegisterDate=null, doiRegisterDateStr=null, onlineIssueDate=1794313613818, onlineIssueDateStr=2026-11-10, onlineJustAcceptDate=null, onlineJustAcceptDateStr=null, onlineFirstDate=null, onlineFirstDateStr=null, sourceXml=null, magXml=null, createTime=1794313613818, creator=13701087609, updateTime=1794313613818, updator=13701087609, issue=Issue{id=1327010443811468006, tenantId=1146029695717560320, journalId=1324759914146529478, year='2025', volume='62', issue='5', pageStart='1091', pageEnd='1329', issueExtLink='null', onlineDate='null', pubDate='1746028800000', pubDateStr='2025-05-01', beforeIssueId=null, nextIssueId=null, price=null, status=1, issueComplete=1, articleOrder=1, issueType=-1, specialIssue=null, createTime=1794313544465, creator='13701087609', updateTime=1794376781779, updator='13701087609', preIssue=null, nextIssue=null, articleTotal=null, ext={EN=IssueExt(id=1327275680737374365, tenantId=1146029695717560320, journalId=1324759914146529478, issueId=1327010443811468006, language=EN, specialIssueTitle=, coverIllustrator=null, specialIssueEditor=, specialIssueAbout=), CN=IssueExt(id=1327275680737374366, tenantId=1146029695717560320, journalId=1324759914146529478, issueId=1327010443811468006, language=CN, specialIssueTitle=, coverIllustrator=null, specialIssueEditor=, specialIssueAbout=)}, issueFiles=null, downloadFileDto=null}, startPage=1226, endPage=1234, ext={EN=ArticleExt(id=1327010735038771276, articleId=1327010734699032651, tenantId=1146029695717560320, journalId=1324759914146529478, language=EN, title=Incremental Information Interaction-Based Algorithm for Enumerating MUSes, columnId=1325489891789910943, journalTitle=Journal of Computer Research and Development, columnName=Artificial Intelligence, runingTitle=null, highlight=null, articleAbstract=
Enumerating minimal unsatisfiable subsets (MUS) is an important issue in theoretical computer science. Given an unsatisfiable Boolean formula, the number of its MUS is exponentially related to the formula’s scale. Contemporary methods aim to identify MUSes as many as possible within appropriate time limits. Dealing with the huge search space and choosing a suitable node to expand can markedly reduce the time consumption on shrink and grow operations, thereby the algorithm could obtain better performance. We introduce an incremental information interaction-based MUS solving algorithm, denoted as MARCO-MSS4MUS, which utilizes the duality and complementary relationships among MUS, minimal correction set (MCS), and maximal satisfiable subset (MSS). Based on the framework of MARCO algorithm, the proposed algorithm selects a more suitable node to expand via intersection and union information of previously identified MSSes during the search, i.e., the incremental MSS information is employed as a heuristic for node selection to accelerate the enumeration of MUS. This process also benefits in identifying more MSSes, in turn, the incremental MSS information helps select a better node for next exploration, thereby achieving an interaction of incremental information. Two theorems and two corollaries regarding interactive incremental information are proposed and the feasibility of our MARCO-MSS4MUS algorithm is theoretically analyzed. Experiments on standard MUS benchmark instances show the superiority of the proposed algorithm over state-of-the-art algorithms. Both the enumeration efficiency and the number of enumerated wins of the proposed algorithm are significantly improved compared with existing algorithms.
, authors=Luyu Jiang, Dantong Ouyang, Qi Zhang, Ran Tai, Liming Zhang*, authorsList=Luyu Jiang, Dantong Ouyang, Qi Zhang, Ran Tai, Liming Zhang, authorCompany=null, correspAuthors=Liming Zhang, authorNote=
born in 1998. PhD candidate. Student member of CCF. Her main research interests include SAT, combinatorial optimization, and model-based diagnosis problem
born in 1968. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interests include automatic reasoning and model-based diagnosis problem. (ouyd@jlu.edu.cn)
born in 1998. PhD candidate. Student member of CCF. His main research interests include SAT and model-based diagnosis problem
born in 1997. PhD candidate. Student member of CCF. His main research interests include combinatorial optimization and model-based diagnosis problem
born in 1980. PhD, senior engineer. Senior member of CCF. His main research interests include SAT and model-based diagnosis problem
, correspAuthorsNote=null, copyrightStatement=Copyright © 2025 Journal of Computer Research and Development. All rights reserved., copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=null, magXml=null, pdfUrl=null, pdf=null, pdfFileSize=null, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=null, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=null, mapNumber=null, fund=null), CN=ArticleExt(id=1327010738629095517, articleId=1327010734699032651, tenantId=1146029695717560320, journalId=1324759914146529478, language=CN, title=基于增量信息交互的极小不可满足子集求解算法, columnId=1325489892104483745, journalTitle=计算机研究与发展, columnName=人工智能, runingTitle=null, highlight=null, articleAbstract=
极小不可满足子集(minimal unsatisfiable subset,MUS)的求解是理论计算机科学的重要问题. 由于MUS的个数随问题规模呈指数级增长,现有算法致力于在合适的时间限制内求解出尽可能多的MUS. 在庞大的搜索空间中,选择合适的节点来扩展可以大幅减小收缩和扩充操作的时间开销,从而提高算法的求解效率. 提出一种基于增量信息交互的MUS求解算法MARCO-MSS4MUS,利用MUS、极小修正集(minimal correction set,MCS)和极大可满足子集(maximal satisfiable subset,MSS)之间的对偶和互补关系,在采用MARCO算法框架增量求解MSS 和MUS的过程中,根据已求解的MSS的交集和并集信息辅助选择节点来扩展,即通过增量的MSS信息启发用于扩展节点选择以加速MUS枚举,这一过程同时利于算法找到更多的MSS,在枚举过程中新识别出的MSS又能辅助下一轮扩展节点的选择,从而实现了增量信息的有效交互. 针对交互的增量信息提出2个定理及2个推论,从理论角度分析了MARCO-MSS4MUS算法的可行性,并通过MUS标准测试用例上的实验验证了所提算法相较于当前先进算法的优越性,在部分测试用例上的结果显示所提算法的枚举效率和枚举获胜个数较已有算法均有显著的提高.
, authors=蒋璐宇, 欧阳丹彤, 张奇, 太然, 张立明*, authorsList=蒋璐宇, 欧阳丹彤, 张奇, 太然, 张立明, authorCompany=null, correspAuthors=张立明, authorNote=
 |
1998年生. 博士研究生. CCF学生会员. 主要研究方向为可满足性问题、组合优化问题、基于模型的诊断问题 |
 |
1968年生. 博士,教授,博士生导师. CCF高级会员. 主要研究方向为自动推理、基于模型的诊断问题 |
 |
1998年生. 博士研究生. CCF学生会员. 主要研究方向为可满足性问题和基于模型的诊断问题 |
 |
1997年生. 博士研究生. CCF学生会员. 主要研究方向为组合优化、基于模型的诊断问题 |
 |
1980年生. 博士,正高级工程师. CCF高级会员. 主要研究方向为可满足性问题和基于模型的诊断问题 |
, correspAuthorsNote=
, copyrightStatement=版权所有 © 2025 计算机研究与发展编辑部, copyrightOwner=null, extLink=null, articleAbsUrl=null, sourceXml=dI1fxYJtAWzxgNVFV4FgLQ==, magXml=dvtKqPy4ppyAK9VKi5VsvA==, pdfUrl=null, pdf=BNkKSNYPQRCWQq8fgl/L0A==, pdfFileSize=1105328, pdfExtLink=null, richHtmlUrl=null, mobilePdfUrl=null, reviewReport=null, pdfFirstPage=null, abstractGraph=ubaAPB42uh8tVtLJBLR6aQ==, abstractGraphContent=null, abstractVideo=null, citation=null, cebUrl=null, magXmlContent=y/yUl87+i96rPLduDLrshQ==, mapNumber=null, fund=null)}, authors=[Author(id=1327010739082080357, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, orderNo=0, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=jiangluyu1998@163.com, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1327010739136606310, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739082080357, language=EN, stringName=Luyu Jiang, firstName=Luyu, middleName=null, lastName=Jiang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"content":"
born in 1998. PhD candidate. Student member of CCF. Her main research interests include SAT, combinatorial optimization, and model-based diagnosis problem
"}, bioImg=null, bioContent=
born in 1998. PhD candidate. Student member of CCF. Her main research interests include SAT, combinatorial optimization, and model-based diagnosis problem
, aboutCorrespAuthor=null), CN=AuthorExt(id=1327010739207909479, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739082080357, language=CN, stringName=蒋璐宇, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"img":"GpNg/Pg3cVLjz+Op3l8zYQ==","content":"
1998年生. 博士研究生. CCF学生会员. 主要研究方向为可满足性问题、组合优化问题、基于模型的诊断问题
"}, bioImg=GpNg/Pg3cVLjz+Op3l8zYQ==, bioContent=
1998年生. 博士研究生. CCF学生会员. 主要研究方向为可满足性问题、组合优化问题、基于模型的诊断问题
, aboutCorrespAuthor=null)}, companyList=null), Author(id=1327010739279212649, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, orderNo=1, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=ouyd@jlu.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1327010739379875946, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739279212649, language=EN, stringName=Dantong Ouyang, firstName=Dantong, middleName=null, lastName=Ouyang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"content":"
born in 1968. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interests include automatic reasoning and model-based diagnosis problem. (ouyd@jlu.edu.cn)
"}, bioImg=null, bioContent=
born in 1968. PhD, professor, PhD supervisor. Senior member of CCF. Her main research interests include automatic reasoning and model-based diagnosis problem. (ouyd@jlu.edu.cn)
, aboutCorrespAuthor=null), CN=AuthorExt(id=1327010739459567723, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739279212649, language=CN, stringName=欧阳丹彤, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"img":"7bLggtRfWc81/92mtF+HLw==","content":"
1968年生. 博士,教授,博士生导师. CCF高级会员. 主要研究方向为自动推理、基于模型的诊断问题
"}, bioImg=7bLggtRfWc81/92mtF+HLw==, bioContent=
1968年生. 博士,教授,博士生导师. CCF高级会员. 主要研究方向为自动推理、基于模型的诊断问题
, aboutCorrespAuthor=null)}, companyList=null), Author(id=1327010739514093677, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, orderNo=2, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1327010739581202542, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739514093677, language=EN, stringName=Qi Zhang, firstName=Qi, middleName=null, lastName=Zhang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"content":"
born in 1998. PhD candidate. Student member of CCF. His main research interests include SAT and model-based diagnosis problem
"}, bioImg=null, bioContent=
born in 1998. PhD candidate. Student member of CCF. His main research interests include SAT and model-based diagnosis problem
, aboutCorrespAuthor=null), CN=AuthorExt(id=1327010739652505711, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739514093677, language=CN, stringName=张奇, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"img":"m/Fq2UFWUDuoz2occI3Ofg==","content":"
1998年生. 博士研究生. CCF学生会员. 主要研究方向为可满足性问题和基于模型的诊断问题
"}, bioImg=m/Fq2UFWUDuoz2occI3Ofg==, bioContent=
1998年生. 博士研究生. CCF学生会员. 主要研究方向为可满足性问题和基于模型的诊断问题
, aboutCorrespAuthor=null)}, companyList=null), Author(id=1327010739765751921, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, orderNo=3, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=null, emailSecond=null, emailThird=null, correspondingAuthor=0, authorType=1, ext={EN=AuthorExt(id=1327010739832860786, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739765751921, language=EN, stringName=Ran Tai, firstName=Ran, middleName=null, lastName=Tai, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"content":"
born in 1997. PhD candidate. Student member of CCF. His main research interests include combinatorial optimization and model-based diagnosis problem
"}, bioImg=null, bioContent=
born in 1997. PhD candidate. Student member of CCF. His main research interests include combinatorial optimization and model-based diagnosis problem
, aboutCorrespAuthor=null), CN=AuthorExt(id=1327010739899969651, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739765751921, language=CN, stringName=太然, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=null, address=null, bio={"img":"8wzuuJL3O2VJ4AR14cX5fg==","content":"
1997年生. 博士研究生. CCF学生会员. 主要研究方向为组合优化、基于模型的诊断问题
"}, bioImg=8wzuuJL3O2VJ4AR14cX5fg==, bioContent=
1997年生. 博士研究生. CCF学生会员. 主要研究方向为组合优化、基于模型的诊断问题
, aboutCorrespAuthor=null)}, companyList=null), Author(id=1327010739962884213, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, orderNo=4, firstName=null, middleName=null, lastName=null, nameCn=null, orcid=null, stid=null, country=null, authorPic=null, dead=0, email=limingzhang@jlu.edu.cn, emailSecond=null, emailThird=null, correspondingAuthor=1, authorType=1, ext={EN=AuthorExt(id=1327010740013215862, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739962884213, language=EN, stringName=Liming Zhang, firstName=Liming, middleName=null, lastName=Zhang, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=*, address=null, bio={"content":"
born in 1980. PhD, senior engineer. Senior member of CCF. His main research interests include SAT and model-based diagnosis problem
"}, bioImg=null, bioContent=
born in 1980. PhD, senior engineer. Senior member of CCF. His main research interests include SAT and model-based diagnosis problem
, aboutCorrespAuthor=null), CN=AuthorExt(id=1327010740063547511, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, authorId=1327010739962884213, language=CN, stringName=张立明, firstName=null, middleName=null, lastName=null, prefix=null, suffix=null, authorComment=null, nameInitials=null, affiliation=null, department=null, xref=*, address=null, bio={"img":"p7CovTa+pNlw0WoAHlcsog==","content":"
1980年生. 博士,正高级工程师. CCF高级会员. 主要研究方向为可满足性问题和基于模型的诊断问题
"}, bioImg=p7CovTa+pNlw0WoAHlcsog==, bioContent=
1980年生. 博士,正高级工程师. CCF高级会员. 主要研究方向为可满足性问题和基于模型的诊断问题
, aboutCorrespAuthor=null)}, companyList=null)], keywords=[Keyword(id=1327010740189376632, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, orderNo=1, keyword=minimal unsatisfiable subset (MUS)), Keyword(id=1327010741846126715, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, orderNo=2, keyword=maximal satisfiable subset (MSS)), Keyword(id=1327010742039064700, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, orderNo=3, keyword=infeasibility analysis), Keyword(id=1327010742232002685, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, orderNo=4, keyword=hitting set), Keyword(id=1327010742320083070, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, orderNo=5, keyword=duality), Keyword(id=1327010742399774847, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, orderNo=1, keyword=极小不可满足子集), Keyword(id=1327010742475272320, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, orderNo=2, keyword=极大可满足子集), Keyword(id=1327010742550769793, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, orderNo=3, keyword=不可行分析), Keyword(id=1327010742622072962, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, orderNo=4, keyword=碰集), Keyword(id=1327010742680793219, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, orderNo=5, keyword=对偶性)], refs=[Reference(id=1327010744119439503, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=1, rfOrder=0, authorNames=null, journalName=null, refType=null, unstructuredReference=Cai Shaowei, Zhang Xindi. Deep cooperation of CDCL and local search for SAT[C]//Proc of the 24th Int Conf on Theory and Applications of Satisfiability Testing. Berlin: Springer, 2021: 64−81, articleTitle=null, refAbstract=null), Reference(id=1327010744173965456, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=2, rfOrder=1, authorNames=null, journalName=null, refType=null, unstructuredReference=Cai Shaowei, Zhang Xindi, Fleury M, et al. Better decision heuristics in CDCL through local search and target phases[J]. Journal of Artificial Intelligence Research, 2022, 74: 1515−1563, articleTitle=null, refAbstract=null), Reference(id=1327010744236880018, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=3, rfOrder=2, authorNames=null, journalName=null, refType=null, unstructuredReference=Zheng Jiongzhi, He Kun, Zhou Jianrong, et al. BandMaxSAT: A local search MaxSAT solver with multi-armed bandit[C]//Proc of the 31st Int Joint Conf on Artificial Intelligence. Freiburg: IJCAI, 2022: 1901–1907, articleTitle=null, refAbstract=null), Reference(id=1327010744316571795, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=4, rfOrder=3, authorNames=null, journalName=null, refType=null, unstructuredReference=王荣全,欧阳丹彤,王艺源,等. 结合DOEC极小化策略的SAT求解极小碰集方法[J],计算机研究与发展,2018,55(6):1273–1281, articleTitle=null, refAbstract=null), Reference(id=1327010744417235092, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=4, rfOrder=4, authorNames=null, journalName=null, refType=null, unstructuredReference=Wang Rongquan, Ouyang Dantong, Wang Yiyuan, et al. Solving minimal hitting sets method with SAT based on DOEC minimization[J]. Journal of Computer Research and Development, 2018, 55(6): 1273–1281 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1327010744488538261, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=5, rfOrder=5, authorNames=null, journalName=null, refType=null, unstructuredReference=Metodi A, Stern R, Kalech M, et al. A novel SAT-based approach to model based diagnosis[J]. Journal of Artificial Intelligence Research, 2014, 51: 377−411, articleTitle=null, refAbstract=null), Reference(id=1327010744564035734, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=6, rfOrder=6, authorNames=null, journalName=null, refType=null, unstructuredReference=田乃予,欧阳丹彤,刘梦,等. 基于子集一致性检测的诊断解极小性判定方法[J],计算机研究与发展,2019,56(7):1396–1407, articleTitle=null, refAbstract=null), Reference(id=1327010744622755991, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=6, rfOrder=7, authorNames=null, journalName=null, refType=null, unstructuredReference=Tian Naiyu, Ouyang Dantong, Liu Meng, et al. A method of minimality-checking of diagnosis based on subset consistency detection[J]. Journal of Computer Research and Development, 2019, 56(7): 1396–1407 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1327010744689864856, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=7, rfOrder=8, authorNames=null, journalName=null, refType=null, unstructuredReference=Zhou Huisi, Ouyang Dantong, Zhao Xiangfu, et al. Two compacted models for efficient model-based diagnosis[C]//Proc of the 36th AAAI Conf on Artificial Intelligence. Palo Alto, CA: AAAI, 2022: 3885–3893, articleTitle=null, refAbstract=null), Reference(id=1327010746325643417, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=8, rfOrder=9, authorNames=null, journalName=null, refType=null, unstructuredReference=Ouyang Dantong, Liao Mengting, Ye Yuxin. Lightweight axiom pinpointing via replicated driver and customized SAT-solving[J]. Frontiers of Computer Science, 2023, 17(2): 172315, articleTitle=null, refAbstract=null), Reference(id=1327010746401140890, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=9, rfOrder=10, authorNames=null, journalName=null, refType=null, unstructuredReference=Arif M F, Mencía C, Marques-Silva J. Efficient MUS enumeration of Horn formulae with applications to axiom pinpointing[C]//Proc of the 18th Int Conf on Theory and Applications of Satisfiability Testing. Berlin: Springer, 2015: 324–342, articleTitle=null, refAbstract=null), Reference(id=1327010746459861147, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=10, rfOrder=11, authorNames=null, journalName=null, refType=null, unstructuredReference=Hunter A, Konieczny S. On the measure of conflicts: Shapley inconsistency values[J]. Artificial Intelligence, 2010, 174(14): 1007−1026, articleTitle=null, refAbstract=null), Reference(id=1327010746526970012, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=11, rfOrder=12, authorNames=null, journalName=null, refType=null, unstructuredReference=Xiao Guohui, Ma Yue. Inconsistency measurement based on variables in minimal unsatisfiable subsets[C]//Proc of the 20th European Conf on Artificial Intelligence. Ohmsha: IOS, 2012: 864–869, articleTitle=null, refAbstract=null), Reference(id=1327010746615050397, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=12, rfOrder=13, authorNames=null, journalName=null, refType=null, unstructuredReference=Shazli S Z, Tahoori M B. Using Boolean satisfiability for computing soft error rates in early design stages[J]. Microelectronics Reliability, 2010, 50(1): 149−159, articleTitle=null, refAbstract=null), Reference(id=1327010746686353566, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=13, rfOrder=14, authorNames=null, journalName=null, refType=null, unstructuredReference=Andraus Z, Liffiton M, Sakallah K. Reveal: A formal verification tool for Verilog designs[C]//Proc of the 15th Int Conf on Logic for Programming Artificial Intelligence and Reasoning. Berlin: Springer, 2008: 343–352, articleTitle=null, refAbstract=null), Reference(id=1327010746787016863, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=14, rfOrder=15, authorNames=null, journalName=null, refType=null, unstructuredReference=Liffiton M, Sakallah K. On finding all minimally unsatisfiable subformulas[G]//LNCS 3569: Proc of the 8th Int Conf on Theory & Applications of Satisfiability Testing. Berlin: Springer, 2005: 173–186, articleTitle=null, refAbstract=null), Reference(id=1327010746849931424, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=15, rfOrder=16, authorNames=null, journalName=null, refType=null, unstructuredReference=Liffiton M, Sakallah K. Algorithms for computing minimal unsatisfiable subsets of constraints[J]. Journal of Automated Reasoning, 2008, 40(1): 1−33, articleTitle=null, refAbstract=null), Reference(id=1327010746925428897, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=16, rfOrder=17, authorNames=null, journalName=null, refType=null, unstructuredReference=Bailey J, Stuckey P. Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization[C]//Proc of the 7th Int Workshop on Practical Aspects of Declarative Languages. Berlin: Springer, 2005: 174–186, articleTitle=null, refAbstract=null), Reference(id=1327010747009314978, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=17, rfOrder=18, authorNames=null, journalName=null, refType=null, unstructuredReference=Liffiton M, Malik A. Enumerating infeasibility: Finding multiple MUSes quickly[C]//Proc of the 10th Int Conf on AI and OR Techniques in Constriant Programming for Combinatorial Optimization Problems. Berlin: Springer, 2013: 160–175, articleTitle=null, refAbstract=null), Reference(id=1327010747101589667, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=18, rfOrder=19, authorNames=null, journalName=null, refType=null, unstructuredReference=Liffiton M, Previti A, Malik A, et al. Fast, flexible MUS enumeration[J]. Constraints, 2016, 21(2): 223−250, articleTitle=null, refAbstract=null), Reference(id=1327010747177087140, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=19, rfOrder=20, authorNames=null, journalName=null, refType=null, unstructuredReference=欧阳丹彤,高菡,田乃予,等. 基于双模型的MUS求解方法[J],计算机研究与发展,2019,56(12):2623−2631, articleTitle=null, refAbstract=null), Reference(id=1327010747290333349, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=19, rfOrder=21, authorNames=null, journalName=null, refType=null, unstructuredReference=Ouyang Dantong, Gao Han, Tian Naiyu, et al. MUS enumeration based on double-model[J]. Journal of Computer Research and Development, 2019, 56(12): 2623–2631 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1327010747416162470, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=20, rfOrder=22, authorNames=null, journalName=null, refType=null, unstructuredReference=蒋璐宇,欧阳丹彤,董博文,等. 针对MUS求解问题的加强剪枝策略[J],软件学报,2024,35(4):1964−1979, articleTitle=null, refAbstract=null), Reference(id=1327010747479077031, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=20, rfOrder=23, authorNames=null, journalName=null, refType=null, unstructuredReference=Jiang Luyu, Ouyang Dantong, Dong Bowen, et al. Enhanced pruning scheme for enumerating MUS[J]. Journal of Software, 2024, 35(4): 1964−1979 (in Chinese), articleTitle=null, refAbstract=null), Reference(id=1327010747546185896, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=21, rfOrder=24, authorNames=null, journalName=null, refType=null, unstructuredReference=Bendík J, Benes N, Cerna I, et al. Tunable online MUS/MSS enumeration[G]//LIPIcs 65: Proc of the 36th IARCS Annual Conf on Foundations of Software Technology and Theoretical Computer Science. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik, 2016: 50: 1–50: 13, articleTitle=null, refAbstract=null), Reference(id=1327010747609100457, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=22, rfOrder=25, authorNames=null, journalName=null, refType=null, unstructuredReference=Bendík J, Cerna I, Benes N. Recursive online enumeration of all minimal unsatisfiable subsets[G]//LNCS 11138: Proc of the 16th Int Symp on Automated Technology for Verification and Analysis. Berlin: Springer, 2018: 143–159, articleTitle=null, refAbstract=null), Reference(id=1327010747684597930, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=23, rfOrder=26, authorNames=null, journalName=null, refType=null, unstructuredReference=Bendík J, Cerna I. Replication-guided enumeration of minimal unsatisfiable subsets[C]//Proc of the 26th Int Conf on Principles and Practice of Constraint Programming. Berlin: Springer, 2020: 37–54, articleTitle=null, refAbstract=null), Reference(id=1327010747747512491, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=24, rfOrder=27, authorNames=null, journalName=null, refType=null, unstructuredReference=Bendík J, Cerna I. Rotation based MSS/MCS enumeration[C]//Proc of the 23rd Int Conf on Logic for Programming, Artificial Intelligence and Reasoning. Stockport, UK: EasyChair, 2020: 120–137, articleTitle=null, refAbstract=null), Reference(id=1327010747810427052, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=25, rfOrder=28, authorNames=null, journalName=null, refType=null, unstructuredReference=Bendík J, Meel K. Counting maximal satisfiable subsets[C]//Proc of the 35th AAAI Conf on Artificial Intelligence. Palo Alto, CA: AAAI, 2021: 3651–3660, articleTitle=null, refAbstract=null), Reference(id=1327010747877535917, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=26, rfOrder=29, authorNames=null, journalName=null, refType=null, unstructuredReference=Bendík J. On decomposition of maximal satisfiable subsets[C]//Proc of the 21st Conf on Formal Methods in Computer Aided Design. Piscataway, NJ: IEEE, 2021: 212−221, articleTitle=null, refAbstract=null), Reference(id=1327010747953033390, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=27, rfOrder=30, authorNames=null, journalName=null, refType=null, unstructuredReference=Previti A, Marques-Silva J. Partial MUS enumeration[C]//Proc of the 27th AAAI Conf on Artificial Intelligence. Palo Alto, CA: AAAI, 2013: 818–825, articleTitle=null, refAbstract=null), Reference(id=1327010748024336559, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, doi=null, pmid=null, pmcid=null, year=null, volume=null, issue=null, pageStart=null, pageEnd=null, url=null, language=null, rfNumber=28, rfOrder=31, authorNames=null, journalName=null, refType=null, unstructuredReference=Een N, Sorensson N. An extensible SAT-solver[G]//LNCS 2919: Proc of the 6th Int Conf on Theory and Applications of Satisfiability Testing. Berlin: Springer, 2004: 502–518, articleTitle=null, refAbstract=null)], funds=null, companyList=[AuthorCompany(id=1327010738851393630, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, xref=null, ext=[AuthorCompanyExt(id=1327010738859782239, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, companyId=1327010738851393630, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=College of Computer Science and Technology, Jilin University, Changchun 130012), AuthorCompanyExt(id=1327010738868170848, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, companyId=1327010738851393630, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=吉林大学计算机科学与技术学院 长春 130012)]), AuthorCompany(id=1327010738947862625, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, xref=null, ext=[AuthorCompanyExt(id=1327010738956251234, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, companyId=1327010738947862625, language=EN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=Key Laboratory of Symbol Computation and Knowledge Engineering (Jilin University), Ministry of Education, Changchun 130012), AuthorCompanyExt(id=1327010738973028451, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, companyId=1327010738947862625, language=CN, country=null, province=null, city=null, postcode=null, companyName=null, departmentName=null, remark=符号计算与知识工程教育部重点实验室(吉林大学) 长春 130012)])], figs=[ArticleFig(id=1327010742789845124, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, label=Figure 1, caption=
Hasse diagram, figureFileSmall=NoEZD1fsLF6BjStpnSiFqQ==, figureFileBig=ubaAPB42uh8tVtLJBLR6aQ==, tableContent=null), ArticleFig(id=1327010742856953989, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, label=图1, caption=
哈斯图, figureFileSmall=NoEZD1fsLF6BjStpnSiFqQ==, figureFileBig=ubaAPB42uh8tVtLJBLR6aQ==, tableContent=null), ArticleFig(id=1327010743041503367, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, label=Figure 2, caption=
Comparative results on win number of each algorithm under different time limits, figureFileSmall=hs7lkWahe2MN0M0uF6N7AA==, figureFileBig=IqpVoxmXV0tq3m3/XJalhw==, tableContent=null), ArticleFig(id=1327010743100223624, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, label=图2, caption=
各算法在不同时间限制下的获胜个数对比结果, figureFileSmall=hs7lkWahe2MN0M0uF6N7AA==, figureFileBig=IqpVoxmXV0tq3m3/XJalhw==, tableContent=null), ArticleFig(id=1327010743247024265, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, label=Table 1, caption=
Comparative Results on the Number of MUS of Each Algorithm Under 0.5 h Time Limit, figureFileSmall=null, figureFileBig=null, tableContent=
| 测试用例 | 本文算法 | MARCO+[18] | MARCO- MAM[19] | MARCO- ABC[20] |
|---|
| 注:黑体数值表示MUS枚举个数的最优结果. |
| fdmus_b14_134 | 491 | 158 | 181 | 173 |
| fdmus_b14_141 | 53 | 82 | 83 | 84 |
| fdmus_b14_210 | 1 | 80 | 78 | 80 |
| fdmus_b15_291 | 54 | 51 | 52 | 53 |
| fdmus_b15_294 | 51 | 47 | 44 | 47 |
| fdmus_b15_304 | 1 | 32 | 33 | 31 |
| fdmus_b15_421 | 1 | 151 | 142 | 157 |
| fdmus_b15_463 | 2 | 174 | 191 | 189 |
| fdmus_b17_1037 | 1 | 338 | 539 | 500 |
| fdmus_b17_1324 | 2 | 58 | 77 | 57 |
| fdmus_b17_1456 | 2 | 195 | 178 | 186 |
| fdmus_b17_420 | 197 | 158 | 154 | 161 |
| fdmus_b20_141 | 1 | 16 | 17 | 18 |
| fdmus_b20_171 | 1 | 20 | 19 | 21 |
| fdmus_b20_238 | 145 | 44 | 48 | 45 |
| fdmus_b20_341 | 945 | 188 | 190 | 176 |
| fdmus_b20_349 | 1 | 33 | 31 | 33 |
| fdmus_b20_381 | 1 | 29 | 32 | 31 |
| fdmus_b20_492 | 215 | 38 | 40 | 40 |
| fdmus_b20_498 | 520 | 61 | 65 | 65 |
| fdmus_b21_111 | 1 | 14 | 13 | 14 |
| fdmus_b21_112 | 1 | 14 | 13 | 15 |
| fdmus_b21_167 | 1 | 35 | 31 | 34 |
| fdmus_b21_481 | 115 | 31 | 28 | 31 |
| fdmus_b21_96 | 94 | 115 | 118 | 118 |
| fdmus_b22_102 | 1 | 34 | 36 | 36 |
| fdmus_b22_113 | 1 | 12 | 12 | 12 |
| fdmus_b22_133 | 1 | 46 | 40 | 54 |
| fdmus_b22_172 | 1 | 21 | 22 | 23 |
| fdmus_b22_241 | 61 | 29 | 27 | 30 |
| fdmus_b22_356 | 1 | 14 | 14 | 14 |
| fdmus_b22_488 | 480 | 51 | 47 | 51 |
| fdmus_b22_600 | 1 | 15 | 14 | 20 |
| fdmus_b22_662 | 1 | 23 | 23 | 20 |
), ArticleFig(id=1327010743398019210, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, label=表1, caption=
0.5 h时间限制下各算法枚举的MUS个数对比结果
, figureFileSmall=null, figureFileBig=null, tableContent=
| 测试用例 | 本文算法 | MARCO+[18] | MARCO- MAM[19] | MARCO- ABC[20] |
|---|
| 注:黑体数值表示MUS枚举个数的最优结果. |
| fdmus_b14_134 | 491 | 158 | 181 | 173 |
| fdmus_b14_141 | 53 | 82 | 83 | 84 |
| fdmus_b14_210 | 1 | 80 | 78 | 80 |
| fdmus_b15_291 | 54 | 51 | 52 | 53 |
| fdmus_b15_294 | 51 | 47 | 44 | 47 |
| fdmus_b15_304 | 1 | 32 | 33 | 31 |
| fdmus_b15_421 | 1 | 151 | 142 | 157 |
| fdmus_b15_463 | 2 | 174 | 191 | 189 |
| fdmus_b17_1037 | 1 | 338 | 539 | 500 |
| fdmus_b17_1324 | 2 | 58 | 77 | 57 |
| fdmus_b17_1456 | 2 | 195 | 178 | 186 |
| fdmus_b17_420 | 197 | 158 | 154 | 161 |
| fdmus_b20_141 | 1 | 16 | 17 | 18 |
| fdmus_b20_171 | 1 | 20 | 19 | 21 |
| fdmus_b20_238 | 145 | 44 | 48 | 45 |
| fdmus_b20_341 | 945 | 188 | 190 | 176 |
| fdmus_b20_349 | 1 | 33 | 31 | 33 |
| fdmus_b20_381 | 1 | 29 | 32 | 31 |
| fdmus_b20_492 | 215 | 38 | 40 | 40 |
| fdmus_b20_498 | 520 | 61 | 65 | 65 |
| fdmus_b21_111 | 1 | 14 | 13 | 14 |
| fdmus_b21_112 | 1 | 14 | 13 | 15 |
| fdmus_b21_167 | 1 | 35 | 31 | 34 |
| fdmus_b21_481 | 115 | 31 | 28 | 31 |
| fdmus_b21_96 | 94 | 115 | 118 | 118 |
| fdmus_b22_102 | 1 | 34 | 36 | 36 |
| fdmus_b22_113 | 1 | 12 | 12 | 12 |
| fdmus_b22_133 | 1 | 46 | 40 | 54 |
| fdmus_b22_172 | 1 | 21 | 22 | 23 |
| fdmus_b22_241 | 61 | 29 | 27 | 30 |
| fdmus_b22_356 | 1 | 14 | 14 | 14 |
| fdmus_b22_488 | 480 | 51 | 47 | 51 |
| fdmus_b22_600 | 1 | 15 | 14 | 20 |
| fdmus_b22_662 | 1 | 23 | 23 | 20 |
), ArticleFig(id=1327010743519654027, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, label=Table 2, caption=
Comparative Results on the Number of MUS of Each Algorithm Under 1 h Time Limit, figureFileSmall=null, figureFileBig=null, tableContent=
| 测试用例 | 本文算法 | MARCO+[18] | MARCO- MAM[19] | MARCO- ABC[20] |
|---|
| 注:黑体数值表示MUS枚举个数的最优结果. |
| fdmus_b14_134 | 1367 | 513 | 574 | 584 |
| fdmus_b14_141 | 484 | 199 | 194 | 203 |
| fdmus_b14_210 | 4 | 205 | 183 | 204 |
| fdmus_b15_291 | 345 | 102 | 109 | 108 |
| fdmus_b15_294 | 190 | 100 | 93 | 100 |
| fdmus_b15_304 | 175 | 59 | 53 | 63 |
| fdmus_b15_421 | 395 | 294 | 305 | 327 |
| fdmus_b15_463 | 2 | 369 | 420 | 405 |
| fdmus_b17_1037 | 938 | 338 | 1082 | 1085 |
| fdmus_b17_1324 | 188 | 117 | 149 | 116 |
| fdmus_b17_1456 | 2 | 386 | 383 | 374 |
| fdmus_b17_420 | 537 | 318 | 323 | 327 |
| fdmus_b20_141 | 1 | 32 | 35 | 36 |
| fdmus_b20_171 | 1 | 38 | 35 | 38 |
| fdmus_b20_238 | 500 | 93 | 92 | 92 |
| fdmus_b20_341 | 2424 | 629 | 600 | 639 |
| fdmus_b20_349 | 1 | 66 | 68 | 63 |
| fdmus_b20_381 | 1 | 66 | 71 | 67 |
| fdmus_b20_492 | 806 | 88 | 89 | 86 |
| fdmus_b20_498 | 1528 | 179 | 176 | 200 |
| fdmus_b21_111 | 1 | 27 | 29 | 29 |
| fdmus_b21_112 | 1 | 26 | 26 | 27 |
| fdmus_b21_167 | 1 | 70 | 63 | 70 |
| fdmus_b21_481 | 924 | 64 | 63 | 65 |
| fdmus_b21_96 | 987 | 300 | 309 | 311 |
| fdmus_b22_102 | 1 | 63 | 67 | 70 |
| fdmus_b22_113 | 1 | 23 | 23 | 25 |
| fdmus_b22_133 | 3 | 100 | 98 | 108 |
| fdmus_b22_172 | 1 | 42 | 41 | 42 |
| fdmus_b22_241 | 313 | 60 | 60 | 60 |
| fdmus_b22_356 | 1 | 28 | 27 | 27 |
| fdmus_b22_488 | 1524 | 110 | 106 | 122 |
| fdmus_b22_600 | 1 | 26 | 34 | 29 |
| fdmus_b22_662 | 1 | 47 | 44 | 38 |
), ArticleFig(id=1327010743771312268, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, label=表2, caption=
1 h时间限制下各算法枚举的MUS个数对比结果
, figureFileSmall=null, figureFileBig=null, tableContent=
| 测试用例 | 本文算法 | MARCO+[18] | MARCO- MAM[19] | MARCO- ABC[20] |
|---|
| 注:黑体数值表示MUS枚举个数的最优结果. |
| fdmus_b14_134 | 1367 | 513 | 574 | 584 |
| fdmus_b14_141 | 484 | 199 | 194 | 203 |
| fdmus_b14_210 | 4 | 205 | 183 | 204 |
| fdmus_b15_291 | 345 | 102 | 109 | 108 |
| fdmus_b15_294 | 190 | 100 | 93 | 100 |
| fdmus_b15_304 | 175 | 59 | 53 | 63 |
| fdmus_b15_421 | 395 | 294 | 305 | 327 |
| fdmus_b15_463 | 2 | 369 | 420 | 405 |
| fdmus_b17_1037 | 938 | 338 | 1082 | 1085 |
| fdmus_b17_1324 | 188 | 117 | 149 | 116 |
| fdmus_b17_1456 | 2 | 386 | 383 | 374 |
| fdmus_b17_420 | 537 | 318 | 323 | 327 |
| fdmus_b20_141 | 1 | 32 | 35 | 36 |
| fdmus_b20_171 | 1 | 38 | 35 | 38 |
| fdmus_b20_238 | 500 | 93 | 92 | 92 |
| fdmus_b20_341 | 2424 | 629 | 600 | 639 |
| fdmus_b20_349 | 1 | 66 | 68 | 63 |
| fdmus_b20_381 | 1 | 66 | 71 | 67 |
| fdmus_b20_492 | 806 | 88 | 89 | 86 |
| fdmus_b20_498 | 1528 | 179 | 176 | 200 |
| fdmus_b21_111 | 1 | 27 | 29 | 29 |
| fdmus_b21_112 | 1 | 26 | 26 | 27 |
| fdmus_b21_167 | 1 | 70 | 63 | 70 |
| fdmus_b21_481 | 924 | 64 | 63 | 65 |
| fdmus_b21_96 | 987 | 300 | 309 | 311 |
| fdmus_b22_102 | 1 | 63 | 67 | 70 |
| fdmus_b22_113 | 1 | 23 | 23 | 25 |
| fdmus_b22_133 | 3 | 100 | 98 | 108 |
| fdmus_b22_172 | 1 | 42 | 41 | 42 |
| fdmus_b22_241 | 313 | 60 | 60 | 60 |
| fdmus_b22_356 | 1 | 28 | 27 | 27 |
| fdmus_b22_488 | 1524 | 110 | 106 | 122 |
| fdmus_b22_600 | 1 | 26 | 34 | 29 |
| fdmus_b22_662 | 1 | 47 | 44 | 38 |
), ArticleFig(id=1327010743897141389, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=EN, label=Table 3, caption=
Comparative Results on the Number of MUS of Each Algorithm Under 2 h Time Limit, figureFileSmall=null, figureFileBig=null, tableContent=
| 测试用例 | 本文算法 | MARCO+[18] | MARCO- MAM[19] | MARCO- ABC[20] |
|---|
| 注:黑体数值表示MUS枚举个数的最优结果. |
| fdmus_b14_134 | 2852 | 1566 | 1486 | 1664 |
| fdmus_b14_141 | 1422 | 642 | 598 | 642 |
| fdmus_b14_210 | 467 | 637 | 611 | 609 |
| fdmus_b15_291 | 587 | 231 | 252 | 253 |
| fdmus_b15_294 | 762 | 224 | 208 | 218 |
| fdmus_b15_304 | 468 | 143 | 124 | 144 |
| fdmus_b15_421 | 1398 | 581 | 689 | 673 |
| fdmus_b15_463 | 2 | 764 | 787 | 823 |
| fdmus_b17_1037 | 3593 | 338 | 2362 | 2356 |
| fdmus_b17_1324 | 473 | 228 | 290 | 229 |
| fdmus_b17_1456 | 2 | 766 | 746 | 750 |
| fdmus_b17_420 | 1082 | 738 | 664 | 673 |
| fdmus_b20_141 | 1 | 67 | 70 | 71 |
| fdmus_b20_171 | 1 | 74 | 74 | 74 |
| fdmus_b20_238 | 952 | 222 | 219 | 236 |
| fdmus_b20_341 | 5424 | 1562 | 1496 | 1623 |
| fdmus_b20_349 | 3 | 141 | 157 | 149 |
| fdmus_b20_381 | 3 | 162 | 170 | 158 |
| fdmus_b20_492 | 3043 | 352 | 375 | 322 |
| fdmus_b20_498 | 3091 | 552 | 510 | 518 |
| fdmus_b21_111 | 1 | 55 | 57 | 60 |
| fdmus_b21_112 | 1 | 53 | 52 | 53 |
| fdmus_b21_167 | 24 | 153 | 151 | 148 |
| fdmus_b21_481 | 2343 | 224 | 152 | 175 |
| fdmus_b21_96 | 1837 | 715 | 710 | 738 |
| fdmus_b22_102 | 4 | 136 | 135 | 133 |
| fdmus_b22_113 | 1 | 45 | 47 | 49 |
| fdmus_b22_133 | 259 | 226 | 223 | 229 |
| fdmus_b22_172 | 1 | 88 | 89 | 86 |
| fdmus_b22_241 | 898 | 145 | 136 | 142 |
| fdmus_b22_356 | 1 | 63 | 58 | 62 |
| fdmus_b22_488 | 3426 | 428 | 390 | 476 |
| fdmus_b22_600 | 1 | 62 | 62 | 69 |
| fdmus_b22_662 | 1 | 81 | 76 | 75 |
), ArticleFig(id=1327010743976833166, tenantId=1146029695717560320, journalId=1324759914146529478, articleId=1327010734699032651, language=CN, label=表3, caption=
2 h时间限制下各算法枚举的MUS个数对比结果
, figureFileSmall=null, figureFileBig=null, tableContent=
| 测试用例 | 本文算法 | MARCO+[18] | MARCO- MAM[19] | MARCO- ABC[20] |
|---|
| 注:黑体数值表示MUS枚举个数的最优结果. |
| fdmus_b14_134 | 2852 | 1566 | 1486 | 1664 |
| fdmus_b14_141 | 1422 | 642 | 598 | 642 |
| fdmus_b14_210 | 467 | 637 | 611 | 609 |
| fdmus_b15_291 | 587 | 231 | 252 | 253 |
| fdmus_b15_294 | 762 | 224 | 208 | 218 |
| fdmus_b15_304 | 468 | 143 | 124 | 144 |
| fdmus_b15_421 | 1398 | 581 | 689 | 673 |
| fdmus_b15_463 | 2 | 764 | 787 | 823 |
| fdmus_b17_1037 | 3593 | 338 | 2362 | 2356 |
| fdmus_b17_1324 | 473 | 228 | 290 | 229 |
| fdmus_b17_1456 | 2 | 766 | 746 | 750 |
| fdmus_b17_420 | 1082 | 738 | 664 | 673 |
| fdmus_b20_141 | 1 | 67 | 70 | 71 |
| fdmus_b20_171 | 1 | 74 | 74 | 74 |
| fdmus_b20_238 | 952 | 222 | 219 | 236 |
| fdmus_b20_341 | 5424 | 1562 | 1496 | 1623 |
| fdmus_b20_349 | 3 | 141 | 157 | 149 |
| fdmus_b20_381 | 3 | 162 | 170 | 158 |
| fdmus_b20_492 | 3043 | 352 | 375 | 322 |
| fdmus_b20_498 | 3091 | 552 | 510 | 518 |
| fdmus_b21_111 | 1 | 55 | 57 | 60 |
| fdmus_b21_112 | 1 | 53 | 52 | 53 |
| fdmus_b21_167 | 24 | 153 | 151 | 148 |
| fdmus_b21_481 | 2343 | 224 | 152 | 175 |
| fdmus_b21_96 | 1837 | 715 | 710 | 738 |
| fdmus_b22_102 | 4 | 136 | 135 | 133 |
| fdmus_b22_113 | 1 | 45 | 47 | 49 |
| fdmus_b22_133 | 259 | 226 | 223 | 229 |
| fdmus_b22_172 | 1 | 88 | 89 | 86 |
| fdmus_b22_241 | 898 | 145 | 136 | 142 |
| fdmus_b22_356 | 1 | 63 | 58 | 62 |
| fdmus_b22_488 | 3426 | 428 | 390 | 476 |
| fdmus_b22_600 | 1 | 62 | 62 | 69 |
| fdmus_b22_662 | 1 | 81 | 76 | 75 |
)], attaches=null, journal=Journal(id=1324759606947315908, delFlag=0, nameCn=计算机研究与发展, nameEn=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, issn=1000-1239, eissn=null, cn=11-1777/TP, coden=null, periodic=0, language=CN, oaType=null, ccby=null, superviseOffice=null, ownerOffice=null, pubOffice=null, editorOffice=null, officeType=null, aims=null, clcCode=null, officeProv=null, officeCity=null, officeAddr=null, officeZip=null, officeEmail=null, officePhone=null, editDirector=null, officeDirector=null, officeDirectorPhone=null, officeStaffNum=null, officeEmpNum=null, coverPicUrl=k2l8zgqwstuxxevFX2qxVA==, journalPrice=null, startedYear=null, abbrevIsoEn=Journal of Computer Research and Development, journalRemark=null, publicationField=null, createdTime=1793776903141, updatedTime=1793850698612, createdBy=18614031015, updatedBy=13701087609, firstLetterCn=J, firstLetterEn=J, subjectCode=Electronic Information, subjectName=null, subjectCodeEn=Electronic Information, subjectNameEn=null, picCn=k2l8zgqwstuxxevFX2qxVA==, picEn=r6k0Ry+RD+c/VXj5QarmDw==, jcr=null, cjcr=null, exts=[JournalExt(id=1325069127710286688, language=CN, name=计算机研究与发展, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698640, updatedTime=1793850698640, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""}), JournalExt(id=1325069127777395553, language=EN, name=Journal of Computer Research and Development, nameHistory1=null, nameHistory2=null, managedBy=, sponsoredBy=, publishedBy=, editorOffice=, officeProv=null, officeCity=null, officeAddr=, officeZip=, editDirector=, officeDirector=null, officePhone=null, coverPicUrl=null, journalRemark=, submitArticleUrl=null, websiteUrl=, createdTime=1793850698656, updatedTime=1793850698656, createdBy=13701087609, updatedBy=13701087609, submissionGuidelinesUrl=, submissionAuthorUrl=https://crad.ict.ac.cn/journalx/authorLogOn.action, submissionEditorUrl=https://crad.ict.ac.cn/journalx/editorLogOn.action, submissionReviewUrl=https://crad.ict.ac.cn/journalx/expertLogOn.action, submissionCeEditorUrl=https://crad.ict.ac.cn/journalx/editorInChiefLogOn.action, submissionAeEditorUrl=, option={"copyright":""})], databaseList=null, tenantJournalId=1324759914146529478, websiteList=[Website(id=1325070300139892771, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN, language=CN, createTime=1793850978169, createBy=18614031015, updateTime=1793851040259, updateBy=18614031015, name=计算机研究与发展-中文, tplId=1146099689490845704, title=计算机研究与发展, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070893751349360, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=articleTextType, value=kx, createTime=1793851119697, updateTime=1793851119697, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893730377837, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=banner, value=null, createTime=1793851119692, updateTime=1793851119692, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893772320883, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=grayFlag, value=0, createTime=1793851119702, updateTime=1793851119702, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893721989228, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851119690, updateTime=1793851119690, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893784903797, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=minRunFlag, value=0, createTime=1793851119705, updateTime=1793851119705, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893742960751, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/file/pic, createTime=1793851119695, updateTime=1793851119695, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893780709492, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=silenceFlag, value=0, createTime=1793851119704, updateTime=1793851119704, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893738766446, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_cn_619/, createTime=1793851119694, updateTime=1793851119694, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893755543665, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeColor, value=null, createTime=1793851119698, updateTime=1793851119698, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070893763932274, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300139892771, code=themeStyle, value=null, createTime=1793851119700, updateTime=1793851119700, creator=18614031015, updator=18614031015)]), Website(id=1325070300580294698, webName=null, webTitle=null, webDomain=null, webCopyrigh=null, webIpcNo=null, seoTitle=null, seoKeywords=null, seoDescription=null, tenantJournalId=null, journalId=1324759914146529478, journalNameCn=null, journalNameEn=null, grayFlag=null, tenantId=1146029695717560320, platformId=null, journalGroupId=null, journalGroupNameCn=null, journalGroupNameEn=null, type=1, domain=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN, language=EN, createTime=1793850978274, createBy=18614031015, updateTime=1793851036638, updateBy=18614031015, name=计算机研究与发展-英文, tplId=1146101810881728533, title=Journal of Computer Research and Development, delFlag=0, indexPage=/home, props=[WebsiteProps(id=1325070925288321148, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=articleTextType, value=kx, createTime=1793851127216, updateTime=1793851127216, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925263155321, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=banner, value=null, createTime=1793851127210, updateTime=1793851127210, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925309292671, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=grayFlag, value=0, createTime=1793851127221, updateTime=1793851127221, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925254766712, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=logo, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic?fileId=U27tDsy717YF7XSPA+Vwdw==, createTime=1793851127208, updateTime=1793851127208, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925326069889, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=minRunFlag, value=0, createTime=1793851127225, updateTime=1793851127225, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925279932539, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=picServerUrl, value=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/file/pic, createTime=1793851127214, updateTime=1793851127214, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925317681280, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=silenceFlag, value=0, createTime=1793851127223, updateTime=1793851127223, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925271543930, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=staticResourcePath, value=https://castjournals.cast.org.cn/joweb/cast_kjdb_en_623/, createTime=1793851127212, updateTime=1793851127212, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925292515453, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeColor, value=null, createTime=1793851127217, updateTime=1793851127217, creator=18614031015, updator=18614031015), WebsiteProps(id=1325070925300904062, tenantId=1146029695717560320, journalId=null, journalGroupId=null, siteId=1325070300580294698, code=themeStyle, value=null, createTime=1793851127219, updateTime=1793851127219, creator=18614031015, updator=18614031015)])], journalTitle=计算机研究与发展, weixinUrl=null, journalUrl=https://crad.ict.ac.cn/, iacademicId=null, status=1, seqNo=null, journalTitleEn=Journal of Computer Research and Development, journalPhotoCn=k2l8zgqwstuxxevFX2qxVA==, journalPhotoEn=r6k0Ry+RD+c/VXj5QarmDw==, journalFirstLetter=J, journalRecommend=null, journalNew=null, journalCollection=null, jcrJf=null, cjcrJf=null, jcrJfStr=null, cjcrJfStr=null, submissionFirstDecision=null, sciSubjectClassification=null, casSubjectClassification=null, citeScore=null, totalCitationFrequency=null, icpCode=null, psCode=null, advertisingLicenseCode=null, copyrightInformation=null, country=null, option=, provinceCode=null, provinceName=null, collectFlag=false, interPubPlatform=, interPubPlatformUrl=null), detailUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/10.7544/issn1000-1239.202440326, detailUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/10.7544/issn1000-1239.202440326, pdfUrlCn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/CN/PDF/10.7544/issn1000-1239.202440326, pdfUrlEn=https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/PDF/10.7544/issn1000-1239.202440326, aliStartDate=0, aliEndDate=0, collectionFlag=false, citedCount=null, citedUrl=null, previewStatus=0, delFlag=0, hasFullText=1, orderTime=1746028800000, fullTextJson=null, articleText=null, reference=null)