Marcel Steinmetz

According to our database1, Marcel Steinmetz authored at least 53 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification: Technical Report.
CoRR, 2024

Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Towards Feasible Higher-Dimensional Potential Heuristics.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

On the Computational Complexity of Stackelberg Planning and Meta-Operator Verification.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Merge-and-Shrink Heuristics for SSPs with Prune Transformations.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

Safety Verification of Tree-Ensemble Policies via Predicate Abstraction.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
Analyzing neural network behavior through deep statistical model checking.
Int. J. Softw. Tools Technol. Transf., June, 2023

Cartesian Abstractions and Saturated Cost Partitioning in Probabilistic Planning.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Lifted Stackelberg Planning.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Conflict-driven learning in AI planning state-space search.
PhD thesis, 2022

Expressivity of Planning with Horn Description Logic Ontologies (Technical Report).
CoRR, 2022

Glyph-Based Visual Analysis of Q-Leaning Based Action Policy Ensembles on Racetrack.
Proceedings of the 26th International Conference Information Visualisation, 2022

Expressivity of Planning with Horn Description Logic Ontologies (Extended Abstract).
Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022), 2022

Neural Network Action Policy Verification via Predicate Abstraction.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Debugging a Policy: Automatic Action-Policy Testing in AI Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Pattern Selection Strategies for Pattern Databases in Probabilistic Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Classical Planning with Avoid Conditions.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Expressivity of Planning with Horn Description Logic Ontologies.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Supplementary Material to "Making DL-Lite Planning Practical".
Dataset, November, 2021

Supplementary Material to "Making DL-Lite Planning Practical".
Dataset, November, 2021

Making DL-Lite Planning Practical.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Why Do I Have to Take Over Control? Evaluating Safe Handovers with Advance Notice and Explanations in HAD.
Proceedings of the ICMI '21: International Conference on Multimodal Interaction, 2021

Making DL-Lite Planning Practical (Extended Abstract).
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

Pattern Databases for Goal-Probability Maximization in Probabilistic Planning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Faster Stackelberg Planning via Symbolic Search and Information Sharing.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison.
J. Artif. Intell. Res., 2020

Safe Handover in Mixed-Initiative Control for Cyber-Physical Systems.
CoRR, 2020

TraceVis: Towards Visualization for Deep Statistical Model Checking.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Tools and Trends, 2020

Towards Dynamic Dependable Systems Through Evidence-Based Continuous Certification.
Proceedings of the Leveraging Applications of Formal Methods, Verification and Validation: Engineering Principles, 2020

Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Deep Statistical Model Checking.
Proceedings of the Formal Techniques for Distributed Objects, Components, and Systems, 2020

Let's Learn Their Language? A Case for Planning with Automata-Network Languages from Model Checking.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

A New Approach to Plan-Space Explanation: Analyzing Plan-Property Dependencies in Oversubscription Planning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
The 2019 Comparison of Tools for the Analysis of Quantitative Formal Models - (QComp 2019 Competition Report).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2019

Towards automated network mitigation analysis.
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019

Bridging the Gap between Abstractions and Critical-Path Heuristics via Hypergraphs.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Formally Reasoning about the Cost and Efficacy of Securing the Email Infrastructure.
Proceedings of the 2018 IEEE European Symposium on Security and Privacy, 2018

On Stubborn Sets and Planning with Resources.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Simulated Penetration Testing as Contingent Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Compiling Probabilistic Model Checking into Probabilistic Planning.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Stackelberg Planning: Towards Effective Leader-Follower State Space Search.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Simulated Penetration Testing and Mitigation Analysis.
CoRR, 2017

State space search nogood learning: Online refinement of critical-path dead-end detectors in planning.
Artif. Intell., 2017

Search and Learn: On Dead-End Detectors, the Traps they Set, and Trap Learning.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Critical-Path Dead-End Detection versus NoGoods: Offline Equivalence and Online Learning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Beyond Red-Black Planning: Limited-Memory State Variables.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Goal Probability Analysis in Probabilistic Planning: Exploring and Enhancing the State of the Art.
J. Artif. Intell. Res., 2016

Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization.
J. Artif. Intell. Res., 2016

Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Revisiting Goal Probability Analysis in Probabilistic Planning.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

Towards Clause-Learning State Space Search: Learning to Recognize Dead-Ends.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016


  Loading...