The following pages link to Nested satisfiability (Q582905):
Displaying 12 items.
- Optimization and probabilistic satisfiability on nested and co-nested formulas (Q646722) (← links)
- Satisfiability of mixed Horn formulas (Q997066) (← links)
- Satisfiability of co-nested formulas (Q1323332) (← links)
- On exact selection of minimally unsatisfiable subformulae (Q1777390) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- New tractable classes for default reasoning from conditional knowledge bases (Q2502153) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- A CNF Class Generalizing Exact Linear Formulas (Q3502711) (← links)
- On Some Aspects of Mixed Horn Formulas (Q3637161) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- The complexity of the falsifiability problem for pure implicational formulas (Q5917958) (← links)
