Iterative and core-guided maxsat solving: a survey and assessment
From MaRDI portal
Publication:2348540
Recommendations
Cites work
- scientific article; zbMATH DE number 5139161 (Why is no real title available?)
- scientific article; zbMATH DE number 5139167 (Why is no real title available?)
- scientific article; zbMATH DE number 5510691 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1522934 (Why is no real title available?)
- scientific article; zbMATH DE number 918600 (Why is no real title available?)
- 2006 and 2007 Max-SAT evaluations: contributed instances
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A linear-time transformation of linear inequalities into conjunctive normal form
- A logical approach to efficient Max-SAT solving
- A modular approach to MaxSAT modulo theories
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
- A theory of diagnosis from first principles
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Algorithms for Weighted Boolean Optimization
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Answer set programming based on propositional satisfiability
- Antichain-Based QBF Solving
- Boolean lexicographic optimization: algorithms \& applications
- Cardinality networks: a theoretical and empirical study
- Community-Based Partitioning for MaxSAT Solving
- Consistent subsets of inconsistent systems: structure and behaviour
- Curriculum-based course timetabling with SAT and MaxSAT
- Efficient CNF encoding of Boolean cardinality constraints
- Efficient and accurate haplotype inference by combining parsimony and pedigree information
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Haplotype inference with pseudo-Boolean optimization
- Improvements to core-guided binary search for MaxSAT
- Improving Unsatisfiability-Based Algorithms for Boolean Optimization
- Improving exact algorithms for MAX-2-SAT
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Lazy satisfiability modulo theories
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Logic programming with satisfiability
- Max-ASP: Maximum Satisfiability of Answer Set Programs
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Minimaxsat: an efficient weighted Max-SAT solver
- NP trees and Carnap's modal logic
- New Upper Bounds for Maximum Satisfiability
- New inference rules for Max-SAT
- On SAT Modulo Theories and Optimization Problems
- On Solving the Partial MAX-SAT Problem
- Optimal Protein Structure Alignment Using Maximum Cliques
- Optimization in SMT with \(\mathcal{LA}(\mathbb Q)\) cost functions
- Principles and Practice of Constraint Programming – CP 2004
- QMaxSAT: A partial Max-SAT solver
- Resolution for Max-SAT
- SAT-based MaxSAT algorithms
- Satisfiability modulo the theory of costs: foundations and applications
- Semidefinite optimization approaches for satisfiability and maximum-satisfiability problems
- Soft arc consistency revisited
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Solving Max-SAT as weighted CSP
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- Solving satisfiability problems with preferences
- Solving weighted CSP by maintaining arc consistency
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Stochastic local search. Foundations and applications.
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Unsatisfiability-based optimization in clasp
- Variable Dependency in Local Search: Prevention Is Better Than Cure
- optsat: A Tool for Solving SAT Related Optimization Problems
Cited in
(40)- RC2: an efficient MaxSAT solver
- SAT-Based Formula Simplification
- Clause redundancy and preprocessing in maximum satisfiability
- Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Ranking with multiple reference points: efficient SAT-based learning procedures
- Fast, flexible MUS enumeration
- Quantified maximum satisfiability
- MaxSAT by improved instance-specific algorithm configuration
- Core-boosted linear search for incomplete MaxSAT
- A refined branching algorithm for the maximum satisfiability problem
- Using merging variables-based local search to solve special variants of MaxSAT problem
- Polarity and variable selection heuristics for SAT-based anytime MaxSAT
- Advances in WASP
- Propositional proof systems based on maximum satisfiability
- Propositional SAT solving
- Minimal sets on propositional formulae. Problems and reductions
- Quantified maximum satisfiability: a core-guided approach
- Improvements to core-guided binary search for MaxSAT
- On the complexity of inconsistency measurement
- New local search methods for partial MaxSAT
- Progression in maximum satisfiability
- A logic-based Benders decomposition for microscopic railway timetable planning
- Using execution logs for improving pseudo-Boolean propagation
- Assessing progress in SAT solvers through the Lens of incremental SAT
- Discrete optimization with decision diagrams
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Exploiting resolution-based representations for MaxSAT solving
- An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem
- On using incremental encodings in unsatisfiability-based MaxSAT solving
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
- Proofs and Certificates for Max-SAT
- Cores in core based MaxSat algorithms: an analysis
- On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
- Generalizing Core-Guided Max-SAT
- A comparative analysis and improvement of MaxSAT encodings for coalition structure generation under MC-nets
- MiFuMax -- a literate MaxSAT solver. System description
- WPM3: an (in)complete algorithm for weighted partial MaxSAT
- Exploiting subproblem optimization in SAT-based maxsat algorithms
Describes a project that uses
Uses Software
This page was built for publication: Iterative and core-guided maxsat solving: a survey and assessment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348540)
