Eliminating Redundant Clauses in SAT Instances

DOI10.1007/978-3-540-72397-4_6zbMath1214.68333OpenAlexW1660853348MaRDI QIDQ3612408

Lakhdar Saïs, Bertrand Mazure, Olivier Fourdrinoy, Éric Grégoire

Publication date: 10 March 2009

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72397-4_6

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases ⋮ Algorithms for computing minimal equivalent subformulas ⋮ About some UP-based polynomial fragments of SAT ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained

Uses Software

• MiniSat
• BG-WalkSAT
• Chaff
• NiVER

This page was built for publication: Eliminating Redundant Clauses in SAT Instances