Eliminating Redundant Clauses in SAT Instances
From MaRDI portal
Publication:3612408
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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
This page was built for publication: Eliminating Redundant Clauses in SAT Instances
