Quantified maximum satisfiability (Q272016): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10601-015-9195-9 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Reveal: A Formal Verification Tool for Verilog Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving (Weighted) Partial MaxSAT through Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based MaxSAT algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution for quantified Boolean formulas / 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: Unified QBF certification and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: QBF Resolution Systems and Their Proof Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for computing minimal equivalent subformulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards efficient MUS extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-Based Preprocessing for MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistent subsets of inconsistent systems: structure and behaviour / 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: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided abstraction refinement for symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving the Partial MAX-SAT Problem / 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: Exploiting Circuit Representations in QBF Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering and Utilizing Partial Duality in QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to Core-Guided Binary Search for MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Proof System for QBF Preprocessing / 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: On QBF Proofs and Preprocessing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with Counterexample Guided Refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction-Based Algorithm for 2QBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean functions as models for quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Non-prenex, Non-clausal QBF Solver with Game-State Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency / 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: Theory and Applications of Satisfiability Testing / 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: Incremental QBF Solving by DepQBF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Weighted Boolean Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A structure-preserving clause form translation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Extraction of High-Level Minimal Unsatisfiable Cores / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the Theory of Practical Quantified Boolean Formula Solving / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10601-015-9195-9 / rank
 
Normal rank

Latest revision as of 13:09, 9 December 2024

scientific article
Language Label Description Also known as
English
Quantified maximum satisfiability
scientific article

    Statements

    Quantified maximum satisfiability (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 April 2016
    0 references
    quantified Boolean formula
    0 references
    optimization
    0 references
    SAT
    0 references
    MaxSAT
    0 references
    smallest MUS/MES
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers