Results 151 to 160 of about 770 (181)
Some of the next articles are maybe not open access.
Accelerating Boolean satisfiability with configurable hardware
Proceedings. IEEE Symposium on FPGAs for Custom Computing Machines (Cat. No.98TB100251), 2002This paper describes and evaluates methods for implementing formula-specific Boolean satisfiability (SAT) solver circuits in configurable hardware. Starting from a general template design, our approach automatically generates VHDL for a circuit that is specific to the particular Boolean formula being solved.
Peixin Zhong +3 more
openaire +1 more source
The Synthesis of Cyclic Dependencies with Boolean Satisfiability
ACM Transactions on Design Automation of Electronic Systems, 2012The accepted wisdom is that combinational circuits must have acyclic (i.e., feed-forward) topologies. Yet simple examples suggest that this is incorrect. In fact, introducing cycles (i.e., feedback) into combinational designs can lead to significant savings in area and in delay.
John D. Backes, Marc D. Riedel
openaire +1 more source
Register Allocation Based on Boolean Satisfiability
2014Graph Coloring is an effective method which is used to solve the register allocation problem, it is also an NP-complete problem, heuristic algorithms and various evolutionary algorithms have been proposed in order to improve the performance of register allocation, in this paper, we propose to solve this problem by converting the graph coloring problem ...
Mengmeng Yang 0002, Jie Liu
openaire +1 more source
Asynchronous Team Algorithms for Boolean Satisfiability
Proceedings of the 2nd International Conference on Bio-Inspired Models of Network Information and Computing Systems, 2007The Boolean Satisfiability Problem or SAT is one of the most important problems in computer science. Nowadays, there are different types of algorithms to solve instances with thousands of variables, and much research is being carried out looking for more efficient algorithms to solve larger and harder instances.
Carlos Rodriguez +2 more
openaire +1 more source
Stochastic Boolean Satisfiability
2009Stochastic satisfiability (SSAT) is an extension of satisfiability (SAT) that merges two important areas of artificial intelligence: logic and probabilistic reasoning. Initially suggested by Papadimitriou, who called it a “game against nature”, SSAT is interesting both from a theoretical perspective—it is complete for ...
openaire +1 more source
Solving Boolean Satisfiability with Stochastic Nanomagnets
2022 29th IEEE International Conference on Electronics, Circuits and Systems (ICECS), 2022Maeesha Binte Hashem +3 more
openaire +1 more source
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
SIAM Journal on Computing, 2009Phokion G Kolaitis +2 more
exaly
Boolean satisfiability with transitivity constraints
ACM Transactions on Computational Logic, 2002Randal E Bryant, Miroslav N Velev
exaly