Results 101 to 110 of about 263 (134)
Some of the next articles are maybe not open access.
On Probabilistic Generalization of Backdoors in Boolean Satisfiability
Proceedings of the AAAI Conference on Artificial Intelligence, 2022The paper proposes a probabilistic generalization of the well-known Strong Backdoor Set (SBS) concept applied to the Boolean Satisfiability Problem (SAT). We call a set of Boolean variables B a ρ-backdoor, if for a fraction of at least ρ of possible assignments of variables from B, assigning their values to variables in a Boolean formula in Conjunctive
Alexander A. Semenov +3 more
openaire +2 more sources
Applying UCT to Boolean Satisfiability
2011In this paper we perform a preliminary investigation into the application of sampling-based search algorithms to satisfiability testing of propositional formulas in Conjunctive Normal Form (CNF). In particular, we adapt the Upper Confidence bounds applied to Trees (UCT) algorithm [5] which has been successfully used in many game playing programs ...
Alessandro Previti +3 more
openaire +3 more sources
Exact diagnosis using boolean satisfiability
Proceedings of the 35th International Conference on Computer-Aided Design, 2016We propose an exact algorithm to model-free diagnosis with an application to fault localization in digital circuits. We assume that a faulty circuit and a correctness specification, e.g., in terms of an un-optimized reference circuit, are available.
Heinz Riener, Görschwin Fey
openaire +2 more sources
Resolution for Stochastic Boolean Satisfiability
2010The stochastic Boolean satisfiability (SSAT) problem was introduced by Papadimitriou in 1985 by adding a probabilistic model of uncertainty to propositional satisfiability through randomized quantification. SSAT has many applications, e.g., in probabilistic planning and, more recently by integrating arithmetic, in probabilistic model checking.
Tino Teige, Martin Fränzle
openaire +2 more sources
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 +2 more sources
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 +2 more sources
A NN algorithm for Boolean satisfiability problems
Proceedings of International Conference on Neural Networks (ICNN'96), 2002Satisfiability (SAT) refers to the task of finding a truth assignment that makes an arbitrary Boolean expression true. This paper compares a neural network algorithm (NNSAT) with GSAT, a greedy algorithm for solving satisfiability problems. GSAT can solve problem instances that are difficult for traditional satisfiability algorithms.
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