500 citations
- Massachusetts Institute of TechnologyUS120 papers
- University of California SystemUS118 papers
- California Institute of TechnologyUS117 papers
- Tsinghua UniversityCN115 papers
- University of ZurichCH115 papers
- Universität HamburgDE114 papers
- University of FloridaUS114 papers
- Tata Institute of Fundamental ResearchIN112 papers
- Universidad Autónoma de MadridES112 papers
- University of Minnesota SystemUS112 papers
- Cornell UniversityUS111 papers
- Peking UniversityCN111 papers
10 papers · 1 filter
Digital Avatars: Framework Development and Their Evaluation
Timothy Rupprecht, Sung-En Chang, Yushu Wu +9
We present a novel prompting strategy for artificial intelligence driven digital avatars. To better quantify how our prompting strategy affects anthropomorphic features like humor,…
A Reasoning Engine for the Gamification of Loop-Invariant Discovery
Andrew Walter, Seth Cooper, Panagiotis Manolios
We describe the design and implementation of a reasoning engine that facilitates the gamification of loop-invariant discovery. Our reasoning engine enables students, computational…
Procedural Content Generation using Behavior Trees (PCGBT)
Anurag Sarkar, Seth Cooper
Behavior trees (BTs) are a popular method for modeling NPC and enemy AI behavior and have been widely used in commercial games. In this work, rather than use BTs to model game play…
Solving QSAT problems with neural MCTS
Ruiyang Xu, Karl Lieberherr
Recent achievements from AlphaZero using self-play has shown remarkable performance on several board games. It is plausible to think that self-play, starting from zero knowledge, c…
First-Order Problem Solving through Neural MCTS based Reinforcement Learning
Ruiyang Xu, Prashank Kadam, Karl Lieberherr
The formal semantics of an interpreted first-order logic (FOL) statement can be given in Tarskian Semantics or a basically equivalent Game Semantics. The latter maps the statement…
Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers
Kaidi Xu, Huan Zhang, Shiqi Wang +4
Formal verification of neural networks (NNs) is a challenging and important problem. Existing efficient complete solvers typically require the branch-and-bound (BaB) process, which…