Pages that link to "Item:Q1097717"
From MaRDI portal
The following pages link to An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences (Q1097717):
Displaying 8 items.
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- Polynomially solvable satisfiability problems (Q1114394) (← links)
- A hierarchy of tractable satisfiability problems (Q1208436) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- Resolution deduction to detect satisfiability for another class including non-Horn sentences in propositional logic (Q1819946) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
