Pages that link to "Item:Q2387427"
From MaRDI portal
The following pages link to Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427):
Displaying 10 items.
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- On finding solutions for extended Horn formulas (Q673602) (← links)
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- Recognition of \(q\)-Horn formulae in linear time (Q1337669) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- Recognition of simple enlarged Horn formulas and simple extended Horn formulas (Q1861905) (← links)
- The Horn renamability, q-Horn and SLUR threshold for random \(k\)-CNF formulas (Q2341714) (← links)
- Generalising unit-refutation completeness and SLUR via nested input resolution (Q2352484) (← links)
- Generalising and Unifying SLUR and Unit-Refutation Completeness (Q2927648) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)
