软件所计算机科学国家重点实验室的博士生刘明昊,针对人工智能和理论计算机科学中的基础问题之一——最大可满足性问题(MaxSAT),提出了一种基于图神经网络的深度学习系统,在求解大规模的困难MaxSAT实例时可以快速获得更高质量的解。该研究成果以“Can...
maxsat问题的完备算法研究 摘要 现实生活中会存在很多约束，需要在所有约束被满足或尽量满足的情况下制定出一种最优解决方案，这一类问题被称为约束满足问题（Constraint Satisfaction Problem , CSP）。本文的研究重点最大可满足性问题（Maximum Satisfiability Problem , MaxSAT）是一类特殊的约束满足问题，其目标是对...
The traditional simulated annealing algorithm had some disadvantages in solving Max-SAT problem, such as slow convergence speed, weak local search ability and invalid blind disturbance. Therefore, an improved fast simulated annealing algorithm was proposed. Aiming at the randomness and bl...
1.In order to find the test activating aggressors as many as possible,we first map the objective of test generation into a weighted Max-SAT problem,and then solve it by using SAT solver to get required patterns.为了能够激活尽可能多的侵略线以造成受害线上的最大脉冲噪声,首先将测试生成问题转化...
On Solving the Partial MAX-SAT Problem Boolean Satisfiability (SAT) has seen many successful applications in various fields such as Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be required/preferable to use variations of the general......
M拇SAT求解中的搜索和推理专业:计算机软件与理论博士生:林瀚指导老师:**乐教授摘要命题逻辑的可满足性问题(SAT)是计算机科学中的核心问题.最大可满足问题(M措SAT)是SAT问题的一个自然的扩展.对于给定的CNF公式,M册SAT问题的目标是找到一个赋值使其满足最多的子句.M孵SAT是一个重要的NP一难优化问题.由于人工智能...
It is shown that the MAX2SAT problem is NP-complete even if every variable appears in at most three clauses. However, if every variable appears in at most two clauses, it is shown that it (and even the general MAXSAT problem) can be solved in linear time. When every variable appears...
A polynomial-time algorithm for reducing the number of variables in MAX SAT problem. Science in China (Series E), 40(3):301- 311, June 1997.M. Shaohan, L. Dongmin, A polynomial-time algorithm for reducing the number of variables in MAX SAT problem, Sci. China (Series E) 40 (3) ...
6) Min-max problem min-max问题 1. In addition,the optimization in MPC is formulated as a min-max problem,in which the data uncertainties have been taken into account. 进一步将此min-max问题转换为一个等效的非线性min问题,并采用多步线性化方法实现快速求解,解决了传统min-max方法在线计算负荷高...
The Maximum Satisfiability (MaxSAT) problem is the problem of finding a truth assignment that maximizes the number of satisfied clauses of a given Boolean formula in Conjunctive Normal Form (CNF). Many exact solvers for MaxSAT have been developed during recent years, and many of them were ...