On the public citation graph

Probably Approximately Correct MDP Learning and Control With Temporal Logic Constraints

0 signed · 157 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/1-4020-8141-3_38openalex-snapshot
Controller Synthesis for Probabilistic Systems (Extended Abstract)
inferredcites →https://doi.org/10.1007/3-540-60692-0_70openalex-snapshot
Model checking of probabilistic and nondeterministic systems
inferredcites →https://doi.org/10.1007/978-3-642-16612-9_11openalex-snapshot
Statistical Model Checking: An Overview
inferredcites →https://doi.org/10.1007/s10703-012-0180-2openalex-snapshot
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives
inferredcites →https://doi.org/10.1017/cbo9780511977770openalex-snapshot
Probability, Random Processes, and Statistical Analysis
inferredcites →https://doi.org/10.1023/a:1017984413808openalex-snapshot
Near-Optimal Reinforcement Learning in Polynomial Time
inferredcites →https://doi.org/10.1090/crmm/023openalex-snapshot
Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems
inferredcites →https://doi.org/10.1109/cdc.2009.5400629openalex-snapshot
A probabilistic approach for control of a stochastic system from LTL specifications
inferredcites →https://doi.org/10.1109/cdc.2013.6760732openalex-snapshot
Adaptive planning in unknown environments using grammatical inference
inferredcites →https://doi.org/10.1109/icra.2012.6224963openalex-snapshot
Probabilistic control from time-bounded temporal logic specifications in dynamic environments
inferredcites →https://doi.org/10.1109/icra.2012.6225075openalex-snapshot
LTL robot motion control based on automata learning of environmental dynamics
inferredcites →https://doi.org/10.1109/iros.2013.6696434openalex-snapshot
Analyzing and revising high-level robot behaviors under actuator error
inferredcites →https://doi.org/10.1109/qest.2012.19openalex-snapshot
Statistical Model Checking for Markov Decision Processes
inferredcites →https://doi.org/10.1137/1.9781611973082.101openalex-snapshot
Faster and Dynamic Algorithms For Maximal End-Component Decomposition And Related Graph Problems In Probabilistic Verification
inferredcites →https://doi.org/10.1145/1102351.1102472openalex-snapshot
Bayesian sparse sampling for on-line reward optimization
inferredcites →https://doi.org/10.1145/1143844.1143955openalex-snapshot
PAC model-free reinforcement learning
inferredcites →https://doi.org/10.15607/rss.2012.viii.057openalex-snapshot
Optimal Control with Weighted Average Costs and Temporal Logic Specifications
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems
inferredcites →https://doi.org/10.48550/arxiv.1104.3348openalex-snapshot
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives
inferredcites →https://doi.org/10.5860/choice.41-2856openalex-snapshot
A primer on statistical distributions

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rob.21695openalex-snapshot
Experimental Evaluation and Formal Analysis of High‐Level Tasks with Dynamic Obstacle Anticipation on a Full‐Sized Autonomous Vehicle
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_27openalex-snapshot
Omega-Regular Objectives in Model-Free Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-25540-4_29openalex-snapshot
PAC Statistical Model Checking for Markov Decision Processes and Stochastic Games
inferred← citeshttps://doi.org/10.1007/978-3-030-28423-7_2openalex-snapshot
Reinforcement Learning and Formal Requirements
inferred← citeshttps://doi.org/10.1007/978-3-030-30942-8_38openalex-snapshot
$$L^*$$-Based Learning of Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-030-55754-6_6openalex-snapshot
Neural Simplex Architecture
inferred← citeshttps://doi.org/10.1007/978-3-030-57628-8_1openalex-snapshot
Deep Reinforcement Learning with Temporal Logics
inferred← citeshttps://doi.org/10.1007/978-3-030-57628-8_14openalex-snapshot
Probabilistic Guarantees for Safe Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_6openalex-snapshot
Faithful and Effective Reward Schemes for Model-Free Reinforcement Learning of Omega-Regular Objectives
inferred← citeshttps://doi.org/10.1007/978-3-030-63461-2_1openalex-snapshot
Formal Policy Synthesis for Continuous-State Systems via Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-84060-0_8openalex-snapshot
Active Finite Reward Automaton Inference and Reinforcement Learning Using Queries and Counterexamples
inferred← citeshttps://doi.org/10.1007/978-3-030-85172-9_13openalex-snapshot
Safe Learning for Near-Optimal Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-030-90870-6_8openalex-snapshot
Model-Free Reinforcement Learning for Lexicographic Omega-Regular Objectives
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_1openalex-snapshot
PAC Statistical Model Checking of Mean Payoff in Discrete- and Continuous-Time MDP
inferred← citeshttps://doi.org/10.1007/978-3-031-19849-6_20openalex-snapshot
Automata Learning Meets Shielding
inferred← citeshttps://doi.org/10.1007/978-3-031-19849-6_21openalex-snapshot
Safe Policy Improvement in Constrained Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-031-21203-1_5openalex-snapshot
On Normative Reinforcement Learning via Safe Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-22308-2_1openalex-snapshot
Specification-Guided Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_29openalex-snapshot
A Framework for Transforming Specifications in Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_21openalex-snapshot
Policy Synthesis and Reinforcement Learning for Discounted LTL
inferred← citeshttps://doi.org/10.1007/978-3-031-40837-3_8openalex-snapshot
Reinforcement Learning with Temporal-Logic-Based Causal Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-032-04190-6_17openalex-snapshot
Robot Mission Adaptation with Quantitative Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_11openalex-snapshot
What Are the Odds? Improving Statistical Model Checking of Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-032-08707-2_11openalex-snapshot
Towards Unified Probabilistic Verification and Validation of Vision-Based Autonomy
inferred← citeshttps://doi.org/10.1007/978-3-319-46508-1_7openalex-snapshot
Compositional Model-Based System Design and Other Foundations for Mastering Change
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_20openalex-snapshot
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_1openalex-snapshot
Robots at the Edge of the Cloud
inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_8openalex-snapshot
Safety-Constrained Reinforcement Learning for MDPs
inferred← citeshttps://doi.org/10.1007/s00165-021-00536-5openalex-snapshot
L∗-based learning of Markov decision processes (extended version)
inferred← citeshttps://doi.org/10.1007/s10514-022-10043-yopenalex-snapshot
Hierarchical planning with state abstractions for temporal task specifications
inferred← citeshttps://doi.org/10.1007/s10703-019-00333-0openalex-snapshot
Probabilistic black-box reachability checking (extended version)
inferred← citeshttps://doi.org/10.1007/s10703-024-00463-0openalex-snapshot
PAC statistical model checking of mean payoff in discrete- and continuous-time MDP
inferred← citeshttps://doi.org/10.1007/s10994-022-06143-6openalex-snapshot
Planning for potential: efficient safe reinforcement learning
inferred← citeshttps://doi.org/10.1007/s11768-026-00333-6openalex-snapshot
Active suspension control of autonomous vehicles on unknown roads using spatial side information online learning
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103949openalex-snapshot
Certified reinforcement learning with logic guidance
inferred← citeshttps://doi.org/10.1016/j.jai.2024.12.005openalex-snapshot
Reinforcement learning with soft temporal logic constraints using limit-deterministic generalized Büchi automaton
inferred← citeshttps://doi.org/10.1016/j.robot.2021.103866openalex-snapshot
Adaptive heterogeneous multi-robot collaboration from formal task specifications
inferred← citeshttps://doi.org/10.1016/j.robot.2022.104351openalex-snapshot
Reinforcement learning under temporal logic constraints as a sequence modeling problem
inferred← citeshttps://doi.org/10.1016/j.sysconle.2017.08.005openalex-snapshot
A topological obstruction in a control problem
inferred← citeshttps://doi.org/10.1109/acc.2016.7525022openalex-snapshot
Finite state abstraction and formal methods for traffic flow networks
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264271openalex-snapshot
Temporal task planning in wirelessly connected environments with unknown channel quality
inferred← citeshttps://doi.org/10.1109/cdc.2017.8264386openalex-snapshot
Interpretable apprenticeship learning with temporal logic specifications
inferred← citeshttps://doi.org/10.1109/cdc.2018.8618904openalex-snapshot
POMDP Model Learning for Human Robot Collaboration
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619134openalex-snapshot
Expedited Learning in MDPs with Side Information
inferred← citeshttps://doi.org/10.1109/cdc.2018.8619756openalex-snapshot
Satisfiability Bounds for co-regular Properties in Interval-valued Markov Chains
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9028919openalex-snapshot
Reinforcement Learning for Temporal Logic Control Synthesis with Probabilistic Satisfaction Guarantees
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029727openalex-snapshot
A Learning Framework for Versatile STL Controller Synthesis
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029959openalex-snapshot
Topological Approximate Dynamic Programming under Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9303982openalex-snapshot
Statistically Model Checking PCTL Specifications on Markov Decision Processes via Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/cdc42340.2020.9304190openalex-snapshot
Active Task-Inference-Guided Deep Inverse Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/cdc45484.2021.9683634openalex-snapshot
Model-Free Learning of Safe yet Effective Controllers
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383559openalex-snapshot
Model-Free Reinforcement Learning for Spatiotemporal Tasks Using Symbolic Automata
inferred← citeshttps://doi.org/10.1109/iccps54341.2022.00017openalex-snapshot
Statistical Verification of Cyber-Physical Systems using Surrogate Models and Conformal Inference
inferred← citeshttps://doi.org/10.1109/icra.2012.6225290openalex-snapshot
Temporal logic motion control using actor-critic methods
inferred← citeshttps://doi.org/10.1109/icra.2015.7139024openalex-snapshot
Pareto efficiency in synthesizing shared autonomy policies with temporal logic constraints
inferred← citeshttps://doi.org/10.1109/icra.2016.7487554openalex-snapshot
Optimal temporal logic planning in probabilistic semantic maps
inferred← citeshttps://doi.org/10.1109/icra.2017.7989271openalex-snapshot
Robust policy search with applications to safe vehicle navigation
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196796openalex-snapshot
Control Synthesis from Linear Temporal Logic Specifications using Model-Free Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/icra40945.2020.9197297openalex-snapshot
Deep Imitative Reinforcement Learning for Temporal Logic Robot Motion Planning with Noisy Semantic Observations
inferred← citeshttps://doi.org/10.1109/icra46639.2022.9812169openalex-snapshot
Generalizing to New Domains by Mapping Natural Language to Lifted LTL
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561819openalex-snapshot
Learning and Planning for Temporally Extended Tasks in Unknown Environments
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561903openalex-snapshot
Reinforcement Learning Based Temporal Logic Control with Maximum Probabilistic Satisfaction
inferred← citeshttps://doi.org/10.1109/icra48506.2021.9561989openalex-snapshot
Model-Free Reinforcement Learning for Stochastic Games with Linear Temporal Logic Objectives
inferred← citeshttps://doi.org/10.1109/icra57147.2024.10610942openalex-snapshot
Co-learning Planning and Control Policies Constrained by Differentiable Logic Specifications
inferred← citeshttps://doi.org/10.1109/iros.2015.7354078openalex-snapshot
Correct-by-synthesis reinforcement learning with temporal logic constraints
inferred← citeshttps://doi.org/10.1109/iros.2017.8206234openalex-snapshot
Reinforcement learning with temporal logic rewards
inferred← citeshttps://doi.org/10.1109/iros45743.2020.9341325openalex-snapshot
Encoding formulas as deep networks: Reinforcement learning for zero-shot execution of LTL formulas
inferred← citeshttps://doi.org/10.1109/lcsys.2022.3169982openalex-snapshot
Learning-Based Bounded Synthesis for Semi-MDPs With LTL Specifications
inferred← citeshttps://doi.org/10.1109/lra.2021.3101544openalex-snapshot
Modular Deep Reinforcement Learning for Continuous Motion Planning With Temporal Logic
inferred← citeshttps://doi.org/10.1109/mcs.2016.2643259openalex-snapshot
Formal Methods for Control of Traffic Flow: Automated Control Synthesis from Finite-State Transition Models
inferred← citeshttps://doi.org/10.1109/smc.2015.534openalex-snapshot
Assistive Planning in Complex, Dynamic Environments: A Probabilistic Approach
inferred← citeshttps://doi.org/10.1109/smc53654.2022.9945133openalex-snapshot
Adapted Metrics for Measuring Competency and Resilience for Autonomous Robot Systems in Discrete Time Markov Chains
inferred← citeshttps://doi.org/10.1109/tac.2016.2518639openalex-snapshot
Synthesis of Joint Control and Active Sensing Strategies Under Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1109/tac.2019.2922583openalex-snapshot
Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints
inferred← citeshttps://doi.org/10.1109/tac.2020.3006967openalex-snapshot
Learning-Based Probabilistic LTL Motion Planning With Environment and Motion Uncertainties
inferred← citeshttps://doi.org/10.1109/tac.2021.3115080openalex-snapshot
Probably Approximately Correct Learning in Adversarial Environments With Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/tac.2022.3153278openalex-snapshot
Expedited Online Learning With Spatial Side Information
inferred← citeshttps://doi.org/10.1109/tac.2024.3390848openalex-snapshot
Learning Optimal Strategies for Temporal Tasks in Stochastic Games
inferred← citeshttps://doi.org/10.1109/tac.2024.3484290openalex-snapshot
Sample-Efficient Reinforcement Learning With Temporal Logic Objectives: Leveraging the Task Specification to Guide Exploration
inferred← citeshttps://doi.org/10.1109/tase.2015.2499164openalex-snapshot
Synthesis of Shared Autonomy Policies With Temporal Logic Specifications
inferred← citeshttps://doi.org/10.1109/tcad.2020.3012251openalex-snapshot
PAC Model Checking of Black-Box Continuous-Time Dynamical Systems
inferred← citeshttps://doi.org/10.1145/2728606.2728640openalex-snapshot
Enforcing temporal logic specifications via reinforcement learning
inferred← citeshttps://doi.org/10.1145/3302509.3311053openalex-snapshot
Reduced variance deep reinforcement learning with temporal logic specifications
inferred← citeshttps://doi.org/10.1145/3635160openalex-snapshot
Statistical Verification using Surrogate Models and Conformal Inference and a Comparison with Risk-Aware Verification
inferred← citeshttps://doi.org/10.1145/3696112openalex-snapshot
Scaling Learning-based Policy Optimization for Temporal Logic Tasks by Controller Network Dropout
inferred← citeshttps://doi.org/10.1145/3744706openalex-snapshot
Specification-Guided Reinforcement Learning
inferred← citeshttps://doi.org/10.1146/annurev-control-060117-104838openalex-snapshot
Synthesis for Robots: Guarantees and Feedback for Robot Behavior
inferred← citeshttps://doi.org/10.1177/0278364915581505openalex-snapshot
Temporal logic motion control using actor–critic methods
inferred← citeshttps://doi.org/10.1177/0278364920959444openalex-snapshot
PAC-Bayes control: learning policies that provably generalize to novel environments
inferred← citeshttps://doi.org/10.1177/02783649221077714openalex-snapshot
Reactive task and motion planning for robust whole-body dynamic locomotion in constrained environments
inferred← citeshttps://doi.org/10.15607/rss.2017.xiii.005openalex-snapshot
Breaking the Human-Robot Deadlock: Surpassing Shared Control Performance Limits with Sparse Human-Robot Interaction
inferred← citeshttps://doi.org/10.15607/rss.2019.xv.059openalex-snapshot
Planning with State Abstractions for Non-Markovian Task Specifications
inferred← citeshttps://doi.org/10.15607/rss.2019.xv.064openalex-snapshot
Learning to Plan with Logical Automata
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11123openalex-snapshot
Bootstrapping with Models: Confidence Intervals for Off-Policy Evaluation
inferred← citeshttps://doi.org/10.1609/aaai.v32i1.11295openalex-snapshot
Norm Conflict Resolution in Stochastic Domains
inferred← citeshttps://doi.org/10.1609/aaai.v35i9.16935openalex-snapshot
DeepSynth: Automata Synthesis for Automatic Task Segmentation in Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21201openalex-snapshot
Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise
inferred← citeshttps://doi.org/10.1609/aaai.v37i9.26273openalex-snapshot
Computably Continuous Reinforcement-Learning Objectives Are PAC-Learnable
inferred← citeshttps://doi.org/10.1609/aaai.v38i19.30105openalex-snapshot
Omega-Regular Decision Processes
inferred← citeshttps://doi.org/10.1609/aaai.v38i19.30148openalex-snapshot
A PAC Learning Algorithm for LTL and Omega-Regular Objectives in MDPs
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6756openalex-snapshot
Joint Inference of Reward Machines and Policies for Reinforcement Learning
inferred← citeshttps://doi.org/10.1613/jair.1.14063openalex-snapshot
Symbolic Task Inference in Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1613/jair.1.14253openalex-snapshot
Robust Control for Dynamical Systems with Non-Gaussian Noise via Formal Abstractions
inferred← citeshttps://doi.org/10.23919/acc.2019.8815215openalex-snapshot
Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints
inferred← citeshttps://doi.org/10.23919/ccc52363.2021.9549746openalex-snapshot
Synthesis of Controllers for Co-Safe Linear Temporal Logic Specifications using Reinforcement Learning
inferred← citeshttps://doi.org/10.24963/ijcai.2017/597openalex-snapshot
Reduction Techniques for Model Checking and Learning in MDPs
inferred← citeshttps://doi.org/10.24963/ijcai.2019/557openalex-snapshot
Transfer of Temporal Logic Formulas in Reinforcement Learning
inferred← citeshttps://doi.org/10.24963/ijcai.2022/403openalex-snapshot
Reinforcement Learning with Option Machines
inferred← citeshttps://doi.org/10.24963/ijcai.2022/507openalex-snapshot
On the (In)Tractability of Reinforcement Learning for LTL Objectives
inferred← citeshttps://doi.org/10.32657/10356/174532openalex-snapshot
Towards human-level artificial intelligence agents
inferred← citeshttps://doi.org/10.3389/frobt.2021.689550openalex-snapshot
Compositional RL Agents That Follow Language Commands in Temporal Logic
inferred← citeshttps://doi.org/10.3389/frobt.2024.1444188openalex-snapshot
HPRS: hierarchical potential-based reward shaping from task specifications
inferred← citeshttps://doi.org/10.3390/electronics11223716openalex-snapshot
GR(1)-Guided Deep Reinforcement Learning for Multi-Task Motion Planning under a Stochastic Environment
inferred← citeshttps://doi.org/10.3390/en15072522openalex-snapshot
Appraising the Optimal Power Flow and Generation Capacity in Existing Power Grid Topology with Increase in Energy Demand
inferred← citeshttps://doi.org/10.48550/arxiv.1510.05880openalex-snapshot
Safety-Constrained Reinforcement Learning for MDPs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.07313openalex-snapshot
Safe Control under Uncertainty
inferred← citeshttps://doi.org/10.48550/arxiv.1706.00007openalex-snapshot
A Learning Based Optimal Human Robot Collaboration with Linear Temporal Logic Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1801.08099openalex-snapshot
Logically-Constrained Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1807.06096openalex-snapshot
Safe Reinforcement Learning via Probabilistic Shields
inferred← citeshttps://doi.org/10.48550/arxiv.1907.03146openalex-snapshot
A Review of Robot Learning for Manipulation: Challenges, Representations, and Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1909.04256openalex-snapshot
Transfer of Temporal Logic Formulas in Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.1909.11591openalex-snapshot
Modular Deep Reinforcement Learning with Temporal Logic Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.1911.12976openalex-snapshot
Learning and Planning for Time-Varying MDPs Using Maximum Likelihood Estimation
inferred← citeshttps://doi.org/10.48550/arxiv.2004.00279openalex-snapshot
Statistical Verification of Autonomous Systems using Surrogate Models and Conformal Inference
inferred← citeshttps://doi.org/10.48550/arxiv.2005.01319openalex-snapshot
Formal Policy Synthesis for Continuous-Space Systems via Reinforcement Learning
inferred← citeshttps://doi.org/10.48550/arxiv.2011.00632openalex-snapshot
Synthesis of Discounted-Reward Optimal Policies for Markov Decision Processes Under Linear Temporal Logic Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.2011.04950openalex-snapshot
Model-based Reinforcement Learning from Signal Temporal Logic Specifications
inferred← citeshttps://doi.org/10.48550/arxiv.2101.10284openalex-snapshot
Reinforcement Learning Based Temporal Logic Control with Soft Constraints Using Limit-deterministic Generalized Buchi Automata
inferred← citeshttps://doi.org/10.5463/thesis.390openalex-snapshot
Learning to Behave
inferred← citeshttps://doi.org/10.65109/qtwt7869openalex-snapshot
Multi-Agent Reinforcement Learning with Temporal Logic Specifications
inferred← citeshttps://doi.org/10.7287/peerj-cs.1094v0.1/reviews/1openalex-snapshot
Peer Review #1 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1094v0.1/reviews/2openalex-snapshot
Peer Review #2 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1094v0.1/reviews/3openalex-snapshot
Peer Review #3 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.1)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1094v0.2/reviews/1openalex-snapshot
Peer Review #1 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1094v0.2/reviews/2openalex-snapshot
Peer Review #2 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.2)"
inferred← citeshttps://doi.org/10.7287/peerj-cs.1094v0.2/reviews/3openalex-snapshot
Peer Review #3 of "A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition (v0.2)"
inferred← citeshttps://doi.org/10.7717/peerj-cs.1094openalex-snapshot
A learning-based synthesis approach of reward asynchronous probabilistic games against the linear temporal logic winning condition
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.