2023 - Research.com Computer Science in France Leader Award
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 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
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.
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.
GRASP: a search algorithm for propositional satisfiability
J.P. Marques-Silva;K.A. Sakallah.
IEEE Transactions on Computers (1999)
Conflict-Driven clause learning SAT solvers
Joao Marques-Silva;Ines Lynce;Sharad Malik.
Handbook of Satisfiability (2009)
SMT-Based Bounded Model Checking for Embedded ANSI-C Software
Lucas Cordeiro;Bernd Fischer;Joao Marques-Silva.
automated software engineering (2009)
Theory and Applications of Satisfiability Testing (SAT 2007)
João Marques-Silva;Karem A. Sakallah.
Solving QBF with counterexample guided refinement
Mikoláš Janota;William Klieber;Joao Marques-Silva;Edmund Clarke.
theory and applications of satisfiability testing (2012)
Algorithms for Weighted Boolean Optimization
Vasco Manquinho;Joao Marques-Silva;Jordi Planes.
theory and applications of satisfiability testing (2009)
On Computing Minimum Unsatisfiable Cores
I. Lynce;J. P. Marques-Silva.
theory and applications of satisfiability testing (2004)
Iterative and core-guided MaxSAT solving: A survey and assessment
Antonio Morgado;Federico Heras;Mark Liffiton;Jordi Planes.
Constraints - An International Journal (2013)
Boolean satisfiability in electronic design automation
João P. Marques-Silva;Karem A. Sakallah.
design automation conference (2000)
On computing minimal correction subsets
Joao Marques-Silva;Federico Heras;Mikolas Janota;Alessandro Previti.
international joint conference on artificial intelligence (2013)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: