Nested satisfiability
From MaRDI portal
Publication:582905
DOI10.1007/BF02983372zbMath0691.68040arXivcs/9301111MaRDI QIDQ582905
Publication date: 1990
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/9301111
68Q25: Analysis of algorithms and problem complexity
Related Items
Planar 3-SAT with a clause/variable cycle, The complexity of the falsifiability problem for pure implicational formulas, Optimization and probabilistic satisfiability on nested and co-nested formulas, Satisfiability of mixed Horn formulas, Satisfiability of co-nested formulas, On exact selection of minimally unsatisfiable subformulae, Solving the resolution-free SAT problem by submodel propagation in linear time, Selecting and covering colored points, New tractable classes for default reasoning from conditional knowledge bases, Backdoors to Satisfaction, A CNF Class Generalizing Exact Linear Formulas, On Some Aspects of Mixed Horn Formulas
Cites Work