Pages that link to "Item:Q1114394"
From MaRDI portal
The following pages link to Polynomially solvable satisfiability problems (Q1114394):
Displayed 17 items.
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- A hierarchy of tractable satisfiability problems (Q1208436) (← links)
- On resolution with short clauses (Q1380411) (← 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)
- On functional dependencies in \(q\)-Horn theories (Q1606330) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- A new algorithm for the propositional satisfiability problem (Q1894360) (← 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)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Recognition of tractable satisfiability problems through balanced polynomial representations (Q1962045) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- On the impact of stratification on the complexity of nonmonotonic reasoning (Q4317728) (← links)
- 1999 European Summer Meeting of the Association for Symbolic Logic (Q4953838) (← links)
- The complexity of the falsifiability problem for pure implicational formulas (Q5917958) (← links)