Sciweavers

1252 search results - page 4 / 251
» Minimizing Learned Clauses
Sort
View
ICTAI
2008
IEEE
15 years 4 months ago
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
Éric Grégoire, Bertrand Mazure, C&ea...
ILP
2007
Springer
15 years 3 months ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik
IJCAI
2003
14 years 11 months ago
Understanding the Power of Clause Learning
Efficient implementations of DPLL with the addition of clause learning are the fastest complete satisfiability solvers and can handle many significant real-world problems, such as...
Paul Beame, Henry A. Kautz, Ashish Sabharwal
SAT
2007
Springer
121views Hardware» more  SAT 2007»
15 years 3 months ago
MiniMaxSat: A New Weighted Max-SAT Solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
Federico Heras, Javier Larrosa, Albert Oliveras
JAIR
2008
120views more  JAIR 2008»
14 years 9 months ago
MiniMaxSAT: An Efficient Weighted Max-SAT solver
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that is built on top of MINISAT+. It incorporates the best current SAT and Max-SAT techniques. It can handle hard claus...
Federico Heras, Javier Larrosa, Albert Oliveras