Pages that link to "Item:Q1111774"
From MaRDI portal
The following pages link to A satisfiability tester for non-clausal propositional calculus (Q1111774):
Displaying 14 items.
- An improved upper bound for SAT (Q820534) (← links)
- BREAKUP: A preprocessing algorithm for satisfiability testing of CNF formulas (Q1317978) (← links)
- Tractable reasoning via approximation (Q1855213) (← links)
- New methods for 3-SAT decision and worst-case analysis (Q1960406) (← links)
- The \(Multi\)-SAT algorithm (Q1961449) (← links)
- A fast algorithm for SAT in terms of formula length (Q2118334) (← links)
- Checking the satisfiability of formulas represented in disjunctive normal form in the language \(L\). I (Q2508787) (← links)
- The propositional formula checker HeerHugo (Q2749861) (← links)
- An Improved SAT Algorithm in Terms of Formula Length (Q3183448) (← links)
- An artificial neural network satisfiability tester (Q4329689) (← links)
- Axiomatization of <tt>if-then-else</tt> over possibly non-halting programs and tests (Q5269894) (← links)
- Satisfiability Checking of Non-clausal Formulas Using General Matings (Q5756567) (← links)
- Reductions for non-clausal theorem proving (Q5958754) (← links)
- Further improvements for SAT in terms of formula length (Q6077846) (← links)
