Theory and Applications of Satisfiability Testing

DOI10.1007/B95238MaRDI QIDQ5325876zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Fixed-parameter tractable reductions to SAT
• SAT-Problems and Reductions with Respect to the Number of Variables
• On satisfiability problems with a linear structure
• On the complexity of strongly connected components in directed hypergraphs
• Theory and Applications of Satisfiability Testing
• scientific article; zbMATH DE number 956861 (Why is no real title available?)
• Theory and Applications of Satisfiability Testing
• Optimization and probabilistic satisfiability on nested and co-nested formulas
• Reversed resolution in reducing general satisfiability problem

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)