The following pages link to (Q3682462):
Displaying 20 items.
- SAT solver management strategies in IC3: an experimental approach (Q526434) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- The SAT-based approach to separation logic (Q862390) (← links)
- The disconnection tableau calculus (Q877889) (← links)
- Liberalized variable splitting (Q877894) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- The complexity of Gentzen systems for propositional logic (Q1263584) (← links)
- Simplified lower bounds for propositional proofs (Q1374208) (← links)
- On deciding subsumption problems (Q1777407) (← links)
- Many-valued logic and mixed integer programming (Q1924752) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← links)
- Parameterized complexity classes beyond para-NP (Q2396719) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← links)
- (Q4989407) (← links)
- Satisfiability, Lattices, Temporal Logic and Constraint Logic Programming on Intervals (Q5027249) (← links)
- Seventy Years of Computer Science (Q5049043) (← links)
