Pages that link to "Item:Q2701980"
From MaRDI portal
The following pages link to The SAT problem of signed CNF formulas (Q2701980):
Displaying 14 items.
- Learning general constraints in CSP (Q309921) (← links)
- Binary resolution over Boolean lattices (Q853473) (← links)
- On the refutational completeness of signed binary resolution and hyperresolution (Q1037933) (← links)
- Automated theorem provers for multiple-valued logics with satisfiability modulo theory solvers (Q1697332) (← links)
- Separating signs in the propositional satisfiability problem (Q1977918) (← links)
- Analytic tableaux for non-deterministic semantics (Q2142063) (← links)
- New complexity results for Łukasiewicz logic (Q2317509) (← links)
- Exploiting multivalued knowledge in variable selection heuristics for SAT solvers (Q2385440) (← links)
- Resolution procedures for multiple-valued optimization (Q2510176) (← links)
- An algorithm for random signed 3-SAT with intervals (Q2637342) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- A first polynomial non-clausal class in many-valued logic (Q6083144) (← links)