The following pages link to Antonio Morgado (Q1656600):
Displaying 19 items.
- PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601) (← links)
- On tackling the limits of resolution in SAT solving (Q1680253) (← links)
- DRMaxSAT with MaxHS: first contact (Q2181935) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Efficient symmetry breaking for SAT-based minimum DFA inference (Q2278273) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- SAT-based encodings for optimal decision trees with explicit paths (Q2661377) (← links)
- Improvements to Core-Guided Binary Search for MaxSAT (Q2843334) (← links)
- SAT-Based Preprocessing for MaxSAT (Q2870118) (← links)
- Maximal Falsifiability (Q2870146) (← links)
- (Q3005895) (← links)
- On Reducing Maximum Independent Set to Minimum Satisfiability (Q3192058) (← links)
- MaxSAT-based encodings for Group MaxSAT (Q4589092) (← links)
- Maximal falsifiability (Q4592701) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
- (Q5283008) (← links)
- Counting Models in Integer Domains (Q5756568) (← links)
- Computing generating sets of minimal size in finite algebras (Q6108373) (← links)
- Feature necessity \& relevancy in ML classifier explanations (Q6535350) (← links)