Moshe Y. Vardi
22 papers · 2013–2025 · 2 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+11 more ↓ Show less ↑
π Academic Marathon (12) π Interdisciplinary Bridge π§ Keyword Pioneer π Conference Polyglot (2) π Cross-Pollinator (4)
π
Cross-Pollinator
(4)
π
Renaissance Researcher
(7)
πΊοΈ
Taxonomy Completionist
(34)
π§¬
Topic Evolution
π
Keyword Champion
ποΈ
Keyword Collector
(96)
π
Trend Setter
π
Century Club
(22)
β‘
Prolific Year
(6)
π₯
Unstoppable
(5)
π
Conference Pioneer
Conferences
IJCAI (14)
AAAI (8)
Top co-authors
Research topics
Keywords
linear temporal logic
(6)
automata theory
(4)
strategy synthesis
(3)
reactive synthesis
(3)
ltl synthesis
(2)
approximation algorithm
(2)
model checking
(2)
finite trace
(2)
model counting
(2)
game theory
(2)
combinatorial optimization
(2)
boolean formula
(2)
formal verification
(2)
transition system
(2)
graph neural network
(2)
knowledge compilation
(1)
approximate counting
(1)
formal methods
(1)
constraint satisfaction
(1)
dynamic programming
(1)
Papers
LTLf+ and PPLTL+: Extending LTLf and PPLTL to Infinite Traces
IJCAI 2025
LTLf Synthesis Under Unreliable Input
AAAI 2025
Solving Quantum-Inspired Perfect Matching Problems via Tutte-Theorem-Based Hybrid Boolean Constraints
IJCAI 2023
Multi-Agent Systems with Quantitative Satisficing Goals
IJCAI 2023
LTLf Synthesis as AND-OR Graph Search: Knowledge Compilation at Work
IJCAI 2022
DPSampler: Exact Weighted Sampling Using Dynamic Programming
IJCAI 2022
Constraint-Driven Explanations for Black-Box ML Models
AAAI 2022
Synthesis from Satisficing and Temporal Goals
AAAI 2022
Synthesizing Good-Enough Strategies for LTLf Specifications
IJCAI 2021
Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective
IJCAI 2020
LTLΖ Synthesis with Fairness and Stability Assumptions
AAAI 2020
Unbounded Orchestrations of Transducers for Manufacturing
AAAI 2019
SAT-Based Explicit LTLf Satisfiability Checking
AAAI 2019
Learning to Solve NP-Complete Problems: A Graph Neural Network for Decision TSP
AAAI 2019
On the Hardness of Probabilistic Inference Relaxations
AAAI 2019
Partitioning Techniques in LTLf Synthesis
IJCAI 2019
Not All FPRASs are Equal: Demystifying FPRASs for DNF-Counting (Extended Abstract)
IJCAI 2019
Symbolic LTLf Synthesis
IJCAI 2017
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas
IJCAI 2017
Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls
IJCAI 2016
From Weighted to Unweighted Model Counting
IJCAI 2015
Linear Temporal Logic and Linear Dynamic Logic on Finite Traces
IJCAI 2013