Mascle, Corto
- The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas
2019/07/11 by Mascle, Corto, Zimmermann, Martin · 4 citations
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
- From LTL to rLTL Monitoring: Improved Monitorability through Robust Semantics
2018/07/21 by Mascle, Corto, Neider, Daniel, Schwenger, Maximilian +3 · 1 citation
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
- Learning temporal formulas from examples is hard
2023/12/26 by Mascle, Corto, Fijalkow, Nathanaël, Lagarde, Guillaume · 2 citations
#Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO) #Machine Learning (cs.LG)
- Controlling a Random Population is EXPTIME-hard
2019/09/13 by Corto Mascle, Mahsa Shirmohammadi, Mascle, Corto +3 · 1 citation
Computer Science · Mathematics · #Reinforcement Learning in Robotics #Markov Chains and Monte Carlo Methods #Distributed systems and fault tolerance
- On Nonnegative Integer Matrices and Short Killing Words
2018/08/02 by Kiefer, Stefan, Mascle, Corto · 1 citation
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)