SAT-Based Formula Simplification
From MaRDI portal
Publication:3453233
DOI10.1007/978-3-319-24318-4_21zbMATH Open1471.68245OpenAlexW2287661067MaRDI QIDQ3453233FDOQ3453233
Authors: A. A. Ignatiev, Alessandro Previti, Joao Marques-Silva 
Publication date: 20 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24318-4_21
Recommendations
- scientific article; zbMATH DE number 2090300
- An Improved SAT Algorithm in Terms of Formula Length
- Formalization and implementation of modern SAT solvers
- scientific article; zbMATH DE number 2080337
- Theory and Applications of Satisfiability Testing
- A fast algorithm for SAT in terms of formula length
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 1099516
- scientific article; zbMATH DE number 1903355
- Efficient SAT solving under assumptions
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Classical propositional logic (03B05)
Cites Work
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Title not available (Why is that?)
- Quantified maximum satisfiability: a core-guided approach
- Title not available (Why is that?)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- Redundancy in logic. I: CNF propositional formulae
- A Way to Simplify Truth Functions
- Title not available (Why is that?)
- The Problem of Simplifying Truth Functions
- A theory of diagnosis from first principles
- Iterative and core-guided maxsat solving: a survey and assessment
- Logic minimization techniques with applications to cryptology
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- Towards efficient MUS extraction
- Progression in maximum satisfiability
- Theory and Applications of Satisfiability Testing
- Linear reasoning. A new form of the Herbrand-Gentzen theorem
- A GRASP algorithm to solve the unicost set covering problem
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- Title not available (Why is that?)
- Two-level logic minimization: an overview
- Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation
- A note on the complexity of Boolean concepts
- Efficient Privacy-Preserving Ciphertext-Policy Attribute Based-Encryption and Broadcast Encryption
- Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules
- Minimal Logic Programs
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- Input Variable Assignment and Output Phase Optimization of PLA's
- Theory and Applications of Satisfiability Testing
Cited In (8)
- Theory and Applications of Satisfiability Testing
- Optimal symmetry breaking for graph problems
- Two-level logic minimization: an overview
- Minimal sets on propositional formulae. Problems and reductions
- Minimizing models for Tseitin-encoded SAT instances
- McColl and minimization
- Title not available (Why is that?)
- On simplification of formulas with unconstrained variables and quantifiers
Uses Software
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)
