- Generalized Decision Focused Learning under Imprecise Uncertainty--Theoretical Study
2025/02/25 by Keivan Shariatmadar, Shariatmadar, Keivan, Neil Yorke‐Smith +9 · 1 citation
Decision Sciences · #68T37 90C70 49N30 #F.4 #FOS: Computer and information sciences #FOS: Mathematics #G.3 #Machine Learning (cs.LG) #Multi-Criteria Decision Making #Optimization and Control (math.OC) #Probabilistic and Robust Engineering Design #Probability (math.PR)
- Counting Reward Automata: Sample Efficient Reinforcement Learning Through the Exploitation of Reward Function Structure
2023/12/18 by Tristan Bester, Benjamin Rosman, Bester, Tristan +5 · 4 citations
Computer Science · #Artificial Intelligence (cs.AI) #F.4 #FOS: Computer and information sciences #Formal Methods in Verification #I.2 #Machine Learning and Algorithms #Software Engineering Research
- Satisfiability Checking of Multi-Variable TPTL with Unilateral Intervals Is PSPACE-Complete
2023/09/01 by Krishna, Shankara Narayanan, Madnani, Khushraj Nanik, Majumdar, Rupak +1 · 1 citation
#Computation and Language (cs.CL) #F.1.1 #F.4 #F.4.3 #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Logic in Computer Science (cs.LO)
- What's Decidable about Discrete Linear Dynamical Systems?
2022/06/22 by Toghrul Karimov, Edon Kelmendi, Karimov, Toghrul +5 · 1 citation
Computer Science · #Advanced Database Systems and Queries #Dynamical Systems (math.DS) #F.4 #FOS: Computer and information sciences #FOS: Mathematics #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge
- Topological Duality for Distributive Lattices: Theory and Applications
2022/03/07 by Mai Gehrke, Gehrke, Mai, Sam van Gool +1 · 1 voice
Computer Science · Mathematics · #03G10 #06-01 #06B35 #54-01 #68Q70 #F.3.2 #F.4 #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #cs.LO #math.LO
- On Collapsing Prefix Normal Words
2019/05/28 by Fleischmann, Pamela, Kulczynski, Mitja, Nowotka, Dirk · 1 citation
#Combinatorics (math.CO) #F.4 #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL)
- Finding All Solutions of Equations in Free Groups and Monoids with\n Involution
2014/05/20 by Volker Diekert, Artur Jeż, Diekert, Volker +3 · 1 citation
Computer Science · Mathematics · #Discrete Mathematics (cs.DM) #F.2 #F.2.2 #F.4 #FOS: Computer and information sciences #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems
- Open Graphs and Monoidal Theories
2010/11/18 by Dixon, Lucas, Kissinger, Aleks · 1 citation
#Category Theory (math.CT) #F.4 #FOS: Computer and information sciences #FOS: Mathematics #G.4 #Logic in Computer Science (cs.LO)
- Soft lambda-calculus: a language for polynomial time computation
2003/12/07 by Patrick Baillot, Virgile Mogbil, Baillot, Patrick +1 · 1 citation
Computer Science · #Computational Complexity (cs.CC) #F.4 #F.4.1 #F.4.2 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.CC #cs.LO
- The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
2001/03/26 by Volker Diekert, Diekert, Volker, Claudio Gutierrez +3 · 2 citations
Computer Science · #Data Structures and Algorithms (cs.DS) #F.2.2 #F.4 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.DS #cs.LO