The following pages link to João P. Marques-Silva (Q1430295):
Displayed 50 items.
- (Q3005895) (← links)
- Minimally Unsatisfiable Boolean Circuits (Q3007680) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Empirical Study of the Anatomy of Modern Sat Solvers (Q3007695) (← links)
- Restoring CSP Satisfiability with MaxSAT (Q3100180) (← links)
- Towards efficient MUS extraction (Q3164969) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- MUS Extraction Using Clausal Proofs (Q3192054) (← links)
- On Computing Preferred MUSes and MCSes (Q3192055) (← links)
- On Reducing Maximum Independent Set to Minimum Satisfiability (Q3192058) (← links)
- (Q3194802) (← links)
- Optimum stable model search: algorithms and implementation (Q3304091) (← links)
- (Q3429164) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- SAT-Based Formula Simplification (Q3453233) (← links)
- Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (Q3453236) (← links)
- SAT-Based Horn Least Upper Bounds (Q3453244) (← links)
- Improvements to Hybrid Incremental SAT Algorithms (Q3502706) (← links)
- Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (Q3502710) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Model checking with Boolean Satisfiability (Q3527691) (← links)
- (Q3574331) (← links)
- Algorithms for Weighted Boolean Optimization (Q3637182) (← links)
- (Q4424861) (← links)
- (Q4473048) (← links)
- (Q4473057) (← links)
- (Q4475702) (← links)
- GRASP: a search algorithm for propositional satisfiability (Q4571400) (← links)
- (Q4583686) (← links)
- Algorithms for computing backbones of propositional formulae (Q4589090) (← links)
- MaxSAT-based encodings for Group MaxSAT (Q4589092) (← links)
- Maximal falsifiability (Q4592701) (← links)
- (Q4736486) (← links)
- (Q4904223) (← links)
- Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription (Q4930765) (← links)
- RC2: an Efficient MaxSAT Solver (Q5015603) (← links)
- On Tackling Explanation Redundancy in Decision Trees (Q5041018) (← links)
- Progress in Artificial Intelligence (Q5191554) (← links)
- (Q5283008) (← links)
- Formula Preprocessing in MUS Extraction (Q5326319) (← links)
- On Propositional QBF Expansions and Q-Resolution (Q5326454) (← links)
- Parallel MUS Extraction (Q5326458) (← links)
- Quantified Maximum Satisfiability: (Q5326468) (← links)
- Efficient Haplotype Inference with Pseudo-boolean Optimization (Q5429358) (← links)
- Correct Hardware Design and Verification Methods (Q5493247) (← links)
- Symmetry Breaking for Maximum Satisfiability (Q5505539) (← links)
- Theory and Applications of Satisfiability Testing (Q5713742) (← links)
- Theory and Applications of Satisfiability Testing (Q5713745) (← links)
- Counting Models in Integer Domains (Q5756568) (← links)