Results 261 to 270 of about 235,564 (296)
Some of the next articles are maybe not open access.
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ù +3 more
openaire +4 more sources
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ù +3 more
openaire +4 more sources
SATConda: SAT to SAT-Hard Clause Translator
2020 21st International Symposium on Quality Electronic Design (ISQED), 2020Logic 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 +4 more
+6 more sources
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 +2 more sources
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 +2 more sources
Artificial Intelligence, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Armin Biere, Carsten Sinz, Markus Iser
exaly +4 more sources
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 +2 more sources
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 +2 more sources
A SAT-based solver for Q-ALL SAT
Proceedings of the 44th annual Southeast regional conference, 2006Although 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 +2 more sources
c-sat: A Parallel SAT Solver for Clusters
2009Parallelizing 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 +2 more sources
Proceedings of the 2018 Great Lakes Symposium on VLSI, 2018
To close the ever widening verification gap, new powerful solutions are strictly required. One such promising approach aims in continuing verification tasks after production of a chip during its lifetime. This approach is called self-verification. However, for realizing self-verification tasks on-chip, verification packages have to be developed.
Buse Ustaoglu +3 more
openaire +2 more sources
To close the ever widening verification gap, new powerful solutions are strictly required. One such promising approach aims in continuing verification tasks after production of a chip during its lifetime. This approach is called self-verification. However, for realizing self-verification tasks on-chip, verification packages have to be developed.
Buse Ustaoglu +3 more
openaire +2 more sources
Combinatorics, Probability and Computing, 1995
Let S be a set of m clauses each containing three literals chosen at random in a set { p 1 , ¬ p 1 ,…, p
A. El Maftouhi +1 more
openaire +2 more sources
Let S be a set of m clauses each containing three literals chosen at random in a set { p 1 , ¬ p 1 ,…, p
A. El Maftouhi +1 more
openaire +2 more sources
Community Structure Inspired Algorithms for SAT and #SAT
2015We introduce h-modularity, a structural parameter of CNF formulas, and present algorithms that render the decision problem SAT and the model counting problem #SAT fixed-parameter tractable when parameterized by h-modularity. The new parameter is defined in terms of a partition of clauses of the given CNF formula into strongly interconnected communities
Robert Ganian, Stefan Szeider
openaire +1 more source