SAT-Based Formula Simplification
From MaRDI portal
Recommendations
- A SAT based approach for solving formulas over Boolean and linear mathematical propositions
- An Improved SAT Algorithm in Terms of Formula Length
- Formalization and implementation of modern SAT solvers
- Algebraic simplification techniques for propositional satisfiability
- Automated generation of simplification rules for SAT and MAXSAT
- A fast algorithm for SAT in terms of formula length
- Faster exact solving of SAT formulae with a low number of occurrences per variable
- scientific article; zbMATH DE number 1099516
- Deciding separation formulas with SAT
- Efficient SAT solving under assumptions
Cites work
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A branch-and-bound algorithm for extracting smallest minimal unsatisfiable formulas
- A GRASP algorithm to solve the unicost set covering problem
- A new set of algebraic benchmark problems for SAT solvers
- A note on the complexity of Boolean concepts
- A theory of diagnosis from first principles
- A Way to Simplify Truth Functions
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- Efficient Privacy-Preserving Ciphertext-Policy Attribute Based-Encryption and Broadcast Encryption
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- Fast, flexible MUS enumeration
- scientific article; zbMATH DE number 3902554 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 918600 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Input Variable Assignment and Output Phase Optimization of PLA's
- Iterative and core-guided maxsat solving: a survey and assessment
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- Logic minimization techniques with applications to cryptology
- Minimal Logic Programs
- Progression in maximum satisfiability
- Quantified maximum satisfiability
- Quantified maximum satisfiability: a core-guided approach
- Redundancy in logic. I: CNF propositional formulae
- The Problem of Simplifying Truth Functions
- Theory and Applications of Satisfiability Testing
- Towards efficient MUS extraction
- Two-level logic minimization: an overview
Cited in
(8)- Minimal sets on propositional formulae. Problems and reductions
- On simplification of formulas with unconstrained variables and quantifiers
- Optimal symmetry breaking for graph problems
- McColl and minimization
- Two-level logic minimization: an overview
- Algebraic simplification techniques for propositional satisfiability
- Minimizing models for Tseitin-encoded SAT instances
- On subsumption removal and on-the-fly CNF simplification
This page was built for publication: SAT-Based Formula Simplification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3453233)