Solving MaxSAT and #SAT on Structured CNF Formulas

DOI10.1007/978-3-319-09284-3_3zbMath1423.68470arXiv1402.6485OpenAlexW1931480168MaRDI QIDQ3192052

Jan Arne Telle, Sigve Hortemo Sæther, Martin Vatshelle

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.6485

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 (3)

On Compiling CNFs into Structured Deterministic DNNFs ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Unnamed Item

This page was built for publication: Solving MaxSAT and #SAT on Structured CNF Formulas