On Variables with Few Occurrences in Conjunctive Normal Forms
From MaRDI portal
Publication:3007672
DOI10.1007/978-3-642-21581-0_5zbMath1331.68110arXiv1010.5756OpenAlexW1673478525MaRDI QIDQ3007672
Publication date: 17 June 2011
Published in: Theory and Applications of Satisfiability Testing - SAT 2011 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.5756
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05)
Related Items
Computing Maximal Autarkies with Few and Simple Oracle Queries ⋮ On Davis-Putnam reductions for minimally unsatisfiable clause-sets ⋮ On Variables with Few Occurrences in Conjunctive Normal Forms
Cites Work
- A simplified NP-complete satisfiability problem
- Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
- An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
- On subclasses of minimal unsatisfiable formulas
- Two tractable subclasses of minimal unsatisfiable formulas
- Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
- On Variables with Few Occurrences in Conjunctive Normal Forms
- Green-Tao Numbers and SAT
This page was built for publication: On Variables with Few Occurrences in Conjunctive Normal Forms