SAT-Based Formula Simplification (Q3453233): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A GRASP algorithm to solve the unicost set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards efficient MUS extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic minimization techniques with applications to cryptology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Logic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level logic minimization: an overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear reasoning. A new form of the Herbrand-Gentzen theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified Maximum Satisfiability: / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5283008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity minimization in rule-based category learning: revising the catalog of Boolean concepts and evidence for non-minimal rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. I: CNF propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, flexible MUS enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal unsatisfiable subsets of constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative and core-guided maxsat solving: a survey and assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Simplifying Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Way to Simplify Truth Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input Variable Assignment and Output Phase Optimization of PLA's / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the complexity of Boolean concepts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient 2 and 3-flip neighborhood search algorithms for the MAX SAT: experimental Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Privacy-Preserving Ciphertext-Policy Attribute Based-Encryption and Broadcast Encryption / rank
 
Normal rank

Latest revision as of 03:26, 11 July 2024

scientific article
Language Label Description Also known as
English
SAT-Based Formula Simplification
scientific article

    Statements

    SAT-Based Formula Simplification (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references