Alexey Ignatiev

Orcid: 0000-0002-4535-2902

Affiliations:
  • Monash University, Melbourne, Australia


According to our database1, Alexey Ignatiev authored at least 78 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Delivering Inflated Explanations.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
On computing probabilistic abductive explanations.
Int. J. Approx. Reason., August, 2023

No silver bullet: interpretable ML models must be explained.
Frontiers Artif. Intell., February, 2023

Anytime Approximate Formal Feature Attribution.
CoRR, 2023

On Formal Feature Attribution and Its Approximation.
CoRR, 2023

On Tackling Explanation Redundancy in Decision Trees (Extended Abstract).
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

From Formal Boosted Tree Explanations to Interpretable Rule Sets.
Proceedings of the 29th International Conference on Principles and Practice of Constraint Programming, 2023

Eliminating the Impossible, Whatever Remains Must Be True: On Extracting and Applying Background Knowledge in the Context of Formal Explanations.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
On Tackling Explanation Redundancy in Decision Trees.
J. Artif. Intell. Res., 2022

Eliminating The Impossible, Whatever Remains Must Be True.
CoRR, 2022

Provably Precise, Succinct and Efficient Explanations for Decision Trees.
CoRR, 2022

Constraint-Driven Explanations for Black-Box ML Models.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Using MaxSAT for Efficient Explanations of Tree Ensembles.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Tractable Explanations for d-DNNF Classifiers.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Delivering Trustworthy AI through Formal XAI.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Learning Optimal Decision Sets and Lists with SAT.
J. Artif. Intell. Res., 2021

Efficient Explanations for Knowledge Compilation Languages.
CoRR, 2021

Efficient Explanations With Relevant Sets.
CoRR, 2021

Propositional proof systems based on maximum satisfiability.
Artif. Intell., 2021

Assessing Progress in SAT Solvers Through the Lens of Incremental SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

SAT-Based Rigorous Explanations for Decision Lists.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

On Efficiently Explaining Graph-Based Classifiers.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Reasoning-Based Learning of Interpretable ML Models.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Explanations for Monotonic Classifiers.
Proceedings of the 38th International Conference on Machine Learning, 2021

Optimizing Binary Decision Diagrams for Interpretable Machine Learning Classification.
Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2021

Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms.
Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

A Scalable Two Stage Approach to Computing Optimal Decision Sets.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
On Relating 'Why?' and 'Why Not?' Explanations.
CoRR, 2020

On Explaining Decision Trees.
CoRR, 2020

Optimal Decision Lists using SAT.
CoRR, 2020

Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Towards Trustable Explainable AI.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Branch Location Problems with Maximum Satisfiability.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Computing Optimal Decision Sets with SAT.
Proceedings of the Principles and Practice of Constraint Programming, 2020

Towards Formal Fairness in Machine Learning.
Proceedings of the Principles and Practice of Constraint Programming, 2020

From Contrastive to Abductive Explanations and Back Again.
Proceedings of the AIxIA 2020 - Advances in Artificial Intelligence, 2020

2019
RC2: an Efficient MaxSAT Solver.
J. Satisf. Boolean Model. Comput., 2019

On Validating, Repairing and Refining Heuristic ML Explanations.
CoRR, 2019

Assessing Heuristic Machine Learning Explanations with Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

DRMaxSAT with MaxHS: First Contact.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

On Computing the Union of MUSes.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

On Relating Explanations and Adversarial Examples.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference.
Proceedings of the Language and Automata Theory and Applications, 2019

Model-Based Diagnosis with Multiple Observations.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Abduction-Based Explanations for Machine Learning Models.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
PySAT: A Python Toolkit for Prototyping with SAT Oracles.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Learning Optimal Decision Trees with SAT.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A SAT-Based Approach to Learn Explainable Decision Sets.
Proceedings of the Automated Reasoning - 9th International Joint Conference, 2018

On Cryptographic Attacks Using Backdoors for SAT.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

MaxSAT Resolution With the Dual Rail Encoding.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Horn Maximum Satisfiability: Reductions, Algorithms & Applications.
CoRR, 2017

Model Based Diagnosis of Multiple Observations with Implicit Hitting Sets.
CoRR, 2017

On Tackling the Limits of Resolution in SAT Solving.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Cardinality Encodings for Graph Optimization Problems.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Computing Generalized Backbones.
Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

Lean Kernels in Description Logics.
Proceedings of the Semantic Web - 14th International Conference, 2017

Horn Maximum Satisfiability: Reductions, Algorithms and Applications.
Proceedings of the Progress in Artificial Intelligence, 2017

Debugging EL+ Ontologies through Horn MUS Enumeration.
Proceedings of the 30th International Workshop on Description Logics, 2017

2016
Quantified maximum satisfiability.
Constraints An Int. J., 2016

Maximal falsifiability.
AI Commun., 2016

MCS Extraction with Sublinear Oracle Queries.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

BEACON: An Efficient SAT-Based Tool for Debugging <i>EL</i>^+ Ontologies.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

Efficient Reasoning for Inconsistent Horn Formulae.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Propositional Abduction with Implicit Hitting Sets.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

On Incremental Core-Guided MaxSAT Solving.
Proceedings of the Principles and Practice of Constraint Programming, 2016

On Finding Minimum Satisfying Assignments.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
SAT-Based Formula Simplification.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Prime Compilation of Non-Clausal Formulae.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Efficient Model Based Diagnosis with Maximum Satisfiability.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Smallest MUS Extraction with Minimal Hitting Set Dualization.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
MSCG: Robust Core-Guided MaxSAT Solving.
J. Satisf. Boolean Model. Comput., 2014

On Reducing Maximum Independent Set to Minimum Satisfiability.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

Towards efficient optimization in package management systems.
Proceedings of the 36th International Conference on Software Engineering, 2014

Efficient Autarkies.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Progression in Maximum Satisfiability.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013
Quantified Maximum Satisfiability: - A Core-Guided Approach.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Maximal Falsifiability - Definitions, Algorithms, and Applications.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2013

2011
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011


  Loading...