In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （...In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.展开更多
As a complementary technology to Binary Decision Diagram-based(BDD-based) symbolic model checking, the verification techniques on Boolean satisfiability problem have gained an increasing wide of applications over the ...As a complementary technology to Binary Decision Diagram-based(BDD-based) symbolic model checking, the verification techniques on Boolean satisfiability problem have gained an increasing wide of applications over the last few decades, which brings a dramatic improvement for automatic verification. In this paper, we firstly introduce the theory about the Boolean satisfiability verification, including the description on the problem of Boolean satisfiability verification, Davis-Putnam-Logemann-Loveland(DPLL) based complete verification algorithm, and all kinds of solvers generated and the logic languages used by those solvers. Moreover, we formulate a large number optimizations of technique revolutions based on Boolean SATisfiability(SAT) and Satisfiability Modulo Theories(SMT) solving in detail, including incomplete methods such as bounded model checking, and other methods for concurrent programs model checking. Finally, we point out the major challenge pervasively in industrial practice and prospect directions for future research in the field of formal verification.展开更多
The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most loca...The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most local search algorithms including tabu search rely on the 1-flip neighbourhood structure. In this work, we introduce a tabu search algorithm that makes use of the multilevel paradigm for solving MAX-SAT problems. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. This process aims at looking at the search as a multilevel process operating in a coarse-to-fine strategy evolving from k-flip neighbourhood to 1-flip neighbourhood-based structure. Experimental results comparing the multilevel tabu search against its single level variant are presented.展开更多
For bipartite angle consensus tracking and vibration suppression of multiple Timoshenko manipulator systems with time-varying actuator faults,parameter and modeling uncertainties,and unknown disturbances,a novel distr...For bipartite angle consensus tracking and vibration suppression of multiple Timoshenko manipulator systems with time-varying actuator faults,parameter and modeling uncertainties,and unknown disturbances,a novel distributed boundary event-triggered control strategy is proposed in this work.In contrast to the earlier findings,time-varying consensus tracking and actuator defects are taken into account simultaneously.In addition,the constructed event-triggered control mechanism can achieve a more flexible design because it is not required to satisfy the input-to-state condition.To achieve the control objectives,some new integral control variables are given by using back-stepping technique and boundary control.Moreover,adaptive neural networks are applied to estimate system uncertainties.With the proposed event-triggered scheme,control inputs can reduce unnecessary updates.Besides,tracking errors and vibration states of the closed-looped network can be exponentially convergent into some small fields,and Zeno behaviors can be excluded.At last,some simulation examples are given to state the effectiveness of the control algorithms.展开更多
Dear Editor,This letter studies finite-time input-to-state stability(FTISS)for impulsive switched systems.A set of Lyapunov-based conditions are established for guaranteeing FTISS property.When constituent modes gover...Dear Editor,This letter studies finite-time input-to-state stability(FTISS)for impulsive switched systems.A set of Lyapunov-based conditions are established for guaranteeing FTISS property.When constituent modes governing continuous dynamics are FTISS and discrete dynamics involving impulses are destabilizing,the FTISS can be retained if impulsive-switching signals satisfy an average dwell-time(ADT)condition.展开更多
Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that ex...Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest.A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infea-sibility and is valuable for applications.However,little attention has been concentrated on extraction of minimum unsatisfiable core.In this paper,the relationship between maximal satisfiability and mini-mum unsatisfiability is presented and proved,then an efficient ant colony algorithm is proposed to derive an exact or nearly exact minimum unsatisfiable core based on the relationship.Finally,ex-perimental results on practical benchmarks compared with the best known approach are reported,and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.展开更多
The first phase of the pilot project of the national Knowledge Innovation Program (KIP) carried out at CAS is drawing to an end. The development of this multi-billion-yuan undertaking, launched in 1998 by the Chinese ...The first phase of the pilot project of the national Knowledge Innovation Program (KIP) carried out at CAS is drawing to an end. The development of this multi-billion-yuan undertaking, launched in 1998 by the Chinese government to promote science and technology (S&T) progress in the country, has attracted great attention. Recently, State leaders made a couple of inspection tours to CAS, saying the academy has展开更多
基金supported by 973 Program under Grant No.2006CB921106National Natural Science Foundation of China under Grant No.60635040the Key Grant Project of the Ministry of Education under Grant No.306020
文摘In this paper we present a classical parallel quantum algorithm for the satisfiability problem. We have exploited the classical parallelism of quantum algorithms developed in [G.L. Long and L. Xiao, Phys. Rev. A 69 （2004） 052303], so that additional acceleration can be gained by using classical parallelism. The quantum algorithm first estimates the number of solutions using the quantum counting algorithm, and then by using the quantum searching algorithm, the explicit solutions are found.
基金Supported by the National Natural Science Foundation of China(Nos.61063002,61100186,61262008)Guangxi Natural Science Foundation of China(2011GXNSFA018164,2011GXNSFA018166,2012GXNSFAA053220)the Key Project of Education Department of Guangxi
文摘As a complementary technology to Binary Decision Diagram-based(BDD-based) symbolic model checking, the verification techniques on Boolean satisfiability problem have gained an increasing wide of applications over the last few decades, which brings a dramatic improvement for automatic verification. In this paper, we firstly introduce the theory about the Boolean satisfiability verification, including the description on the problem of Boolean satisfiability verification, Davis-Putnam-Logemann-Loveland(DPLL) based complete verification algorithm, and all kinds of solvers generated and the logic languages used by those solvers. Moreover, we formulate a large number optimizations of technique revolutions based on Boolean SATisfiability(SAT) and Satisfiability Modulo Theories(SMT) solving in detail, including incomplete methods such as bounded model checking, and other methods for concurrent programs model checking. Finally, we point out the major challenge pervasively in industrial practice and prospect directions for future research in the field of formal verification.
文摘The maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean Formula. Most local search algorithms including tabu search rely on the 1-flip neighbourhood structure. In this work, we introduce a tabu search algorithm that makes use of the multilevel paradigm for solving MAX-SAT problems. The multilevel paradigm refers to the process of dividing large and difficult problems into smaller ones, which are hopefully much easier to solve, and then work backward towards the solution of the original problem, using a solution from a previous level as a starting solution at the next level. This process aims at looking at the search as a multilevel process operating in a coarse-to-fine strategy evolving from k-flip neighbourhood to 1-flip neighbourhood-based structure. Experimental results comparing the multilevel tabu search against its single level variant are presented.
基金supported in part by the National Key R&D Program of China(2021YFB3202200)the Natural Science Foundation of China(62203141)the Guangdong Basic and Applied Basic Research Foundation(2021B1515120017)。
文摘For bipartite angle consensus tracking and vibration suppression of multiple Timoshenko manipulator systems with time-varying actuator faults,parameter and modeling uncertainties,and unknown disturbances,a novel distributed boundary event-triggered control strategy is proposed in this work.In contrast to the earlier findings,time-varying consensus tracking and actuator defects are taken into account simultaneously.In addition,the constructed event-triggered control mechanism can achieve a more flexible design because it is not required to satisfy the input-to-state condition.To achieve the control objectives,some new integral control variables are given by using back-stepping technique and boundary control.Moreover,adaptive neural networks are applied to estimate system uncertainties.With the proposed event-triggered scheme,control inputs can reduce unnecessary updates.Besides,tracking errors and vibration states of the closed-looped network can be exponentially convergent into some small fields,and Zeno behaviors can be excluded.At last,some simulation examples are given to state the effectiveness of the control algorithms.
基金the National Natural Science Foundation of China(61833005)。
文摘Dear Editor,This letter studies finite-time input-to-state stability(FTISS)for impulsive switched systems.A set of Lyapunov-based conditions are established for guaranteeing FTISS property.When constituent modes governing continuous dynamics are FTISS and discrete dynamics involving impulses are destabilizing,the FTISS can be retained if impulsive-switching signals satisfy an average dwell-time(ADT)condition.
基金the National Natural Science Foundation of China (No.60603088)
文摘Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware.Furthermore,a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest.A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infea-sibility and is valuable for applications.However,little attention has been concentrated on extraction of minimum unsatisfiable core.In this paper,the relationship between maximal satisfiability and mini-mum unsatisfiability is presented and proved,then an efficient ant colony algorithm is proposed to derive an exact or nearly exact minimum unsatisfiable core based on the relationship.Finally,ex-perimental results on practical benchmarks compared with the best known approach are reported,and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.
文摘The first phase of the pilot project of the national Knowledge Innovation Program (KIP) carried out at CAS is drawing to an end. The development of this multi-billion-yuan undertaking, launched in 1998 by the Chinese government to promote science and technology (S&T) progress in the country, has attracted great attention. Recently, State leaders made a couple of inspection tours to CAS, saying the academy has
