| sKizzo: a suite to evaluate and certify QBFs M Benedetti International Conference on Automated Deduction, 369-376, 2005 | 166 | 2005 |
| Evaluating QBFs via symbolic skolemization M Benedetti International Conference on Logic for Programming Artificial Intelligence …, 2005 | 108 | 2005 |
| QBF-based formal verification: Experience and perspectives M Benedetti, H Mangassarian Journal on Satisfiability, Boolean Modeling and Computation 5 (1-4), 133-191, 2009 | 100 | 2009 |
| Bounded model checking for past LTL M Benedetti, A Cimatti Tools and Algorithms for the Construction and Analysis of Systems: 9th …, 2003 | 94 | 2003 |
| QCSP Made Practical by Virtue of Restricted Quantification. M Benedetti, A Lallouet, J Vautard IJCAI 7, 38-43, 2007 | 82 | 2007 |
| Quantifier trees for QBFs M Benedetti International Conference on Theory and Applications of Satisfiability …, 2005 | 61 | 2005 |
| A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test H Mangassarian, A Veneris, S Safarpour, M Benedetti, D Smith 2007 IEEE/ACM International Conference on Computer-Aided Design, 240-245, 2007 | 60 | 2007 |
| Extracting certificates from quantified boolean formulas M Benedetti IJCAI, 47-53, 2005 | 59 | 2005 |
| Robust QBF encodings for sequential circuits with applications to verification, debug, and test H Mangassarian, A Veneris, M Benedetti IEEE Transactions on Computers 59 (7), 981-994, 2010 | 47 | 2010 |
| Quantified constraint optimization M Benedetti, A Lallouet, J Vautard International Conference on Principles and Practice of Constraint …, 2008 | 40 | 2008 |
| sKizzo: a QBF decision procedure based on propositional skolemization and symbolic reasoning M Benedetti Tech. Rep., ITC-Irst, 2004 | 31 | 2004 |
| COVID-19 and company knowledge graphs: assessing golden powers and economic impact of selective lockdown via AI reasoning L Bellomarini, M Benedetti, A Gentili, R Laurendi, D Magnanimi, A Muci, ... arXiv preprint arXiv:2004.10119, 2020 | 26 | 2020 |
| Incremental compilation-to-SAT procedures M Benedetti, S Bernardini International Conference on Theory and Applications of Satisfiability …, 2004 | 26 | 2004 |
| Reusing CSP propagators for QCSPs M Benedetti, A Lallouet, J Vautard Recent Advances in Constraints: 11th Annual ERCIM International Workshop on …, 2007 | 23 | 2007 |
| Modeling adversary scheduling with QCSP+ M Benedetti, A Lallouet, J Vautard Proceedings of the 2008 ACM symposium on Applied computing, 151-155, 2008 | 22 | 2008 |
| Reasoning on Company Takeovers during the COVID-19 Crisis with Knowledge Graphs L Bellomarini, M Benedetti, S Ceri, A Gentili, R Laurendi, D Magnanimi, ... | 18 | 2020 |
| Experience and perspectives in qbf-based formal verification M Benedetti, H Mangassarian Journal on Satisfiability, Boolean Modeling and Computation (JSAT) 5, 133-191, 2008 | 15 | 2008 |
| On the use of Max-SAT and PDDL in RBAC maintenance M Benedetti, M Mori Cybersecurity 2, 1-25, 2019 | 11 | 2019 |
| Parametric RBAC maintenance via Max-SAT M Benedetti, M Mori Proceedings of the 23nd ACM on Symposium on Access Control Models and …, 2018 | 11 | 2018 |
| NuSMV: a new symbolic model checker R Cavada, A Cimatti, M Benedetti, E Olivetti, M Pistore, M Roveri, ... | 10 | 2002 |
Hratch MangassarianGoogleПодтвержден адрес электронной почты в домене google.com
