Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
117
click to vote
CPAIOR
2007
Springer
114
views
Operations Research
»
more
CPAIOR 2007
»
Eliminating Redundant Clauses in SAT Instances
15 years 9 months ago
Download
www.cril.univ-artois.fr
In this paper, we investigate to which extent the elimination of a class of redundant clauses in SAT instances could improve the efficiency of modern satisfiability provers. Sinc...
Olivier Fourdrinoy, Éric Grégoire, B...
claim paper
Read More »