Pages that link to "Item:Q2389619"
From MaRDI portal
The following pages link to A logical approach to efficient Max-SAT solving (Q2389619):
Displaying 22 items.
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Resolution-based lower bounds in MaxSAT (Q606913) (← links)
- On the modelling and optimization of preferences in constraint-based temporal reasoning (Q646549) (← links)
- Triangle-based consistencies for cost function networks (Q1706773) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Multi-language evaluation of exact solvers in graphical model discrete optimization (Q2398440) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks (Q2429986) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- Modelling Max-CSP as Partial Max-SAT (Q3502687) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- Branch and Bound for Boolean Optimization and the Generation of Optimality Certificates (Q3637179) (← links)
- Exploiting Cycle Structures in Max-SAT (Q3637180) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- Phase Transition for Maximum Not-All-Equal Satisfiability (Q4632221) (← links)
- (Q4637032) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- Proofs and Certificates for Max-SAT (Q5870516) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
