4513 search results - page 325 / 903 » Logic programming with satisfiability |
139
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
163
click to vote
ENTCS
2010
15 years 4 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
153
click to vote
SIAMJO
2008
15 years 4 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
106
click to vote
AMAI
2002
Springer
15 years 4 months ago
2002
Springer
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does n...
137
click to vote
SIAMJO
2010
14 years 11 months ago
2010
Necessary first-order sequential optimality conditions provide adequate theoretical tools to justify stopping criteria for nonlinear programming solvers. These conditions are sati...