SAT
2005
Springer
13 years 10 months ago
2005
Springer
Conjunctive Normal Form (CNF) Boolean formulas generated from resolution or solution enumeration often have much redundancy. It is desirable to have an efficient algorithm to simpl...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce ApproxCount, an algorithm that approximates the number of satisfying assignments or models of a formula in propositional logic. Many AI tasks, such as calculating degr...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We present an algorithm that decides the satisfiability of a
SAT
2005
Springer
13 years 10 months ago
2005
Springer
SAT
2005
Springer
13 years 10 months ago
2005
Springer
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Many current local search algorithms for SAT fall into one of two classes. Random walk algorithms such as Walksat/SKC, Novelty+ and HWSAT are very successful but can be trapped for...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
SAT
2005
Springer
13 years 10 months ago
2005
Springer
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver ...
SAT
2005
Springer
13 years 10 months ago
2005
Springer
The utilization of cutting planes is a key technique in Integer Linear Programming (ILP). However, cutting planes have seldom been applied in Pseudo-Boolean Optimization (PBO) algo...