João Marques Silva | Academic Influence

João Marques Silva's AcademicInfluence.com Rankings

João Marques Silva

Mathematics

#6203

World Rank

#8637

Historical Rank

Group Theory

#64

World Rank

#82

Historical Rank

Number Theory

#175

World Rank

#230

Historical Rank

Algebra

#199

World Rank

#298

Historical Rank

mathematics Degrees

Download Badge

Mathematics

João Marques Silva's Degrees

PhD Mathematics University of Lisbon
Masters Mathematics University of Porto
Bachelors Mathematics University of Lisbon

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is João Marques Silva Influential?

(Suggest an Edit or Addition)

According to Wikipedia, João Paulo Marques Silva is a Portuguese researcher working on SAT. He developed the SAT solver GRASP during his PhD. Marques-Silva was a Senior Lecturer from October 2005 until June 2007 at the school of Electronics and Computer Science of the University of Southampton. In June 2007 he was promoted to Professor, the highest Professorship ranking in the UK. Since 2009 he moved to University College Dublin, Ireland.

(See a Problem?)

João Marques Silva's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

GRASP: A Search Algorithm for Propositional Satisfiability (1999) (1519)
GRASP-A new search algorithm for satisfiability (1996) (1222)
Conflict-Driven Clause Learning SAT Solvers (2021) (473)
SMT-Based Bounded Model Checking for Embedded ANSI-C Software (2009) (243)
Solving QBF with Counterexample Guided Refinement (2012) (239)
The Impact of Branching Heuristics in Propositional Satisfiability Algorithms (1999) (215)
Iterative and core-guided MaxSAT solving: A survey and assessment (2013) (167)
Algorithms for Weighted Boolean Optimization (2009) (167)
PySAT: A Python Toolkit for Prototyping with SAT Oracles (2018) (151)
On Computing Minimum Unsatisfiable Cores (2004) (148)
Theory and Applications of Satisfiability Testing - SAT 2007, 10th International Conference, Lisbon, Portugal, May 28-31, 2007, Proceedings (2007) (146)
On Computing Minimal Correction Subsets (2013) (143)
Boolean satisfiability in electronic design automation (2000) (132)
Practical applications of Boolean Satisfiability (2008) (130)
Algorithms for Maximum Satisfiability using Unsatisfiable Cores (2008) (125)
Fast, flexible MUS enumeration (2016) (121)
Robust search algorithms for test pattern generation (1997) (115)
Abduction-Based Explanations for Machine Learning Models (2018) (115)
Towards Robust CNF Encodings of Cardinality Constraints (2007) (108)
Combinational equivalence checking using satisfiability and recursive learning (1999) (102)
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability (2000) (101)
Efficient Haplotype Inference with Boolean Satisfiability (2006) (95)
Learning Optimal Decision Trees with SAT (2018) (94)
Core-Guided MaxSAT with Soft Cardinality Constraints (2014) (93)
Automated Design Debugging With Maximum Satisfiability (2010) (92)
Towards efficient MUS extraction (2012) (91)
Minimal Sets over Monotone Predicates in Boolean Formulae (2013) (80)
Solving QBF by Clause Selection (2015) (79)
Expansion-based QBF solving versus Q-resolution (2015) (78)
Empirical Study of the Anatomy of Modern Sat Solvers (2011) (77)
Core-Guided Binary Search Algorithms for Maximum Satisfiability (2011) (76)
On Relating Explanations and Adversarial Examples (2019) (74)
Boolean lexicographic optimization: algorithms & applications (2011) (73)
Prime implicant computation using satisfiability algorithms (1997) (71)
MUSer2: An Efficient MUS Extractor (2012) (71)
Abstraction-Based Algorithm for 2QBF (2011) (70)
Probing-based preprocessing techniques for propositional satisfiability (2003) (70)
On Improving MUS Extraction Algorithms (2011) (64)
SAT in Bioinformatics: Making the Case with Haplotype Inference (2006) (63)
Solving Linux Upgradeability Problems Using Boolean Optimization (2010) (62)
Smallest MUS Extraction with Minimal Hitting Set Dualization (2015) (62)
On Using Unsatisfiability for Solving Maximum Satisfiability (2007) (62)
On Using Cutting Planes in Pseudo-Boolean Optimization (2006) (60)
An exact solution to the minimum size test pattern problem (1998) (58)
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (2005) (58)
Algorithms for computing backbones of propositional formulae (2015) (58)
Minimal Unsatisfiability: Models, Algorithms and Applications (Invited Paper) (2010) (57)
Search Algorithms for Satisfiability Problems in Combinational Switching Circuits (1995) (56)
Assignment and reordering of incompletely specified pattern sequences targetting minimum power dissipation (1999) (55)
Literal-Based MCS Extraction (2015) (53)
Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (2006) (49)
Algorithms for solving Boolean satisfiability in combinational circuits (1999) (49)
Towards More Effective Unsatisfiability-Based Maximum Satisfiability Algorithms (2008) (48)
Accelerating MUS extraction with recursive model rotation (2011) (48)
Improvements to Core-Guided Binary Search for MaxSAT (2012) (47)
Conflict analysis in search algorithms for satisfiability (1996) (47)
Efficient data structures for backtrack search SAT solvers (2005) (46)
Dynamic Search-Space Pruning Techniques in Path Sensitization (1994) (46)
Partial MUS Enumeration (2013) (46)
Algebraic Simplification Techniques for Propositional Satisfiability (2000) (45)
A SAT-Based Approach to Learn Explainable Decision Sets (2018) (44)
An Overview of Backtrack Search Satisfiability Algorithms (2003) (43)
Search pruning techniques in SAT-based branch-and-bound algorithmsfor the binate covering problem (2002) (43)
On Computing Backbones of Propositional Theories (2010) (43)
Efficient Model Based Diagnosis with Maximum Satisfiability (2015) (41)
On Validating, Repairing and Refining Heuristic ML Explanations (2019) (41)
Efficient Haplotype Inference with Pseudo-boolean Optimization (2007) (41)
Semiformal Verification of Embedded Software in Medical Devices Considering Stringent Hardware Constraints (2009) (41)
Assessing Heuristic Machine Learning Explanations with Model Counting (2019) (39)
Efficient Algorithms for the Inference of Minimum Size DFAs (2001) (39)
On Solving Boolean Multilevel Optimization Problems (2009) (39)
Efficient Certified Resolution Proof Checking (2016) (38)
Effective lower bounding techniques for pseudo-Boolean optimization [EDA applications] (2005) (38)
MSCG: Robust Core-Guided MaxSAT Solving (2015) (38)
On Explaining Decision Trees (2020) (38)
Towards Equivalence Checking Between TLM and RTL Models (2007) (38)
Stochastic Systematic Search Algorithms for Satisfiability (2001) (38)
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas (2009) (37)
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay (2020) (36)
On applying incremental satisfiability to delay fault testing (2000) (35)
On Propositional QBF Expansions and Q-Resolution (2013) (34)
MaxSAT-Based MCS Enumeration (2012) (34)
Efficient search techniques for the inference of minimum size finite automata (1998) (33)
A Configware/Software Approach to SAT Solving (2001) (33)
Knowledge Compilation with Empowerment (2012) (33)
Prime Compilation of Non-Clausal Formulae (2015) (33)
Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking (2010) (33)
Timing analysis using propositional satisfiability (1998) (32)
Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (2015) (32)
From Contrastive to Abductive Explanations and Back Again (2020) (31)
Efficient and robust test generation-based timing analysis (1994) (31)
Satisfiability models and algorithms for circuit delay computation (2002) (31)
Complete Search Restart Strategies for Satisfiability (2001) (30)
BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies (2016) (30)
Explanations for Monotonic Classifiers (2021) (28)
Spatial and temporal design debug using partial MaxSAT (2009) (28)
On applying set covering models to test set compaction (1999) (27)
Formula Preprocessing in MUS Extraction (2013) (27)
Building State-of-the-Art SAT Solvers (2002) (27)
Good learning and implicit model enumeration (2005) (26)
Complete unrestricted backtracking algorithms for Satisfiability (2002) (26)
On Explaining Random Forests with SAT (2021) (26)
On Tackling the Limits of Resolution in SAT Solving (2017) (25)
On QBF Proofs and Preprocessing (2013) (25)
On the query complexity of selecting minimal sets for monotone predicates (2016) (25)
Computing Minimally Unsatisfiable Subformulas: State of the Art and Future Directions (2012) (25)
How to Complete an Interactive Configuration Process? (2009) (25)
MUS Extraction Using Clausal Proofs (2014) (25)
SAT-Based Preprocessing for MaxSAT (2013) (24)
Minimal sets on propositional formulae. Problems and reductions (2017) (24)
Towards efficient optimization in package management systems (2014) (24)
Enumerating Prime Implicants of Propositional Formulae in Conjunctive Normal Form (2014) (24)
An analysis of path sensitization criteria (1993) (23)
SAT-Based Rigorous Explanations for Decision Lists (2021) (23)
Haplotype inference with pseudo-Boolean optimization (2011) (22)
Progression in Maximum Satisfiability (2014) (22)
On Computing Minimal Equivalent Subformulas (2012) (22)
Solving satisfiability in combinational circuits (2003) (22)
MaxSAT Resolution With the Dual Rail Encoding (2018) (22)
On Efficiently Explaining Graph-Based Classifiers (2021) (22)
Satisfiability-Based Algorithms for Boolean Optimization (2004) (21)
Synthesizing Safe Bit-Precise Invariants (2014) (21)
Delivering Trustworthy AI through Formal XAI (2022) (21)
Efficient and Accurate Haplotype Inference by Combining Parsimony and Pedigree Information (2010) (21)
Propositional Abduction with Implicit Hitting Sets (2016) (21)
Algorithms for Satisfiability in Combinational Circuits Based on Backtrack Search and Recursive Learning (1999) (21)
Anatomy and Empirical Evaluation of Modern SAT Solvers (2011) (21)
Improvements to the Implementation of Interpolant-Based Model Checking (2005) (20)
Optimum stable model search: algorithms and implementation (2020) (20)
MCS Extraction with Sublinear Oracle Queries (2016) (20)
Interpolant Learning and Reuse in SAT-Based Model Checking (2007) (20)
Haplotype Inference with Boolean Satisfiability (2008) (19)
On the Query Complexity of Selecting Few Minimal Sets (2014) (19)
Hidden structure in unsatisfiable random 3-SAT: an empirical study (2004) (19)
Boosting Haplotype Inference with Local Search (2008) (19)
MILP for the Multi-objective VM Reassignment Problem (2015) (19)
Towards Formal Fairness in Machine Learning (2020) (18)
FPD-an environment for exact timing analysis (1991) (18)
The Effect of Nogood Recording in DPLL-CBJ SAT Algorithms (2002) (17)
Premise Set Caching for Enumerating Minimal Correction Subsets (2018) (17)
Counterexample Guided Abstraction Refinement Algorithm for Propositional Circumscription (2010) (17)
Propositional SAT Solving (2018) (17)
Iterative SAT Solving for Minimum Satisfiability (2012) (17)
Efficient Axiom Pinpointing with EL2MCS (2015) (16)
SAT and ATPG: algorithms for Boolean decision problems (2001) (16)
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem (2018) (16)
On Reducing Maximum Independent Set to Minimum Satisfiability (2014) (16)
Haplotype Inference by Pure Parsimony: A Survey (2010) (16)
Improving MCS Enumeration via Caching (2017) (16)
PackUp: Tools for Package Upgradability Solving (2012) (16)
On using satisfiability-based pruning techniques in covering algorithms (2000) (16)
Improvements to Hybrid Incremental SAT Algorithms (2008) (16)
MaxSAT-based encodings for Group MaxSAT (2015) (16)
Using MaxSAT for Efficient Explanations of Tree Ensembles (2022) (16)
Lean Kernels in Description Logics (2017) (15)
Exact and Hybrid Solutions for the Multi-Objective VM Reassignment Problem (2017) (15)
A Configurable Hardware/Software Approach to SAT Solving (2001) (15)
Quantified Maximum Satisfiability: - A Core-Guided Approach (2013) (15)
Counting Models in Integer Domains (2006) (15)
Solving satisfiability in combinational circuits with backtrack search and recursive learning (1999) (15)
On Unit-Refutation Complete Formulae with Existentially Quantified Variables (2012) (15)
An Empirical Study of Encodings for Group MaxSAT (2012) (14)
Model Checking Event-B by Encoding into Alloy (2008) (14)
Integer Programming Models for Optimization Problems in Test Generation (1998) (14)
On Relating 'Why?' and 'Why Not?' Explanations (2020) (14)
Lazy Decomposition for Distributed Decision Procedures (2011) (14)
Efficient Haplotype Inference with Combined CP and OR Techniques (2008) (13)
Heuristic backtracking algorithms for SAT (2003) (13)
Solving QBF with Free Variables (2013) (13)
Tractable Explanations for d-DNNF Classifiers (2022) (13)
A MAX-SAT Algorithm Portfolio (2008) (13)
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem (2010) (13)
Efficient Reasoning for Inconsistent Horn Formulae (2016) (13)
A Two-Variable Model for SAT-Based ATPG (2013) (13)
On Computing Preferred MUSes and MCSes (2014) (13)
Generalizing Redundancy in Propositional Logic: Foundations and Hitting Sets Duality (2012) (13)
Efficient Autarkies (2014) (13)
The Puzzling Role of Simplification in Propositional Satisfiability (2001) (13)
QBf-based boolean function bi-decomposition (2011) (13)
Algorithms for computing minimal equivalent subformulas (2014) (12)
On Computing the Union of MUSes (2019) (12)
Efficient and Tight Upper Bounds for Haplotype Inference by Pure Parsimony Using Delayed Haplotype Selection (2007) (12)
Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms (2011) (12)
On Deciding MUS Membership with QBF (2011) (12)
Efficient Relaxations of Over-constrained CSPs (2014) (12)
Quantified maximum satisfiability (2016) (12)
Model-Based Diagnosis with Multiple Observations (2019) (12)
Computing Maximal Autarkies with Few and Simple Oracle Queries (2015) (12)
TG-Pro: A SAT-based ATPG System (2012) (12)
cmMUS: A Tool for Circumscription-Based MUS Membership Testing (2011) (11)
SAT-Based Formula Simplification (2015) (11)
On lazy and eager interactive reconfiguration (2014) (11)
On the Tractability of Explaining Decisions of Classifiers (2021) (11)
Continuous Verification of Large Embedded Software Using SMT-Based Bounded Model Checking (2009) (11)
A Lazy Unbounded Model Checker for Event-B (2009) (11)
Improvements to satisfiability-based boolean function bi-decomposition (2011) (10)
On Tackling Explanation Redundancy in Decision Trees (2022) (10)
The Interaction Between Simplification and Search in Propositional Satisfiability (2001) (10)
Horn Maximum Satisfiability: Reductions, Algorithms and Applications (2017) (10)
Core minimization in SAT-based abstraction (2013) (10)
Model checking with Boolean Satisfiability (2008) (10)
Breaking Symmetries in SAT Matrix Models (2007) (9)
A Scalable Two Stage Approach to Computing Optimal Decision Sets (2021) (9)
Random backtracking in backtrack search algorithms for satisfiability (2007) (9)
Backtracking (2008) (9)
Minimally Unsatisfiable Boolean Circuits (2011) (9)
Ravel-XL: a hardware accelerator for assigned-delay compiled-code logic gate simulation (1993) (9)
Auditing static machine learning anti-Malware tools against metamorphic attacks (2021) (9)
Heuristic-Based Backtracking for Propositional Satisfiability (2003) (9)
Model-Guided Approaches for MaxSAT Solving (2013) (8)
On Efficient Computation of Variable MUSes (2012) (8)
Efficient Data Structures for Fast SAT Solvers (2001) (8)
TG-PRO: A new model for SAT-based ATPG (2009) (8)
Maximal Falsifiability - Definitions, Algorithms, and Applications (2013) (8)
Computing Minimal Sets on Propositional Formulae I: Problems & Reductions (2014) (8)
Efficient Explanations With Relevant Sets (2021) (8)
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference (2019) (8)
Heuristic-Based Backtracking Relaxation for Propositional Satisfiability (2005) (8)
Search Pruning Conditions for Boolean Optimization (2000) (8)
Efficient Explanations for Knowledge Compilation Languages (2021) (8)
Concurrent path sensitization in timing analysis (1993) (7)
OpenSAT: An Open Source SAT Software Project (2003) (7)
Using Rewarding Mechanisms for Improving Branching Heuristics (2004) (7)
MUSer2: an efficient MUS extractor, system description (2012) (7)
Constraint-Driven Explanations for Black-Box ML Models (2022) (7)
On Solving Boolean Optimization with Satisfiability-Based Algorithms (2000) (7)
On Implementing More Efficient SAT Data Structures (2003) (6)
Reasoning About Inconsistent Formulas (2020) (6)
Symmetry Breaking for Maximum Satisfiability (2008) (6)
Experimental Analysis of Backbone Computation Algorithms (2012) (6)
Lower Bounds and Upper Bounds for MaxSAT (2012) (6)
Reasoning-Based Learning of Interpretable ML Models (2021) (6)
Logic-Based Explainability in Machine Learning (2022) (5)
DRMaxSAT with MaxHS: First Contact (2019) (5)
Haplotype Inference Combining Pedigrees and Unrelated Individuals (5)
The Effect of Nogood Recording in MAC-CBJ SAT Algorithms (2002) (5)
On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization (2005) (5)
A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems (2014) (5)
Model Based Diagnosis of Multiple Observations with Implicit Hitting Sets (2017) (5)
Test pattern generation for width compression in BIST (1999) (5)
Maximal falsifiability (2016) (4)
Restoring CSP Satisfiability with MaxSAT (2011) (4)
Algorithms for Propositional Model Enumeration and Counting (2005) (4)
Haplotype Inference with Boolean Constraint Solving: An Overview (2008) (4)
Towards Provably Complete Stochastic Search Algorithms for Satisfiability (2001) (4)
Propositional proof systems based on maximum satisfiability (2021) (4)
Computing with SAT Oracles: Past, Present and Future (2018) (4)
SAT-Based Horn Least Upper Bounds (2015) (4)
Invited Tutorial: Boolean Satisfiability Algorithms and Applications in Electronic Design Automation (2000) (4)
An experimental study of satisfiability search heuristics (2000) (4)
Optimizing Binary Decision Diagrams for Interpretable Machine Learning Classification (2021) (4)
Provably Precise, Succinct and Efficient Explanations for Decision Trees (2022) (4)
On Finding Minimum Satisfying Assignments (2016) (4)
From Shallow to Deep Interactions Between Knowledge Representation, Reasoning and Machine Learning (Kay R. Amel group) (2019) (4)
Eliminating The Impossible, Whatever Remains Must Be True (2022) (4)
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem (2008) (4)
Parallel MUS Extraction (2013) (4)
SAT Solvers (2014) (4)
Satisfiability-based algorithms for pseudo-Boolean optimization using Gomory cuts and search restarts (2005) (4)
Haplotype Inference Using Propositional Satisfiability (2011) (3)
Comparing SAT preprocessing techniques (2002) (3)
On Computing Relevant Features for Explaining NBCs (2022) (3)
Cardinality Encodings for Graph Optimization Problems (2017) (3)
On Deciding Feature Membership in Explanations of SDD & Related Classifiers (2022) (3)
Integrating Simplication Techniques in SAT Algorithms (2007) (3)
On Applying Unit Propagation-Based Lower Bounds in Pseudo-Boolean Optimization (2008) (3)
Computing Shortest Resolution Proofs (2019) (2)
Algorithms for finding dispensable variables (2009) (2)
Integration of lower bound estimates in pseudo-Boolean optimization (2004) (2)
Debugging EL+ Ontologies through Horn MUS Enumeration (2017) (2)
Feature Necessity & Relevancy in ML Classifier Explanations (2022) (2)
On Validating Boolean Optimizers (2011) (2)
On Computing Generalized Backbones (2017) (2)
Boolean satisfiability and EDA applications (2009) (2)
Unrestricted Backtracking Algorithms for Satisfiability (2001) (2)
Timeout-Sensitive Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems (2014) (2)
Industrial-Strength Formally Certified SAT Solving (2009) (2)
Proceedings of the 10th international conference on Theory and applications of satisfiability testing (2007) (1)
Towards Efficient Axiom Pinpointing of EL+ Ontologies (2015) (1)
Reports of the 2016 AAAI Workshop Program (2016) (1)
On Minimal Corrections in ASP (2014) (1)
Preface: The Beyond NP Workshop (2016) (1)
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT (2021) (1)
Generic ILP vs Specialized 0-1 ILP for Haplotype Inference (2008) (1)
Reports from the 2015 AAAI Workshop Program (2015) (1)
On Computing Probabilistic Abductive Explanations (2022) (1)
Report on the SAT 2007 Conference on Theory and Applications of Satisfiability Testing (2007) (1)
Optimizing the utilization of interpolants in SAT-based model checking (2005) (1)
SAT-based Preprocessing for MaxSAT (extended version) (2013) (1)
Heuristic-Based Backtracking Relaxation for (2005) (1)
Hybrid Incremental Algorithms for Boolean Satisfiability (2012) (1)
Tractability of explaining classifier decisions (2022) (1)
An experimental study of satisfiability search heuristics (poster paper) (2000) (1)
Boolean Lexicographic Optimization (2010) (1)
Satisfiability-Based Functional Delay Fault Testing (1999) (1)
New & improved models for SAT-based bi-decomposition (2012) (1)
Improving SAT Algorithms by Using Search Pruning Techniques (2001) (1)
Conditions for Non-Chronological Backtracking in Boolean Optimization (2008) (0)
MSCG: Robust Core-Guided MaxSAT Solving system description (2015) (0)
Lower Bounding Techniques for SAT-Based Boolean Optimization (2001) (0)
40th IEEE International Symposium on Multiple-Valued Logic, ISMVL 2010, Barcelona, Spain, 26-28 May 2010 (2010) (0)
Fast, flexible MUS enumeration (2015) (0)
Branch Location Problems with Maximum Satisfiability (2020) (0)
Problem solving with SAT oracles (2014) (0)
Automated Reasoning in Explainable AI (2021) (0)
Solving QBF by Clause Selection ∗ ( preprint of an IJCAI ’ 15 paper ) (2015) (0)
Automated Design Debugging with (2010) (0)
3 SAT-Based Learning of Decision Trees (2018) (0)
T L  C S C A  E E  M Sat S (2011) (0)
On Applying Boolean Satisfiability to Delay Fault Testing (2000) (0)
Golden Rules for Building Effective SAT Solvers (2002) (0)
Session details: Advances in SAT (2002) (0)
Quantified maximum satisfiability (2015) (0)
An Algorithm Porfolio for MAX-SAT (2008) (0)
Horn Maximum Satisfiability: Reductions, Algorithms & Applications (2017) (0)
How to complete an interactive configuration process? Configuring as shopping (2010) (0)
Formally Verifying the Solution to the Boolean Pythagorean Triples Problem (2018) (0)
The CQuest SAT Solver (0)
Reasoning About Strong Inconsistency in ASP (2020) (0)
The Inadequacy of Shapley Values for Explainability (2023) (0)
Extending the Synergies Between SAT and Description Logics (Dagstuhl Seminar 21361) (2021) (0)
Tuning Randomization in Backtrack Search SAT Algorithms (2002) (0)
An Experimental Study of Satisfiability Search Heuristics Karem (1999) (0)
No silver bullet: interpretable ML models must be explained (2023) (0)
Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization (2004) (0)
On Solving Boolean Multilevel Optimization Problemse (2009) (0)

This paper list is powered by the following services:

Other Resources About João Marques Silva

en.wikipedia.org

What Schools Are Affiliated With João Marques Silva?

João Marques Silva is affiliated with the following schools: