( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Industrial-Strength Certified SAT Solving through Verified SAT Proof Checking.

, , и . ICTAC, том 6255 из Lecture Notes in Computer Science, стр. 260-274. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

João Silva Ferraz

Gil dos Santos Guerreiro João

João Afonso Silva Palla Carreiro

João Barros

João Fonseca

 

Другие публикации лиц с тем же именем

QBF-Based Boolean Function Bi-Decomposition, , и . CoRR, (2011)The Inadequacy of Shapley Values for Explainability., и . CoRR, (2023)Auditing static machine learning anti-Malware tools against metamorphic attacks., , , и . Comput. Secur., (2021)Boolean Lexicographic Optimization., , , и . RCRA@CPAIOR, том 616 из CEUR Workshop Proceedings, CEUR-WS.org, (2010)New & improved models for SAT-based bi-decomposition., и . ACM Great Lakes Symposium on VLSI, стр. 141-146. ACM, (2012)cmMUS: A Tool for Circumscription-Based MUS Membership Testing., и . LPNMR, том 6645 из Lecture Notes in Computer Science, стр. 266-271. Springer, (2011)Assessing Heuristic Machine Learning Explanations with Model Counting., , , , и . SAT, том 11628 из Lecture Notes in Computer Science, стр. 267-278. Springer, (2019)Quantified Maximum Satisfiability: - A Core-Guided Approach., , и . SAT, том 7962 из Lecture Notes in Computer Science, стр. 250-266. Springer, (2013)SAT in Bioinformatics: Making the Case with Haplotype Inference., и . SAT, том 4121 из Lecture Notes in Computer Science, стр. 136-141. Springer, (2006)Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing., , и . SAT, том 9340 из Lecture Notes in Computer Science, стр. 324-342. Springer, (2015)