Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation

DOI10.1007/978-3-031-13188-2_26zbMATH Open1514.68134MaRDI QIDQ6487347

Daniel J. Fremont, Unnamed Author, Unnamed Author

Publication date: 7 December 2022

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Artificial intelligence for robotics (68T40)

Cites Work

• Unnamed Item
• Stochastic game logic
• A logic for reasoning about time and reliability
• Uniform generation of NP-witnesses using an NP-oracle
• Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
• A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints
• On Stochastic Games with Multiple Objectives
• Uniform Random Generation of Strings in a Context-Free Language
• High-Quality Synthesis Against Stochastic Environments
• Reactive control improvisation
• Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation

Related Items (2)

Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation ⋮ Rounding meets approximate model counting

This page was built for publication: Randomized Synthesis for Diversity and Cost Constraints with Control Improvisation