Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68209OpenAlexW2494235144MaRDI QIDQ5325876FDOQ5325876

Authors: D. Pretolani 

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

• Reversed resolution in reducing general satisfiability problem
• A hierarchy of tractable satisfiability problems
• Satisfiability of acyclic and almost acyclic CNF formulas
• scientific article; zbMATH DE number 956861
• Satisfiability of acyclic and almost acyclic CNF formulas

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Cited In (8)

• Theory and Applications of Satisfiability Testing
• On the complexity of strongly connected components in directed hypergraphs
• On satisfiability problems with a linear structure
• Reversed resolution in reducing general satisfiability problem
• Fixed-parameter tractable reductions to SAT
• Optimization and probabilistic satisfiability on nested and co-nested formulas
• Theory and Applications of Satisfiability Testing
• SAT-Problems and Reductions with Respect to the Number of Variables

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