Quantified maximum satisfiability
From MaRDI portal
Publication:272016
DOI10.1007/S10601-015-9195-9zbMATH Open1334.90075OpenAlexW1726810408MaRDI QIDQ272016FDOQ272016
Authors: A. A. Ignatiev, Mikoláš Janota, Joao Marques-Silva 
Publication date: 20 April 2016
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-015-9195-9
Recommendations
Cites Work
- Theory and Applications of Satisfiability Testing
- Reveal: A Formal Verification Tool for Verilog Designs
- Exploiting circuit representations in QBF solving
- A structure-preserving clause form translation
- Resolution for quantified Boolean formulas
- Unified QBF certification and its applications
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Solving QBF with counterexample guided refinement
- Abstraction-based algorithm for 2QBF
- Counterexample-guided abstraction refinement for symbolic model checking
- Consistent subsets of inconsistent systems: structure and behaviour
- Contributions to the theory of practical quantified Boolean formula solving
- A non-prenex, non-clausal QBF solver with game-state learning
- 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 theory of diagnosis from first principles
- Iterative and core-guided maxsat solving: a survey and assessment
- Boolean functions as models for quantified Boolean formulas
- Improvements to core-guided binary search for MaxSAT
- SAT-based preprocessing for MaxSAT
- Long-distance resolution: proof generation and strategy extraction in search-based QBF solving
- On QBF Proofs and Preprocessing
- Incremental QBF solving by DepQBF
- Faster Extraction of High-Level Minimal Unsatisfiable Cores
- Towards efficient MUS extraction
- QBF Resolution Systems and Their Proof Complexities
- A unified proof system for QBF preprocessing
- SAT-based MaxSAT algorithms
- Resolution and Expressiveness of Subclasses of Quantified Boolean Formulas and Circuits
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Algorithms for Weighted Boolean Optimization
- Title not available (Why is that?)
- Algorithms for computing minimal equivalent subformulas
- Progression in maximum satisfiability
- Mathematical Foundations of Computer Science 2004
- Recovering and utilizing partial duality in QBF
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- On Solving the Partial MAX-SAT Problem
Cited In (10)
- SAT-Based Formula Simplification
- Counting minimal unsatisfiable subsets
- Quantified maximum satisfiability: a core-guided approach
- A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
- Efficiently explaining CSPs with unsatisfiable subset optimization
- Query-guided maximum satisfiability
- Maximum Constraint Satisfaction on Diamonds
- SAT-based rigorous explanations for decision lists
- Computing smallest MUSes of quantified Boolean formulas
- Title not available (Why is that?)
Uses Software
This page was built for publication: Quantified maximum satisfiability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q272016)
