scientific article; zbMATH DE number 1995157
From MaRDI portal
Publication:4431379
Cited in
(15)- Generating hard satisfiability problems
- GridSAT: Design and implementation of a computational grid application
- A taxonomy of exact methods for partial Max-SAT
- A new method for testing decision procedures in modal logics
- Exploiting partial variable assignment in interpolation-based model checking
- Variable and term removal from Boolean formulae
- Exploiting data dependencies in many-valued logics
- Reasoning with propositional logic: from SAT solvers to knowledge compilation
- Hard random 3-SAT problems and the Davis-Putnam procedure
- Critical behavior in the computational cost of satisfiability testing
- Problem solving by searching for models with a theorem prover
- On threshold BDDs and the optimal variable ordering problem
- New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
- Building decision procedures for modal logics from propositional decision procedures -- the case study of modal K
- The design of the CADE-13 ATP system competition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4431379)
