The following pages link to João P. Marques-Silva (Q1430295):
Displaying 50 items.
- (Q253963) (redirect page) (← links)
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Fast, flexible MUS enumeration (Q272009) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- (Q545547) (redirect page) (← links)
- Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
- Heuristic-based backtracking relaxation for propositional satisfiability (Q862398) (← links)
- Boosting haplotype inference with local search (Q941674) (← links)
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (Q1037642) (← links)
- Satisfiability-based algorithms for Boolean optimization (Q1430296) (← links)
- PySAT: a Python toolkit for prototyping with SAT oracles (Q1656601) (← links)
- Computing with SAT oracles: past, present and future (Q1670750) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- On tackling the limits of resolution in SAT solving (Q1680253) (← links)
- Improving MCS enumeration via caching (Q1680254) (← links)
- Efficient data structures for backtrack search SAT solvers (Q1777399) (← links)
- A SAT-based approach to learn explainable decision sets (Q1799125) (← links)
- An overview of backtrack search satisfiability algorithms (Q1861908) (← links)
- SAT-based rigorous explanations for decision lists (Q2118305) (← links)
- Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
- On computing the union of MUSes (Q2181933) (← links)
- DRMaxSAT with MaxHS: first contact (Q2181935) (← links)
- Assessing heuristic machine learning explanations with model counting (Q2181938) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Efficient symmetry breaking for SAT-based minimum DFA inference (Q2278273) (← links)
- Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Random backtracking in backtrack search algorithms for satisfiability (Q2643305) (← links)
- Reasoning about strong inconsistency in ASP (Q2661359) (← links)
- (Q2741524) (← links)
- (Q2786909) (← links)
- (Q2786910) (← links)
- MCS Extraction with Sublinear Oracle Queries (Q2818026) (← links)
- BEACON: An Efficient SAT-Based Tool for Debugging $${\mathcal {EL}}{^+}$$ Ontologies (Q2818038) (← links)
- Efficient Reasoning for Inconsistent Horn Formulae (Q2835881) (← links)
- Solving QBF with Counterexample Guided Refinement (Q2843327) (← links)
- Improvements to Core-Guided Binary Search for MaxSAT (Q2843334) (← links)
- On Efficient Computation of Variable MUSes (Q2843335) (← links)
- Interpolant Learning and Reuse in SAT-Based Model Checking (Q2864382) (← links)
- SAT-Based Preprocessing for MaxSAT (Q2870118) (← links)
- Maximal Falsifiability (Q2870146) (← links)
- On QBF Proofs and Preprocessing (Q2870148) (← links)
- Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information (Q2889700) (← links)
- Knowledge Compilation with Empowerment (Q2891394) (← links)
- Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (Q2938491) (← links)
- On Computing Backbones of Propositional Theories (Q2999099) (← links)
