Solving #SAT and MAXSAT by Dynamic Programming
From MaRDI portal
Publication:3196312
DOI10.1613/jair.4831zbMath1341.68204OpenAlexW2287821450MaRDI QIDQ3196312
Jan Arne Telle, Martin Vatshelle, Sigve Hortemo Sæther
Publication date: 29 October 2015
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1613/jair.4831
Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Sum-of-Products with Default Values: Algorithms and Complexity Results ⋮ A width parameter useful for chordal and co-comparability graphs ⋮ Lower bounds on the mim-width of some graph classes ⋮ Solving projected model counting by utilizing treewidth and its limits ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On efficiently solvable cases of quantum \(k\)-SAT ⋮ New width parameters for SAT and \#SAT ⋮ Unnamed Item ⋮ Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT
This page was built for publication: Solving #SAT and MAXSAT by Dynamic Programming
