Roland H. C. Yap
Associate Professor
Works on constraint programming and automated reasoning, including anytime model counting and the modelling power of ad-hoc and tractable logical constraints, alongside security and social network analysis.
Roland H. C. Yap's lab at NUS works on reasoning & neuro-symbolic AI, trustworthy & safe ML and graph mining & networks. 15 papers since 2023, 5 at top venues, mostly AAAI and ECML-PKDD. Applications close .
At a glance
- papers, 2023–2026
- 4/ year
- at T1 venues
- 33%
- PhD students
- —
- MS students
- —
- alumni listed
- —
Papers by yearfrom DBLP, 2023–2026
- 1 papers2026 · T1 0 · collecting
- 8 papers2025 · T1 2
- 2 papers2024 · T1 1
- 4 papers2023 · T1 2
T1 venuesOtherVenues: AAAI, ECML-PKDD, ICSE, USENIX Security
Research focuspaper titles that use each topic's words
- Trustworthy & safe ML3 papers
- constraints3 papers
- Graph mining & networks2 papers
- tractable1 paper
- Reasoning & neuro-symbolic AI0 papers
Paper list
From DBLP.
20261 paper
20258 papers
- ECAIAI Fairness Beyond Complete Demographics: Current Achievements and Future Directions (opens in a new tab)
- AsiaCCSEvaluating Disassembly Errors With Only Binaries (opens in a new tab)
- ISMMFully Randomized Pointers (opens in a new tab)
- USENIX Security (T1)Fuzzing the PHP Interpreter via Dataflow Fusion (opens in a new tab)
- AAAI (T1)On the Modelling of Constraints with Tractable Logical Operators (opens in a new tab)
- CAVPanini: An Efficient and Flexible Knowledge Compiler (opens in a new tab)
- ECML-PKDDRedefining Fairness: A Multi-dimensional Perspective and Integrated Evaluation Framework (opens in a new tab)
- ASEZendDiff: Differential Testing of PHP Interpreter (opens in a new tab)
20242 papers
20234 papers
- SATA Comparison of SAT Encodings for Acyclicity of Directed Graphs (opens in a new tab)
- AAAI (T1)Fast Converging Anytime Model Counting (opens in a new tab)
- Ann. Math. Artif. Intell.Real-time passenger bus routing problems with preferences and tradeoffs (opens in a new tab)
- AAAI (T1)The Expressive Power of Ad-Hoc Constraints for Modelling CSPs (opens in a new tab)
Where alumni went
Alumni are not listed on the lab homepage.
Apply to NUSFall 2027
School of Computing PhD in Computer Science
- Round
- Main
- Opens
- —
- GRE
- See program page
- English
- See program page
- Fee
- See program page
Not yet confirmed for this intake.
Similar labsnearest by research summary
- CNZhejiang
Yin Zhang
- Generative & foundation models
- GBUCL
Thore Graepel
- Reinforcement learning
- CNZhejiang
Deng Cai
- Recommendation, search & web
- CNZhejiang
Yubo Tao
- Visualization & visual analytics
- USUCSD
Mikhail Belkin
- Learning theory & optimization
- CHEPFL
Lenka Zdeborová
- Learning theory & optimization
Your notes
Save this lab to keep notes.
Data
Some numbers could not be verified:
- The member list could not be found on the lab site.
- The alumni list could not be found on the lab site.
- Collected
- Verified
- Papers
- DBLP
- Members
- Not collected
- Alumni
- Not collected
Tiers are venue classifications, not lab rankings.
NUScloses