This paper serves as solver description for our SAT solver Lingeling and its two parallel variants Treengeling and Plingeling entering the SAT Competition 2013. We only list important differences to the version of these solvers used in the SAT Challenge 2012. For further information we refer to the solver description [1] of the SAT Challenge 2012 or source code.

conclusions according to the results, brucellosis has remained endemic in this region. most cases were detected by elisa igg. the highest kappa agreements were between tests krb-sat, krb-igg and ksat-igg, while the lowest levels of agreement were between tests sat-igm and elisa igm-igg. considering that elisa igm results are covered by sat and elisa igg test results, applications of this test d...

This note serves as system description for our SAT solvers that entered the SAT Race 2010 affiliated to the SAT conference 2010.

Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a logical formula. A branch-and-bound algorithm based on the Davis-PutnamLogemann-Loveland procedure (DPLL) is one of the most efficient complete algorithms for solving max-SAT. In this paper, We propose an...

The rat liver sulfate/bicarbonate/oxalate exchanger (sat-1) transports sulfate across the canalicular membrane in exchange for either bicarbonate or oxalate. Sulfate/oxalate exchange has been detected in the proximal tubule of the kidney, where it is probably involved in the reabsorption of filtered sulfate and the secretion of oxalate and may contribute to oxalate-dependent chloride reabsorpti...

Boolean satisfiability (SAT) has an extensive application domain in computer science, especially in electronic design automation applications. Circuit synthesis, optimization, and verification problems can be solved by transforming original problems to SAT problems. However, the SAT problem is known as an NP-complete problem, which means there is no efficient method to solve SAT problems. There...

Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a Boolean formula. A branch and bound algorithm based on the Davis-Putnam-Logemann-Loveland procedure (DPLL) is one of the most competitive exact algorithms for solving max-SAT. In this paper, we propose an...

It is widely acknowledged that stochastic local search (SLS) algorithms can efficiently find models for satisfiable instances of the satisfiability (SAT) problem, especially for random k-SAT instances. However, compared to random 3-SAT instances where SLS algorithms have shown great success, random k-SAT instances with long clauses remain very difficult. Recently, the notion of second level sco...

Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world, SAT instances. However, the process of development and testing of new SAT solving techniques is conditioned to the finite and reduced number of known industrial benchmarks. Therefore, new models of random SAT instances generation that capture realistically the features of real-world problems can be benefi...