Pages that link to "Item:Q3677734"
From MaRDI portal
The following pages link to The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic (Q3677734):
Displayed 13 items.
- On generalized Horn formulas and \(k\)-resolution (Q685363) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- An \(O(n^ 2)\) algorithm for the satisfiability problem of a subset of propositional sentences in CNF that includes all Horn sentences (Q1097717) (← links)
- Polynomially solvable satisfiability problems (Q1114394) (← links)
- A hierarchy of tractable satisfiability problems (Q1208436) (← links)
- On renamable Horn and generalized Horn functions (Q1356207) (← links)
- On resolution with short clauses (Q1380411) (← links)
- Hierarchies of polynomially solvable satisfiability problems (Q1380432) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing (Q2387427) (← links)
- Satisfiability with index dependency (Q2637283) (← links)
- (Q5091205) (← links)
- (Q5131261) (← links)