Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
275
EFFICIENT ALGORITHMS FOR CLAUSE-LEARNING SAT SOLVERS
, 2004
"... Boolean satisfiability (SAT) is NP-complete. No known algorithm for SAT is of polynomial time complexity. Yet, many of the SAT instances generated as a means of solving real-world electronic design automation problems are simple enough, structurally, that modern solvers can decide them efficiently. ..."
Abstract
-
Cited by 73 (0 self)
- Add to MetaCart
. Consequently, SAT solvers are widely used in industry for logic verification. The most robust solver algorithms are poorly understood and only vaguely described in the literature of the field. We refine these algorithms, and present them clearly. We introduce several new techniques for Boolean constraint
Improvements To Propositional Satisfiability Search Algorithms
, 1995
"... ... quickly across a wide range of hard SAT problems than any other SAT tester in the literature on comparable platforms. On a Sun SPARCStation 10 running SunOS 4.1.3 U1, POSIT can solve hard random 400-variable 3-SAT problems in about 2 hours on the average. In general, it can solve hard n-variable ..."
Abstract
-
Cited by 174 (0 self)
- Add to MetaCart
... quickly across a wide range of hard SAT problems than any other SAT tester in the literature on comparable platforms. On a Sun SPARCStation 10 running SunOS 4.1.3 U1, POSIT can solve hard random 400-variable 3-SAT problems in about 2 hours on the average. In general, it can solve hard n
SAT0583 THE CASE OF “CASE REPORTS ” IN RHEUMATOLOGY LITERATURE
, 2014
"... Background: With the increased encouragement of evidence-based medicine, case reports (CRs) are gradually sidelined and assumed to have minimal impact on the management of patients. In the field of rheumatology (R) CRs are generally published in several journals of the specialty while most major jou ..."
Abstract
- Add to MetaCart
journals restrict or do not accept CRs because they may lower journal’s impact factor. There are no studies to date assessing the magnitude and the focus of the CRs published in R literature. Objectives: The aims of this study were to investigate the proportion and the topic of the CRs published in major R
Part. Sat. Column, 40%)
"... Table J.5. Uranium K d values selected from literature for development of look-up table. pH ..."
Abstract
- Add to MetaCart
Table J.5. Uranium K d values selected from literature for development of look-up table. pH
Full matching in an observational study of coaching for the SAT
- Journal of the American Statistical Association
, 2004
"... Among matching techniques for observational studies, full matching is in principle the best, in the sense that its alignment of comparable treated and control subjects is as good as that of any alternate method, and potentially much better. This article evaluates the practical performance of full ma ..."
Abstract
-
Cited by 64 (7 self)
- Add to MetaCart
matching for the first time, modifying it in order to minimize variance as well as bias and then using it to compare coached and uncoached takers of the SAT. In this new version, with restrictions on the ratio of treated subjects to controls within matched sets, full matching makes use of many more
Some Pitfalls for Experimenters with Random SAT
- Artificial Intelligence
, 1996
"... We consider the use of random CNF formulas in evaluating the performance of SAT testing algorithms, and in particular the role that the phase transition phenomenon plays in this use. Examples from the literature illustrate the importance of understanding the properties of formula distributions prior ..."
Abstract
-
Cited by 20 (3 self)
- Add to MetaCart
We consider the use of random CNF formulas in evaluating the performance of SAT testing algorithms, and in particular the role that the phase transition phenomenon plays in this use. Examples from the literature illustrate the importance of understanding the properties of formula distributions
The log-support encoding of CSP into SAT
- In Proceedings of CP2007
, 2007
"... Abstract. It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT solver will efficiently find a solution is still an open question. Various encodings have been proposed in the ..."
Abstract
-
Cited by 12 (0 self)
- Add to MetaCart
in the literature. Some of them use a logical variable for each element in each domain: among these very successful are the direct and the support encodings. It is known that a SAT solver based on the DPLL procedure obtains a propagation similar to Forward Checking on a directencoded CSP, and to Maintaining Arc
Incremental SAT Seminar Satisfiability Checking
"... Abstract. Nadel et. al. propose Ultimately Incremental SAT (UI-SAT), an algorithm for incremental SAT solving under assumptions. After solving a formula, incremental SAT solving under assumptions allows to reinvoke the SAT solver with additional clauses added to the problem. At the same time, assump ..."
Abstract
- Add to MetaCart
, assumptions for certain variables can be set, fixing the assignment of those variables. UI-SAT combines benefits of four other approaches suggested in the literature, offering a comprehensive algorithm for incremental SAT solving. This paper aims to present the UI-SAT algorithm in an easily understandable
A SAT Approach to Clique-Width
"... Clique-width is a graph invariant that has been widely studied in combinatorics and computational logic. Computing the clique-width of a graph is an intricate problem, the exact clique-width is not known even for very small graphs. We present a new method for computing clique-width via an encoding t ..."
Abstract
- Add to MetaCart
to propositional satisfiability (SAT) which is then evaluated by a SAT solver. Our encoding is based on a reformulation of clique-width in terms of partitions that utilizes an efficient encoding of cardinality constraints. Our SAT-based method is the first to discover the exact clique-width of various small graphs
Results 1 - 10
of
275
