Sciweavers

SAT
2010
Springer
161views Hardware» more  SAT 2010»
14 years 17 days ago
On Moderately Exponential Time for SAT
Evgeny Dantsin, Alexander Wolpert
SAT
2010
Springer
125views Hardware» more  SAT 2010»
14 years 17 days ago
Two Techniques for Minimizing Resolution Proofs
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding...
Scott Cotton
SAT
2010
Springer
148views Hardware» more  SAT 2010»
14 years 17 days ago
Automated Testing and Debugging of SAT and QBF Solvers
Robustness and correctness are essential criteria for SAT and QBF solvers. We develop automated testing and debugging techniques designed and optimized for SAT and QBF solver devel...
Robert Brummayer, Florian Lonsing, Armin Biere
SAT
2010
Springer
170views Hardware» more  SAT 2010»
14 years 17 days ago
Assignment Stack Shrinking
Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT’04 competition w...
Alexander Nadel, Vadim Ryvchin
SAT
2010
Springer
141views Hardware» more  SAT 2010»
14 years 17 days ago
Synthesizing Shortest Linear Straight-Line Programs over GF(2) Using SAT
Non-trivial linear straight-line programs over the Galois field of two elements occur frequently in applications such as encryption or high-performance computing. Finding the shor...
Carsten Fuhs, Peter Schneider-Kamp
SAT
2010
Springer
178views Hardware» more  SAT 2010»
14 years 17 days ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
SAT
2010
Springer
158views Hardware» more  SAT 2010»
14 years 17 days ago
Dynamic Scoring Functions with Variable Expressions: New SLS Methods for Solving SAT
Abstract. We introduce a new conceptual model for representing and designing Stochastic Local Search (SLS) algorithms for the propositional satisfiability problem (SAT). Our model...
Dave A. D. Tompkins, Holger H. Hoos
EUROCAST
2007
Springer
132views Hardware» more  EUROCAST 2007»
14 years 17 days ago
Using Omnidirectional BTS and Different Evolutionary Approaches to Solve the RND Problem
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
Miguel A. Vega-Rodríguez, Juan Antonio G&oa...
EUROCAST
2007
Springer
161views Hardware» more  EUROCAST 2007»
14 years 17 days ago
Using Verification Technology to Specify and Detect Malware
Abstract. Computer viruses and worms are major threats for our computer infrastructure, and thus, for economy and society at large. Recent work has demonstrated that a model checki...
Andreas Holzer, Johannes Kinder, Helmut Veith
EUROCAST
2007
Springer
97views Hardware» more  EUROCAST 2007»
14 years 17 days ago
A Practical Agent-Based Approach for Pattern Layout Design
This paper explores and discusses the application of Software Agent in pattern layout design. First we introduce Pattern Decomposition Representation Model (PDM). By combining Agen...
Cunhao Fang, Song Cao