activity
20002003
most citedMany Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances

15 citations · 17 across the 2 of their papers we have counts for

collaborators

7 papers

cs.LO20032 cited

A Development Calculus for Specifications

Wei Li

A first order inference system, called R-calculus, is defined to develop the specifications. It is used to eliminate the laws which is not consistent with the user's requirements.…

cs.CC200315 cited

Many Hard Examples in Exact Phase Transitions with Application to Generating Hard Satisfiable Instances

Ke Xu, Wei Li

This paper first analyzes the resolution complexity of two random CSP models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the thres…

cs.LO2001

A Logical Framework for Convergent Infinite Computations

Wei Li, Shilong Ma, Yuefei Sui +1

Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computat…

cs.AI2000

On the Average Similarity Degree between Solutions of Random k-SAT and Random CSPs

Ke Xu, Wei Li

To study the structure of solutions for random k-SAT and random CSPs, this paper introduces the concept of average similarity degree to characterize how solutions are similar to ea…

cs.AI2000

The SAT Phase Transition

Ke Xu, Wei Li

Phase transition is an important feature of SAT problem. For random k-SAT model, it is proved that as r (ratio of clauses to variables) increases, the structure of solutions will u…

cs.CC2000

An Average Analysis of Backtracking on Random Constraint Satisfaction Problems

Ke Xu, Wei Li

In this paper we propose a random CSP model, called Model GB, which is a natural generalization of standard Model B. It is proved that Model GB in which each constraint is easy to…