Theory and Applications of Satisfiability Testing

DOI10.1007/b137280zbMath1128.68469OpenAlexW2497844642MaRDI QIDQ5713737

Alexander S. Kulikov

Publication date: 15 December 2005

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

Full work available at URL: https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Improved MaxSAT Algorithms for Instances of Degree 3, Improved exact algorithms for mildly sparse instances of MAX SAT, Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms, Solving sparse instances of Max SAT via width reduction and greedy restriction, A new upper bound for \(( n , 3)\)-MAX-SAT, An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses, Resolution for Max-SAT