Articles with public access mandates - Moshe Y. VardiLearn more
Available somewhere: 90
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls.
S Chakraborty, KS Meel, MY Vardi
IJCAI, 3569-3576, 2016
Mandates: US National Science Foundation
Proving that programs eventually do something good
B Cook, A Gotsman, A Podelski, A Rybalchenko, MY Vardi
ACM SIGPLAN Notices 42 (1), 265-276, 2007
Mandates: German Research Foundation
Synthesis with rational environments
O Kupferman, G Perelli, MY Vardi
Annals of Mathematics and Artificial Intelligence 78 (1), 3-20, 2016
Mandates: US National Science Foundation, European Commission
Strategy logic with imperfect information
R Berthon, B Maubert, A Murano, S Rubin, MY Vardi
ACM Transactions on Computational Logic (TOCL) 22 (1), 1-51, 2021
Mandates: US National Science Foundation, European Commission
Iterative temporal planning in uncertain environments with partial satisfaction guarantees
M Lahijanian, MR Maly, D Fried, LE Kavraki, H Kress-Gazit, MY Vardi
IEEE Transactions on Robotics 32 (3), 583-599, 2016
Mandates: US National Science Foundation
Supervisory control and reactive synthesis: a comparative introduction
R Ehlers, S Lafortune, S Tripakis, MY Vardi
Discrete Event Dynamic Systems 27, 209-260, 2017
Mandates: US National Science Foundation, German Research Foundation
On computing minimal independent support and its applications to sampling and counting
A Ivrii, S Malik, KS Meel, MY Vardi
Constraints 21, 41-58, 2016
Mandates: US National Science Foundation
Counting-based reliability estimation for power-transmission grids
L Duenas-Osorio, K Meel, R Paredes, M Vardi
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
Mandates: US National Science Foundation
Approximate probabilistic inference via word-level counting
S Chakraborty, K Meel, R Mistry, M Vardi
Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016
Mandates: US National Science Foundation
SAT-based explicit LTLf satisfiability checking
J Li, G Pu, Y Zhang, MY Vardi, KY Rozier
Artificial Intelligence 289, 103369, 2020
Mandates: US National Science Foundation, US National Aeronautics and Space …
BDD-based Boolean functional synthesis
D Fried, LM Tabajara, MY Vardi
Computer Aided Verification: 28th International Conference, CAV 2016 …, 2016
Mandates: US National Science Foundation
A Symbolic Approach to Safety ltl Synthesis
S Zhu, LM Tabajara, J Li, G Pu, MY Vardi
Hardware and Software: Verification and Testing: 13th International Haifa …, 2017
Mandates: US National Science Foundation, National Natural Science Foundation of China
Hybrid compositional reasoning for reactive synthesis from finite-horizon specifications
S Bansal, Y Li, L Tabajara, M Vardi
Proceedings of the AAAI Conference on Artificial Intelligence 34 (06), 9766-9774, 2020
Mandates: US National Science Foundation, National Natural Science Foundation of China
Reasoning about strategies: on the satisfiability problem
F Mogavero, A Murano, G Perelli, MY Vardi
Logical Methods in Computer Science 13, 2017
Mandates: US National Science Foundation, European Commission
Reactive synthesis for finite tasks under resource constraints
K He, M Lahijanian, LE Kavraki, MY Vardi
2017 IEEE/RSJ International Conference on Intelligent Robots and Systems …, 2017
Mandates: US National Science Foundation, UK Engineering and Physical Sciences …
Efficient symbolic reactive synthesis for finite-horizon tasks
K He, AM Wells, LE Kavraki, MY Vardi
2019 International Conference on Robotics and Automation (ICRA), 8993-8999, 2019
Mandates: US National Science Foundation
ADDMC: weighted model counting with algebraic decision diagrams
J Dudek, V Phan, M Vardi
Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1468-1476, 2020
Mandates: US National Science Foundation
LTLf and LDLf synthesis under partial observability
G De Giacomo, V Moshe
Proceedings of the Twenty-Fifth International Joint Conference on Artificial …, 2016
Mandates: US National Science Foundation
LTLf Satisfiability Checking
J Li, L Zhang, G Pu, MY Vardi, J He
ECAI 2014, 513-518, 2014
Mandates: National Natural Science Foundation of China
Principled network reliability approximation: A counting-based approach
R Paredes, L Dueñas-Osorio, KS Meel, MY Vardi
Reliability Engineering & System Safety 191, 106472, 2019
Mandates: US National Science Foundation, US Department of Defense, National Research …
Publication and funding information is determined automatically by a computer program