( en | de | ru )

 

Disambiguation of "Ignatiev, Alexey"

Author of the publication

copydeleteadd this publication to your clipboard
Using MaxSAT for Efficient Explanations of Tree Ensembles.

, , , and . AAAI, page 3776-3785. AAAI Press, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Pavel Ignatiev

Alexey Shaytan

Alexey Dashevsky

Alexey Mikaberidze

Alexey Lomonosov

 

Other publications of authors with the same name

Abduction-Based Explanations for Machine Learning Models., , and . CoRR, (2018)On Finding Minimum Satisfying Assignments., , and . CP, volume 9892 of Lecture Notes in Computer Science, page 287-297. Springer, (2016)SAT-Based Formula Simplification., , and . SAT, volume 9340 of Lecture Notes in Computer Science, page 287-298. Springer, (2015)Using MaxSAT for Efficient Explanations of Tree Ensembles., , , and . AAAI, page 3776-3785. AAAI Press, (2022)On Cryptographic Attacks Using Backdoors for SAT., , , , and . AAAI, page 6641-6648. AAAI Press, (2018)Computing Optimal Decision Sets with SAT., , , and . CP, volume 12333 of Lecture Notes in Computer Science, page 952-970. Springer, (2020)Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms., , , , , and . CP, volume 210 of LIPIcs, page 47:1-47:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Anytime Approximate Formal Feature Attribution., , , and . SAT, volume 305 of LIPIcs, page 30:1-30:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Progression in Maximum Satisfiability., , , , and . ECAI, volume 263 of Frontiers in Artificial Intelligence and Applications, page 453-458. IOS Press, (2014)Learning Optimal Decision Sets and Lists with SAT., , , and . J. Artif. Intell. Res., (2021)