Pages that link to "Item:Q1208436"
From MaRDI portal
The following pages link to A hierarchy of tractable satisfiability problems (Q1208436):
Displaying 13 items.
- About some UP-based polynomial fragments of SAT (Q513329) (← links)
- Classic learning (Q676240) (← links)
- On computing minimal models (Q1380414) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- A perspective on certain polynomial-time solvable classes of satisfiability (Q1861558) (← links)
- Special issues on The satisfiability problem (pp. 1--244) including papers from the 1st workshop on satisfiability, Certosa di Pontignano, Italy, April 29--May 3, 1996 and Boolean functions (pp. 245--479) (Q1961443) (← links)
- On \(k\)-positive satisfiability problem (Q1964360) (← links)
- On some tractable classes in deduction and abduction (Q1978251) (← links)
- Properties of SLUR Formulae (Q2891367) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
