scientific article; zbMATH DE number 2080337
From MaRDI portal
Publication:4473057
Recommendations
- scientific article; zbMATH DE number 1765679
- Some interesting research directions in satisfiability
- Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
- SAT-Based Formula Simplification
- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
Cited in
(17)- A polynomial-time algorithm for reducing the number of variables in MAX SAT problem
- Equivalent literal propagation in the DLL procedure
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Reduction algorithms for solving large systems of logical equations
- Efficient data structures for backtrack search SAT solvers
- Clause vivification by unit propagation in CDCL SAT solvers
- On conversions from CNF to ANF
- A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG
- The Boolean constraint solver of SWI-Prolog (system description)
- Simplification Rules for Intuitionistic Propositional Tableaux
- Efficient CNF simplification based on binary implication graphs
- Propositional SAT solving
- SAT-Based Formula Simplification
- scientific article; zbMATH DE number 5770428 (Why is no real title available?)
- scientific article; zbMATH DE number 1189106 (Why is no real title available?)
- Algorithms for computing minimal equivalent subformulas
- A novel decentralized LTL monitoring framework using formula progression table
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 Q4473057)
