Pages that link to "Item:Q3192090"

The following pages link to Open-WBO: A Modular MaxSAT Solver, (Q3192090):

Displaying 36 items.

• New local search methods for partial MaxSAT (Q329035) (← links)
• On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes (Q505972) (← links)
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• maxSAT-based large neighborhood search for high school timetabling (Q1652069) (← links)
• A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
• Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
• Understanding cutting planes for QBFs (Q1784953) (← links)
• Understanding the power of Max-SAT resolution through up-resilience (Q2046032) (← links)
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
• Efficient local search for pseudo Boolean optimization (Q2118314) (← links)
• The \textsc{MergeSat} solver (Q2118329) (← links)
• A proof builder for Max-SAT (Q2118341) (← links)
• \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
• Coupling different integer encodings for SAT (Q2170178) (← links)
• Old techniques in new ways: clause weighting, unit propagation and hybridization for maximum satisfiability (Q2211872) (← links)
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
• Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
• Reactive synthesis with maximum realizability of linear temporal logic specifications (Q2303876) (← links)
• Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
• Pakota: A System for Enforcement in Abstract Argumentation (Q2835885) (← links)
• Exploiting Resolution-Based Representations for MaxSAT Solving (Q3453232) (← links)
• SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
• An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem (Q4577945) (← links)
• Optimizing phylogenetic supertrees using answer set programming (Q4593001) (← links)
• Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
• On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
• ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
• Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)
• Efficient Learning of Interpretable Classification Rules (Q5043563) (← links)
• Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
• Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
• (Q5148942) (← links)
• Integrating Passengers' Routes in Periodic Timetabling: A SAT approach. (Q5240221) (← links)
• Proofs and Certificates for Max-SAT (Q5870516) (← links)
• Functional synthesis via input-output separation (Q6102165) (← links)
• Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)