We describe LMHS, an open source weighted partial maximum satisfiability (MaxSAT) solver. LMHS is a hybrid SAT-IP MaxSAT solver that implements the implicit hitting set approach to MaxSAT. On top of the main algorithm, LMHS offers integrated preprocessing, solution enumeration, an incremental API, and the use of a choice of SAT and IP solvers. We describe the main features of LMHS, and give emp...

Background & Aims: Brucellosis is a public health problem in many developing countries, including Iran. Diagnosis is based on history, clinical manifestations and positive serum agglutination test (SAT) or Wright test. The purpose of this study was to evaluate the diagnostic value of SAT in pediatric Brucellosis. Methods: In this prospective study, during 2 years, 52 patients with clinical feat...

In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT problems which become larger and larger. A SAT solver needs to solve the problems until it encounters a satisfiable SAT problem. Many state-of-the-art SAT solvers learn lemmas called conflict clauses to prune redundant sea...

High order Boltzmann machines (HOBM) have been proposed some time ago, but few applications have been reported. SAT is the canonical NP-complete problem. MAX-SAT is a generalization of SAT in sense that its solution provides answers to SAT. In this paper we propose a mapping on the MAX-SAT problem, in the propositional calculus setting, into HOBM combinatorial optimization problem. The approxim...

We present a new type of sat problem called the k-gd-sat, which generalizes k-sat and gd-sat. In k-gd-sat, clause lengths have geometric distribution, controlled by a probability parameter p; for p = 1, a k-gd-sat problem is a k-sat problem. We report on the phase transition between satisfiability and unsatisfiability for randomly generated instances of k-gd-sat. We provide theoretical analysis...

In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry—the long-standing of determining if a plane order ten exists. Both the original search an independent verification in 2011 discovered no such plane. However, these were each performed using highly specialized custom-written code did not produce nonexistence certificates. this pap...