satisfiability problem
A Multilevel Tabu Search for the Maximum Satisfiability Problem
... maximum satisfiability problem (MAX-SAT) refers to the task of finding a variable assignment that satisfies the maximum number of clauses (or the sum of weight of satisfied clauses) in a Boolean ...original ...
10
Using Network Security Management to solve Boolean Satisfiability Problem
... The MinCostSAT problem minimizes the cost for variables that are assigned T . This matches the semantics for privilege variables, whose T assignment means an attacker can gain some privilege and thereby cause some ...
6
satisfying the satisfiability problem CUJ Sep 2005
... The basic algorithm for satisfiability is by Davis, Putnam, and Loveland (Figure 1) [2]. In this recursive algorithm, the given CNF formula S (a set of clauses) is first simplified by repeatedly applying some ...
5
Investigations into Satisfiability Search
... of satisfiability and, if general enough, yields a better understanding of ...search problem and proof generation ...in satisfiability, and to question whether considerations about “real world” ...
24
GRASP A New Search Algorithm for Satisfiability
... The proposed conflict analysis procedure has been incorporated in GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated al- gorithmic framework for SAT. Several features distinguish ...
18
A Theory of Satisfiability-Preserving Proofs in SAT Solving
... preserve satisfiability but not necessarily logical ...the satisfiability problem for overwrite logic is essentially as hard as SAT, and can be reduced in a way that is well-behaved for modern SAT ...
21
On Applying Boolean Satisfiability to Delay Fault Testing
... Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic ...given problem as a SAT instance 2) solution of ...
5
A decision procedure for satisfiability in separation logic with inductive predicates
... latter problem by showing that the satisfiability problem for the most commonly considered symbolic heap fragment of separation logic, extended with general inductive predicates, is in fact ...the ...
11
Multilevel techniques and learning automata for the Maximum Satisfiability (MAXSAT) problem
... propositional satisfiability problem known as ...the problem size, hence the time it would take to test all the different solutions could easily be too ...MAXSAT problem efficiently, it is not ...
79
GRASP A Search Algorithm for Propositional Satisfiability
... AbstractÐThis paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several ...
16
Generalized probabilistic satisfiability through integer programming
... In Problem 3, one can argue that, if the probability of Alice going out is 5 / 6 or 1 / 6, with probability 1 / 2 each, then the probabil- ity of her going out is actually 1 / 2 × 5 / 6 + 1 / 2 × 1 / 6 = 1 / ...
14
Algorithms for Solving Boolean Satisfiability in Combinational Circuits
... tactic satisfiability hinges on this fact to allow the search algorithm to stop the search when clauses not yet satisfied are guaranteed to have a satisfying assignment, ...
5
Prime Implicant Computation Using Satisfiability Algorithms
... 4.2 SAT-Based Branch and Bound Algorithm A different algorithmic organization consists of using a variation of the branch and bound procedure [ 7 ] , where upper bounds to the cost funct[r] ...
8
Probing Based Preprocessing Techniques for Propositional Satisfiability
... Tables 2 and 3 give the CPU time in seconds required for solving for different classes of problem instances, that include some of the hardest instances. For each benchmark suite, the total number of instances is ...
6
Heuristic Based Backtracking Relaxation for Propositional Satisfiability
... The vast majority of backtrack search SAT algorithms are built on the original backtrack search algorithm of Davis, Logemann, and Loveland [5]. The backtrack search algorithm is implemented by a search process that ...
22
Random Backtracking in Backtrack Search Algorithms for Satisfiability
... This section presents and analyzes experimental results that evaluate the effectiveness of the techniques proposed in this paper in solving hard real-world problem instances. Recent examples of such instances are ...
9
Determining the Satisfiability of Car Configuration Models in a Repetitive Manner
... In the use cases of BetterBe, the company experiences that their solver does not meet their requirements of performance and maintainability anymore. Currently, solving their car configuration problems and price ...
71
Exploiting Satisfiability Solvers for Efficient Logic Synthesis
... the problem, but other factors can also affect the ability to find a solution for a given ...the problem is solvable or not [Björk, ...the problem gradually by issuing multiple easier calls of the ...
155
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
... The problem of checking the equivalence of combina- tional circuits is of key significance in the verification of digital circuits, and has been the subject of significant con- tributions in recent ...negative ...
5
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
... Abstract: In 1991, Papadimitriou and Yannakakis gave a reduction implying the NP- hardness of approximating the problem 3-SAT with bounded occurrences. Their reduction is based on expander graphs. We present an ...
16