What is he best known for?
The fields of study he is best known for:
- Algorithm
- Programming language
- Artificial intelligence
Joao Marques-Silva mostly deals with Algorithm, Satisfiability, Boolean satisfiability problem, Theoretical computer science and Maximum satisfiability problem.
His Algorithm research includes themes of Solver, Key and Counterexample.
His work carried out in the field of Satisfiability brings together such families of science as Set, Constraint satisfaction, State and Enumeration.
His studies deal with areas such as #SAT, Electronic design automation, Combinational logic, Range and Computation as well as Boolean satisfiability problem.
The study incorporates disciplines such as Boolean function and Computational problem in addition to Theoretical computer science.
His Maximum satisfiability problem research is multidisciplinary, incorporating perspectives in Identification, Core, Iterative method, Sequential logic and Optimization problem.
His most cited work include:
- GRASP: a search algorithm for propositional satisfiability (1141 citations)
- Conflict-driven clause learning SAT solvers (229 citations)
- Theory and Applications of Satisfiability Testing (SAT 2007) (138 citations)
What are the main themes of his work throughout his whole career to date?
His main research concerns Algorithm, Theoretical computer science, Boolean satisfiability problem, Satisfiability and Maximum satisfiability problem.
His research integrates issues of Range and Set in his study of Algorithm.
In his research on the topic of Theoretical computer science, Combinational logic is strongly related with Electronic design automation.
His study on Boolean satisfiability problem also encompasses disciplines like
- #SAT that connect with fields like Formal equivalence checking,
- Model checking together with Software.
He carries out multidisciplinary research, doing studies in Satisfiability and DPLL algorithm.
Within one scientific family, he focuses on topics pertaining to Solver under Maximum satisfiability problem, and may sometimes address concerns connected to Preprocessor.
He most often published in these fields:
- Algorithm (51.35%)
- Theoretical computer science (42.91%)
- Boolean satisfiability problem (36.15%)
What were the highlights of his more recent work (between 2016-2021)?
- Theoretical computer science (42.91%)
- Artificial intelligence (7.09%)
- Range (11.82%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Theoretical computer science, Artificial intelligence, Range, Maximum satisfiability problem and Boolean satisfiability problem.
His Theoretical computer science research includes elements of Inference and Enumeration.
As a member of one scientific family, Joao Marques-Silva mostly works in the field of Artificial intelligence, focusing on Machine learning and, on occasion, Heuristic, Transparency and Succinctness.
His Maximum satisfiability problem study is related to the wider topic of Algorithm.
His studies in Algorithm integrate themes in fields like Encoding and Exponential function.
He interconnects Computational complexity theory, Implementation and Satisfiability modulo theories in the investigation of issues within Boolean satisfiability problem.
Between 2016 and 2021, his most popular works were:
- PySAT: A Python Toolkit for Prototyping with SAT Oracles (51 citations)
- Learning Optimal Decision Trees with SAT. (35 citations)
- Abduction-Based Explanations for Machine Learning Models (32 citations)
In his most recent research, the most cited papers focused on:
- Programming language
- Algorithm
- Artificial intelligence
His primary areas of study are Artificial intelligence, Maximum satisfiability problem, Boolean satisfiability problem, Proof complexity and Machine learning.
His research on Maximum satisfiability problem concerns the broader Algorithm.
His biological study spans a wide range of topics, including Python, Programming language and Implementation.
His work investigates the relationship between Proof complexity and topics such as Resolution that intersect with problems in Conjunctive normal form, Pigeonhole principle, Polynomial, Computer-assisted proof and Conjecture.
His work carried out in the field of Machine learning brings together such families of science as Range and Heuristic.
Joao Marques-Silva has included themes like Predicate and Tracing in his Theoretical computer science study.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
