Search Results for author:
Found 4 papers, 1 papers with code
Enforcing Temporal Constraints on Generative Agent Behavior with Reactive Synthesis
Our approach uses Temporal Stream Logic (TSL) to generate an automaton that enforces a temporal structure on an agent and leaves the details of each action for a moment in time to an LLM.
Succinct Explanations With Cascading Decision Trees
The decision tree is one of the most popular and classical machine learning models from the 1980s.
Grammar Filtering For Syntax-Guided Synthesis
By preprocessing SyGuS PBE problems with a neural network, we can use a data driven approach to reduce the size of the search space, then allow automated reasoning-based solvers to more quickly find a solution analytically.
Temporal Stream Logic: Synthesis beyond the Bools
On the other hand, however, synthesis from TSL is scalable, because it is independent of the complexity of the handled data.
Logic in Computer Science
