On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances

DOI10.1145/3091528zbMath1407.68215OpenAlexW2747084554MaRDI QIDQ5369245

Stefan Szeider, Ronald de Haan, Iyad A. Kanj

Publication date: 16 October 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3091528

zbMATH Keywords

constraint satisfactionparameterized complexityCNF formulasbackbonesunsatisfiable subsets

Mathematics Subject Classification ID

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

This page was built for publication: On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances