Pages that link to "Item:Q2389619"

The following pages link to A logical approach to efficient Max-SAT solving (Q2389619):

Displayed 10 items.

• Resolution-based lower bounds in MaxSAT (Q606913) ‎ (← links)
• On the modelling and optimization of preferences in constraint-based temporal reasoning (Q646549) ‎ (← links)
• Incomplete inference for graph problems (Q1947627) ‎ (← 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)
• 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)