Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68196DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325849FDOQ5325849

Authors: Eugene Goldberg, Yakov Novikov 

Publication date: 24 July 2009

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

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

Recommendations

• On tackling the limits of resolution in SAT solving
• scientific article
• A Decision-Making Procedure for Resolution-Based SAT-Solvers
• Theory and Applications of Satisfiability Testing
• An upper bound for resolution size: characterization of tractable SAT instances
• scientific article
• Resolution for Max-SAT
• Resolution-based lower bounds in MaxSAT
• Exploiting resolution-based representations for MaxSAT solving
• Resolution and the integrality of satisfiability problems

Mathematics Subject Classification ID

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

Cited In (3)

• On a generalization of extended resolution
• On SAT instance classes and a method for reliable performance experiments with SAT solvers
• How to apply SAT-solving for the equivalence test of monotone normal forms

Uses Software

• SATO
• BerkMin

This page was built for publication: Theory and Applications of Satisfiability Testing

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