The following pages link to LMHS (Q28606):
Displaying 12 items.
- A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
- On tackling the limits of resolution in SAT solving (Q1680253) (← links)
- An assumption-based approach for solving the minimal S5-satisfiability problem (Q1799062) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach (Q2302940) (← links)
- Improved WPM encoding for coalition structure generation under MC-nets (Q2331103) (← links)
- Abstract cores in implicit hitting set MaxSat solving (Q2661355) (← links)
- LMHS: A SAT-IP Hybrid MaxSAT Solver (Q2818041) (← links)
- Pakota: A System for Enforcement in Abstract Argumentation (Q2835885) (← links)
- Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search (Q4988946) (← links)
- Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)
- Boosting branch-and-bound MaxSAT solvers with clause learning (Q5106262) (← links)
