Results 221 to 230 of about 137,934 (261)

Hydroxy Group-Assisted Cu-Catalyzed Asymmetric Conjugate Addition for the Creation of an All-Carbon Quaternary Center. [PDF]

J Org Chem
Yamamoto T, Shiratori Y, Yamaguchi S, Yamanomoto K, Endo K.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

SAT-to-SAT: Declarative Extension of SAT Solvers with New Propagators

Proceedings of the AAAI Conference on Artificial Intelligence, 2016
Special-purpose propagators speed up solving logic programs by inferring facts that are hard to deduce otherwise. However, implementing special-purpose propagators is a non-trivial task and requires expert knowledge of solvers. This paper proposes a novel approach in logic programming that allows (1) logical specification of both the ...
Tomi Janhunen, Shahab Tasharrofi, Eugenia Ternovska   +2 more
openaire   +4 more sources

CUD@SAT: SAT solving on GPUs

Journal of Experimental & Theoretical Artificial Intelligence, 2014
The parallel computing power offered by graphic processing units (GPUs) has been recently exploited to support general purpose applications – by exploiting the availability of general API and the single-instruction multiple-thread-style parallelism present in several classes of problems (e.g.
Alessandro Dal Palù, Agostino Dovier, Andrea Formisano 0001, Enrico Pontelli   +3 more
openaire   +3 more sources

SATConda: SAT to SAT-Hard Clause Translator

2020 21st International Symposium on Quality Electronic Design (ISQED), 2020
Logic obfuscation emerged as an efficient solution to strengthen the security of integrated circuits (ICs) from multiple threats including reverse engineering and intellectual property (IP) theft. Emergence of Boolean Satisfiability (SAT) attacks and its variants have shown to circumvent the security mechanisms such as obfuscation and a plethora of its
Rakibul Hassan, Gaurav Kolhe, Setareh Rafatirad, Houman Homayoun, Sai Manoj Pudukotai Dinakarrao   +4 more
openaire   +3 more sources

On the complexity of SAT

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039), 2003
We show that non-deterministic time NTIME(n) is not contained in deterministic time n/sup 2-/spl epsiv// and polylogarithmic space, for any /spl epsiv/>0. This implies that (infinitely often), satisfiability cannot be solved in time O(n/sup 2-/spl epsiv//) and polylogarithmic space.
Richard J. Lipton, Anastasios Viglas
openaire   +1 more source

Distributed SAT

Artificial Intelligence Review, 2010
We present DPLL ABT, a distributed Satisfiability solver (SAT) (Ansotegui and Manya in IberoAm J Artif Intell 7(20):43---56, 2003) designed to solve distributed SAT problem instances. Since SAT is a particular case of constraint satisfaction, we propose a solving method based on the Asynchronous Backtracking algorithm (ABT) (Yokoo et al.
openaire   +1 more source

A SAT-based solver for Q-ALL SAT

Proceedings of the 44th annual Southeast regional conference, 2006
Although the satisfiability problem (SAT) is NP-complete, state-of-the-art solvers for SAT can solve instances that are considered to be very hard. Emerging applications demand to solve even more complex problems residing at the second or higher levels of the polynomial hierarchy.
Ben Browning, Anja Remshagen
openaire   +1 more source

c-sat: A Parallel SAT Solver for Clusters

2009
Parallelizing modern SAT solvers for clusters such as Beowulf is an important challenge both in terms of performance scalability and stability. This paper describes a SAT Solver c-sat, a parallelization of MiniSat using MPI. It employs a layered master-worker architecture, where the masters handle lemma exchange, deletion of redundant lemmas and the ...
Kei Ohmura, Kazunori Ueda
openaire   +1 more source