Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems

Christian Desrosiers, Philippe Galinier, Alain Hertz and Sandrine Paroz

Article (2009)

An external link is available for this item

Department:	Department of Computer Engineering and Software Engineering Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/19718/
Journal Title:	Journal of Combinatorial Optimization (vol. 18, no. 2)
Publisher:	Springer
DOI:	10.1007/s10878-008-9142-4
Official URL:	https://doi.org/10.1007/s10878-008-9142-4
Date Deposited:	18 Apr 2023 15:14
Last Modified:	15 May 2025 14:36

Cite in APA 7:	Desrosiers, C., Galinier, P., Hertz, A., & Paroz, S. (2009). Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems. Journal of Combinatorial Optimization, 18(2), 124-150. https://doi.org/10.1007/s10878-008-9142-4
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only