A logical approach to efficient Max-SAT solving
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2086240 (Why is no real title available?)
- 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 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1947416 (Why is no real title available?)
- scientific article; zbMATH DE number 2080322 (Why is no real title available?)
- scientific article; zbMATH DE number 1522934 (Why is no real title available?)
- scientific article; zbMATH DE number 956866 (Why is no real title available?)
- scientific article; zbMATH DE number 2243387 (Why is no real title available?)
- A Complete Calculus for Max-SAT
- A Computing Procedure for Quantification Theory
- A ``logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
- A fast algorithm for the maximum clique problem
- A machine program for theorem-proving
- An algorithm for finding a maximum clique in a graph
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Bucket elimination: A unifying framework for reasoning
- Contribution to nonserial dynamic programming
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers
- Handbook of constraint programming.
- High-order consistency in valued constraint satisfaction
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- New Upper Bounds for Maximum Satisfiability
- New inference rules for Max-SAT
- On SAT Modulo Theories and Optimization Problems
- Optimal Protein Structure Alignment Using Maximum Cliques
- Resolution versus search: Two strategies for SAT
- Solving Max-SAT as weighted CSP
- Solving weighted CSP by maintaining arc consistency
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Using constraint programming to solve the maximum clique problem
Cited in
(42)- Semiring-induced propositional logic: definition and basic algorithms
- On the modelling and optimization of preferences in constraint-based temporal reasoning
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- A taxonomy of exact methods for partial Max-SAT
- Understanding the power of Max-SAT resolution through up-resilience
- An efficient solver for weighted Max-SAT
- MaxSAT resolution for regular propositional logic
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates
- New inference rules for Max-SAT
- Solving maximum weight clique using maximum satisfiability reasoning
- MaxSAT Resolution and Subcube Sums
- Minimaxsat: an efficient weighted Max-SAT solver
- scientific article; zbMATH DE number 6874827 (Why is no real title available?)
- Hinge-loss Markov random fields and probabilistic soft logic
- Solving #SAT and MAXSAT by Dynamic Programming
- Multi-language evaluation of exact solvers in graphical model discrete optimization
- Resolution procedures for multiple-valued optimization
- Incomplete inference for graph problems
- Principles and Practice of Constraint Programming – CP 2004
- Algorithms for Weighted Boolean Optimization
- Solving (Weighted) Partial MaxSAT through Satisfiability Testing
- Local Consistency in Weighted CSPs and Inference in Max-SAT
- Resolution-based lower bounds in MaxSAT
- Pruning search space for weighted first order Horn clause satisfiability
- Solving weighted Max-SAT problems in a reduced search space: a performance analysis
- Triangle-based consistencies for cost function networks
- Solving weighted MAX-SAT via global equilibrium search
- Iterative and core-guided maxsat solving: a survey and assessment
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Open-WBO: a modular MaxSAT solver
- MiFuMax -- a literate MaxSAT solver. System description
- \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
- Exploiting Cycle Structures in Max-SAT
- A framework for certified Boolean branch-and-bound optimization
- Exploiting subproblem optimization in SAT-based maxsat algorithms
- Modelling Max-CSP as Partial Max-SAT
- Volt: a lazy grounding framework for solving very large MaxSAT instances
- Proofs and Certificates for Max-SAT
- Solving Max-SAT as weighted CSP
- Phase Transition for Maximum Not-All-Equal Satisfiability
- A Preprocessor for Max-SAT Solvers
- A Max-SAT Inference-Based Pre-processing for Max-Clique
This page was built for publication: A logical approach to efficient Max-SAT solving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389619)
