default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Ignatiev
Person information
- affiliation: Monash University, Melbourne, Australia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Elvira Albert
, Maria Garcia de la Banda, Alejandro Hernández-Cerezo, Alexey Ignatiev, Albert Rubio, Peter J. Stuckey:
SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques. Proc. ACM Program. Lang. 8(PLDI): 1437-1462 (2024)- [j10]Jinqiang Yu, Michael Fu, Alexey Ignatiev, Chakkrit Tantithamthavorn, Peter J. Stuckey:
A Formal Explainer for Just-In-Time Defect Predictions. ACM Trans. Softw. Eng. Methodol. 33(7): 187:1-187:31 (2024) - [c60]Yacine Izza, Alexey Ignatiev, Peter J. Stuckey, João Marques-Silva:
Delivering Inflated Explanations. AAAI 2024: 12744-12753 - [c59]Yacine Izza, Xuanxiang Huang, António Morgado, Jordi Planes, Alexey Ignatiev, João Marques-Silva:
Distance-Restricted Explanations: Theoretical Underpinnings & Efficient Implementation. KR 2024 - [c58]Alexey Ignatiev, Zi Li Tan, Christos Karamanos:
Towards Universally Accessible SAT Technology. SAT 2024: 16:1-16:11 - [c57]Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. SAT 2024: 30:1-30:23 - [d1]Elvira Albert, Maria Garcia de la Banda, Alejandro Hernández-Cerezo, Alexey Ignatiev, Albert Rubio, Peter J. Stuckey:
Artifact for "SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-based, and SAT Techniques". Zenodo, 2024
- [i28]Yacine Izza, Xuanxiang Huang, António Morgado, Jordi Planes, Alexey Ignatiev, João Marques-Silva:
Distance-Restricted Explanations: Theoretical Underpinnings & Efficient Implementation. CoRR abs/2405.08297 (2024) - [i27]Zhixi Cai, Cristian Rojas Cardenas, Kevin Leo, Chenyuan Zhang, Kal Backman, Hanbing Li, Boying Li, Mahsa Ghorbanali, Stavya Datta, Lizhen Qu, Julian Gutierrez Santiago, Alexey Ignatiev, Yuan-Fang Li, Mor Vered, Peter J. Stuckey, Maria Garcia de la Banda, Hamid Rezatofighi:
NEUSIS: A Compositional Neuro-Symbolic Framework for Autonomous Perception, Reasoning, and Planning in Complex UAV Search Missions. CoRR abs/2409.10196 (2024) - [i26]Sushmita Paul, Jinqiang Yu, Jip J. Dekker, Alexey Ignatiev, Peter J. Stuckey:
Formal Explanations for Neuro-Symbolic AI. CoRR abs/2410.14219 (2024) - 2023
- [j9]João Marques-Silva, Alexey Ignatiev:
No silver bullet: interpretable ML models must be explained. Frontiers Artif. Intell. 6 (2023) - [j8]Yacine Izza, Xuanxiang Huang, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
On computing probabilistic abductive explanations. Int. J. Approx. Reason. 159: 108939 (2023) - [c56]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Nina Narodytska, João Marques-Silva:
Eliminating the Impossible, Whatever Remains Must Be True: On Extracting and Applying Background Knowledge in the Context of Formal Explanations. AAAI 2023: 4123-4131 - [c55]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey:
From Formal Boosted Tree Explanations to Interpretable Rule Sets. CP 2023: 38:1-38:21 - [c54]Yacine Izza, Alexey Ignatiev, João Marques-Silva:
On Tackling Explanation Redundancy in Decision Trees (Extended Abstract). IJCAI 2023: 6900-6904 - [i25]Yacine Izza, Alexey Ignatiev, Peter J. Stuckey, João Marques-Silva:
Delivering Inflated Explanations. CoRR abs/2306.15272 (2023) - [i24]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey:
On Formal Feature Attribution and Its Approximation. CoRR abs/2307.03380 (2023) - [i23]Jinqiang Yu, Graham Farr, Alexey Ignatiev, Peter J. Stuckey:
Anytime Approximate Formal Feature Attribution. CoRR abs/2312.06973 (2023) - 2022
- [j7]Yacine Izza, Alexey Ignatiev, João Marques-Silva:
On Tackling Explanation Redundancy in Decision Trees. J. Artif. Intell. Res. 75: 261-321 (2022) - [c53]Alexey Ignatiev, Yacine Izza, Peter J. Stuckey, João Marques-Silva:
Using MaxSAT for Efficient Explanations of Tree Ensembles. AAAI 2022: 3776-3785 - [c52]Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Martin C. Cooper, Nicholas Asher, João Marques-Silva:
Tractable Explanations for d-DNNF Classifiers. AAAI 2022: 5719-5728 - [c51]Aditya A. Shrotri, Nina Narodytska, Alexey Ignatiev, Kuldeep S. Meel, João Marques-Silva, Moshe Y. Vardi:
Constraint-Driven Explanations for Black-Box ML Models. AAAI 2022: 8304-8314 - [c50]João Marques-Silva, Alexey Ignatiev:
Delivering Trustworthy AI through Formal XAI. AAAI 2022: 12342-12350 - [i22]Yacine Izza, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
Provably Precise, Succinct and Efficient Explanations for Decision Trees. CoRR abs/2205.09569 (2022) - [i21]Yacine Izza, Alexey Ignatiev, João Marques-Silva:
On Tackling Explanation Redundancy in Decision Trees. CoRR abs/2205.09971 (2022) - [i20]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Nina Narodytska, João Marques-Silva:
Eliminating The Impossible, Whatever Remains Must Be True. CoRR abs/2206.09551 (2022) - [i19]Yacine Izza, Xuanxiang Huang, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
On Computing Probabilistic Abductive Explanations. CoRR abs/2212.05990 (2022) - 2021
- [j6]Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, António Morgado, João Marques-Silva:
Propositional proof systems based on maximum satisfiability. Artif. Intell. 300: 103552 (2021) - [j5]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Learning Optimal Decision Sets and Lists with SAT. J. Artif. Intell. Res. 72: 1251-1279 (2021) - [c49]Alexey Ignatiev, Edward Lam, Peter J. Stuckey, João Marques-Silva:
A Scalable Two Stage Approach to Computing Optimal Decision Sets. AAAI 2021: 3806-3814 - [c48]Alexander A. Semenov, Daniil Chivilikhin, Artem Pavlenko, Ilya V. Otpuschennikov, Vladimir Ulyantsev, Alexey Ignatiev:
Evaluating the Hardness of SAT Instances Using Evolutionary Optimization Algorithms. CP 2021: 47:1-47:18 - [c47]Gianpiero Cabodi, Paolo E. Camurati, Alexey Ignatiev, João Marques-Silva, Marco Palena, Paolo Pasini:
Optimizing Binary Decision Diagrams for Interpretable Machine Learning Classification. DATE 2021: 1122-1125 - [c46]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explanations for Monotonic Classifiers. ICML 2021: 7469-7479 - [c45]Alexey Ignatiev, João Marques-Silva, Nina Narodytska, Peter J. Stuckey:
Reasoning-Based Learning of Interpretable ML Models. IJCAI 2021: 4458-4465 - [c44]Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, João Marques-Silva:
On Efficiently Explaining Graph-Based Classifiers. KR 2021: 356-367 - [c43]Alexey Ignatiev, João Marques-Silva:
SAT-Based Rigorous Explanations for Decision Lists. SAT 2021: 251-269 - [c42]Stepan Kochemazov, Alexey Ignatiev, João Marques-Silva:
Assessing Progress in SAT Solvers Through the Lens of Incremental SAT. SAT 2021: 280-298 - [i18]Alexey Ignatiev, Edward Lam, Peter J. Stuckey, João Marques-Silva:
A Scalable Two Stage Approach to Computing Optimal Decision Sets. CoRR abs/2102.01904 (2021) - [i17]Alexey Ignatiev, João Marques-Silva:
SAT-Based Rigorous Explanations for Decision Lists. CoRR abs/2105.06782 (2021) - [i16]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explanations for Monotonic Classifiers. CoRR abs/2106.00154 (2021) - [i15]Yacine Izza, Alexey Ignatiev, Nina Narodytska, Martin C. Cooper, João Marques-Silva:
Efficient Explanations With Relevant Sets. CoRR abs/2106.00546 (2021) - [i14]Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, João Marques-Silva:
On Efficiently Explaining Graph-Based Classifiers. CoRR abs/2106.01350 (2021) - [i13]Xuanxiang Huang, Yacine Izza, Alexey Ignatiev, Martin C. Cooper, Nicholas Asher, João Marques-Silva:
Efficient Explanations for Knowledge Compilation Languages. CoRR abs/2107.01654 (2021) - 2020
- [c41]Alexey Ignatiev, Nina Narodytska, Nicholas Asher, João Marques-Silva:
From Contrastive to Abductive Explanations and Back Again. AI*IA 2020: 335-355 - [c40]Alexey Ignatiev, Martin C. Cooper, Mohamed Siala, Emmanuel Hebrard, João Marques-Silva:
Towards Formal Fairness in Machine Learning. CP 2020: 846-867 - [c39]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Computing Optimal Decision Sets with SAT. CP 2020: 952-970 - [c38]Oleg Zaikin, Alexey Ignatiev, João Marques-Silva:
Branch Location Problems with Maximum Satisfiability. ECAI 2020: 379-386 - [c37]Alexey Ignatiev:
Towards Trustable Explainable AI. IJCAI 2020: 5154-5158 - [c36]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay. NeurIPS 2020 - [i12]Jinqiang Yu, Alexey Ignatiev, Peter J. Stuckey, Pierre Le Bodic:
Computing Optimal Decision Sets with SAT. CoRR abs/2007.15140 (2020) - [i11]João Marques-Silva, Thomas Gerspacher, Martin C. Cooper, Alexey Ignatiev, Nina Narodytska:
Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay. CoRR abs/2008.05803 (2020) - [i10]Jinqiang Yu, Alexey Ignatiev, Pierre Le Bodic, Peter J. Stuckey:
Optimal Decision Lists using SAT. CoRR abs/2010.09919 (2020) - [i9]Yacine Izza, Alexey Ignatiev, João Marques-Silva:
On Explaining Decision Trees. CoRR abs/2010.11034 (2020) - [i8]Alexey Ignatiev, Nina Narodytska, Nicholas Asher, João Marques-Silva:
On Relating 'Why?' and 'Why Not?' Explanations. CoRR abs/2012.11067 (2020)
2010 – 2019
- 2019
- [j4]Alexey Ignatiev, António Morgado, João Marques-Silva:
RC2: an Efficient MaxSAT Solver. J. Satisf. Boolean Model. Comput. 11(1): 53-64 (2019) - [c35]Alexey Ignatiev, Nina Narodytska, João Marques-Silva:
Abduction-Based Explanations for Machine Learning Models. AAAI 2019: 1511-1519 - [c34]Alexey Ignatiev, António Morgado, Georg Weissenbacher, João Marques-Silva:
Model-Based Diagnosis with Multiple Observations. IJCAI 2019: 1108-1115 - [c33]Ilya Zakirzyanov, António Morgado, Alexey Ignatiev, Vladimir Ulyantsev, João Marques-Silva:
Efficient Symmetry Breaking for SAT-Based Minimum DFA Inference. LATA 2019: 159-173 - [c32]Alexey Ignatiev, Nina Narodytska, João Marques-Silva:
On Relating Explanations and Adversarial Examples. NeurIPS 2019: 15857-15867 - [c31]Carlos Mencía, Oliver Kullmann, Alexey Ignatiev, João Marques-Silva:
On Computing the Union of MUSes. SAT 2019: 211-221 - [c30]António Morgado, Alexey Ignatiev, Maria Luisa Bonet, João Marques-Silva, Sam Buss:
DRMaxSAT with MaxHS: First Contact. SAT 2019: 239-249 - [c29]Nina Narodytska, Aditya A. Shrotri, Kuldeep S. Meel, Alexey Ignatiev, João Marques-Silva:
Assessing Heuristic Machine Learning Explanations with Model Counting. SAT 2019: 267-278 - [i7]Alexey Ignatiev, Nina Narodytska, João Marques-Silva:
On Validating, Repairing and Refining Heuristic ML Explanations. CoRR abs/1907.02509 (2019) - 2018
- [c28]Maria Luisa Bonet, Sam Buss, Alexey Ignatiev, João Marques-Silva, António Morgado:
MaxSAT Resolution With the Dual Rail Encoding. AAAI 2018: 6565-6572 - [c27]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. AAAI 2018: 6641-6648 - [c26]Alexey Ignatiev, Filipe Pereira, Nina Narodytska, João Marques-Silva:
A SAT-Based Approach to Learn Explainable Decision Sets. IJCAR 2018: 627-645 - [c25]Nina Narodytska, Alexey Ignatiev, Filipe Pereira, João Marques-Silva:
Learning Optimal Decision Trees with SAT. IJCAI 2018: 1362-1368 - [c24]Alexey Ignatiev, António Morgado, João Marques-Silva:
PySAT: A Python Toolkit for Prototyping with SAT Oracles. SAT 2018: 428-437 - [i6]Alexander A. Semenov, Oleg Zaikin, Ilya V. Otpuschennikov, Stepan Kochemazov, Alexey Ignatiev:
On Cryptographic Attacks Using Backdoors for SAT. CoRR abs/1803.04646 (2018) - [i5]Alexey Ignatiev, Nina Narodytska, João Marques-Silva:
Abduction-Based Explanations for Machine Learning Models. CoRR abs/1811.10656 (2018) - 2017
- [c23]Alexey Ignatiev, João Marques-Silva, Carlos Mencía, Rafael Peñaloza:
Debugging EL+ Ontologies through Horn MUS Enumeration. Description Logics 2017 - [c22]João Marques-Silva, Alexey Ignatiev, António Morgado:
Horn Maximum Satisfiability: Reductions, Algorithms and Applications. EPIA 2017: 681-694 - [c21]Rafael Peñaloza, Carlos Mencía, Alexey Ignatiev, João Marques-Silva:
Lean Kernels in Description Logics. ESWC (1) 2017: 518-533 - [c20]Alessandro Previti, Alexey Ignatiev, Matti Järvisalo, João Marques-Silva:
On Computing Generalized Backbones. ICTAI 2017: 1050-1056 - [c19]Alexey Ignatiev, António Morgado, João Marques-Silva:
Cardinality Encodings for Graph Optimization Problems. IJCAI 2017: 652-658 - [c18]Alexey Ignatiev, António Morgado, João Marques-Silva:
On Tackling the Limits of Resolution in SAT Solving. SAT 2017: 164-183 - [i4]Alexey Ignatiev, António Morgado, João Marques-Silva:
On Tackling the Limits of Resolution in SAT Solving. CoRR abs/1705.01477 (2017) - [i3]João Marques-Silva, Alexey Ignatiev, António Morgado:
Horn Maximum Satisfiability: Reductions, Algorithms & Applications. CoRR abs/1705.05335 (2017) - [i2]Alexey Ignatiev, António Morgado, João Marques-Silva:
Model Based Diagnosis of Multiple Observations with Implicit Hitting Sets. CoRR abs/1707.01972 (2017) - 2016
- [j3]Alexey Ignatiev, António Morgado, Jordi Planes, João Marques-Silva:
Maximal falsifiability. AI Commun. 29(2): 351-370 (2016) - [j2]Alexey Ignatiev, Mikolás Janota, João Marques-Silva:
Quantified maximum satisfiability. Constraints An Int. J. 21(2): 277-302 (2016) - [c17]Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
On Finding Minimum Satisfying Assignments. CP 2016: 287-297 - [c16]Xujie Si, Xin Zhang, Vasco Manquinho, Mikolás Janota, Alexey Ignatiev, Mayur Naik:
On Incremental Core-Guided MaxSAT Solving. CP 2016: 473-482 - [c15]Alexey Ignatiev, António Morgado, João Marques-Silva:
Propositional Abduction with Implicit Hitting Sets. ECAI 2016: 1327-1335 - [c14]João Marques-Silva, Alexey Ignatiev, Carlos Mencía, Rafael Peñaloza:
Efficient Reasoning for Inconsistent Horn Formulae. JELIA 2016: 336-352 - [c13]Carlos Mencía, Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
MCS Extraction with Sublinear Oracle Queries. SAT 2016: 342-360 - [c12]M. Fareed Arif, Carlos Mencía, Alexey Ignatiev, Norbert Manthey, Rafael Peñaloza, João Marques-Silva:
BEACON: An Efficient SAT-Based Tool for Debugging EL^+ Ontologies. SAT 2016: 521-530 - [i1]Alexey Ignatiev, António Morgado, João Marques-Silva:
Propositional Abduction with Implicit Hitting Sets. CoRR abs/1604.08229 (2016) - 2015
- [c11]Alexey Ignatiev, Alessandro Previti, Mark H. Liffiton, João Marques-Silva:
Smallest MUS Extraction with Minimal Hitting Set Dualization. CP 2015: 173-182 - [c10]João Marques-Silva, Mikolás Janota, Alexey Ignatiev, António Morgado:
Efficient Model Based Diagnosis with Maximum Satisfiability. IJCAI 2015: 1966-1972 - [c9]Alessandro Previti, Alexey Ignatiev, António Morgado, João Marques-Silva:
Prime Compilation of Non-Clausal Formulae. IJCAI 2015: 1980-1988 - [c8]Alexey Ignatiev, Alessandro Previti, João Marques-Silva:
SAT-Based Formula Simplification. SAT 2015: 287-298 - 2014
- [j1]António Morgado, Alexey Ignatiev, João Marques-Silva:
MSCG: Robust Core-Guided MaxSAT Solving. J. Satisf. Boolean Model. Comput. 9(1): 129-134 (2014) - [c7]Alexey Ignatiev, António Morgado, Vasco Manquinho, Inês Lynce, João Marques-Silva:
Progression in Maximum Satisfiability. ECAI 2014: 453-458 - [c6]João Marques-Silva, Alexey Ignatiev, António Morgado, Vasco Manquinho, Inês Lynce:
Efficient Autarkies. ECAI 2014: 603-608 - [c5]Alexey Ignatiev, Mikolás Janota, João Marques-Silva:
Towards efficient optimization in package management systems. ICSE 2014: 745-755 - [c4]Alexey Ignatiev, António Morgado, João Marques-Silva:
On Reducing Maximum Independent Set to Minimum Satisfiability. SAT 2014: 103-120 - 2013
- [c3]Alexey Ignatiev, António Morgado, Jordi Planes, João Marques-Silva:
Maximal Falsifiability - Definitions, Algorithms, and Applications. LPAR 2013: 439-456 - [c2]Alexey Ignatiev, Mikolás Janota, João Marques-Silva:
Quantified Maximum Satisfiability: - A Core-Guided Approach. SAT 2013: 250-266 - 2011
- [c1]Alexey Ignatiev, Alexander A. Semenov:
DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions. SAT 2011: 76-89
Coauthor Index
[c60] [c59] [i28] [j9] [j8] [c56] [c54] [i25] [j7] [c53] [c52] [c51] [c50] [i22] [i21] [i20] [i19] [j6] [c49] [c47] [c46] [c45] [c44] [c43] [c42] [i18] [i17] [i16] [i15] [i14] [i13] [c41] [c40] [c38] [c36] [i11] [i9] [i8] [j4] [c35] [c34] [c33] [c32] [c31] [c30] [c29] [i7] [c28] [c26] [c25] [c24] [i5] [c23] [c22] [c21] [c20] [c19] [c18] [i4] [i3] [i2] [j3] [j2] [c17] [c15] [c14] [c13] [c12] [i1] [c11] [c10] [c9] [c8] [j1] [c7] [c6] [c5] [c4] [c3] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-15 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
