Automated generation of simplification rules for SAT and MAXSAT

DOI10.1007/11499107_35MaRDI QIDQ5713737zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2187722
• Automated proofs of upper bounds on the running time of splitting algorithms
• New worst-case upper bounds for SAT
• New Bounds for MAX-SAT by Clause Learning
• New worst-case upper bounds for SAT

Cited in

(13)

• Resolution for Max-SAT
• A new upper bound for \(( n , 3)\)-MAX-SAT
• An improved algorithm for the (n, 3)-MaxSAT problem: asking branchings to satisfy the clauses
• Improved exact algorithms for mildly sparse instances of MAX SAT
• Resolution and linear CNF formulas: improved \((n,3)\)-\textsc{MaxSAT} algorithms
• Automatic generation of redundant models for permutation constraint satisfaction problems
• SAT-Based Formula Simplification
• Improved \textsc{MaxSAT} algorithms for instances of degree 3
• Automatic generation of rule-based constraint solvers over finite domains
• scientific article; zbMATH DE number 2187722 (Why is no real title available?)
• Itauto: An Extensible Intuitionistic SAT Solver
• Generating Faster Algorithms for d-Path Vertex Cover
• Solving sparse instances of Max SAT via width reduction and greedy restriction

This page was built for publication: Automated generation of simplification rules for SAT and MAXSAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713737)