Tomás Balyo

G. Michael Youngblood

Filip Dvorák

CoRR, 2024

Learning Planning Action Models from State Traces.

[BibT_eX]

[DOI]

G. Michael Youngblood

CoRR, 2024

Cloud Kitchen: Using Planning-based Composite AI to Optimize Food Delivery Process.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Construction of Decision Diagrams for Product Configuration.

[BibT_eX]

[DOI]

Proceedings of the 25th International Workshop on Configuration (ConfWS 2023), 2023

Decision Heuristics in a Constraint-based Product Configurator.

[BibT_eX]

[DOI]

Proceedings of the 25th International Workshop on Configuration (ConfWS 2023), 2023

2022

Explainable AI for Constraint-Based Expert Systems.

[BibT_eX]

[DOI]

Jan Bode

Max Schemmer

Proceedings of the WI for Grand Challenges, 2022

Black-box optimization in a configuration system.

[BibT_eX]

[DOI]

Maximilian Kucher

Noemi Christensen

Proceedings of the SPLC '22: 26th ACM International Systems and Software Product Line Conference, Graz, Austria, September 12, 2022

2021

Parallelizing a SAT-Based Product Configurator.

[BibT_eX]

[DOI]

Nils Merlin Ullmann

Michael Klein

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Unit Propagation with Stable Watches (Short Paper).

[BibT_eX]

[DOI]

Markus Iser

Proceedings of the 27th International Conference on Principles and Practice of Constraint Programming, 2021

Fast Approximate Calculation of Valid Domains in a Satisfiability-based Product Configurator.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Configuration Workshop (CWS/ConfWS 2021), 2021

AI Assisted Design of Sokoban Puzzles Using Automated Planning.

[BibT_eX]

[DOI]

Nils Froleyks

Proceedings of the ArtsIT, Interactivity and Game Creation, 2021

2019

PASAR - Planning as Satisfiability with Abstraction Refinement.

[BibT_eX]

[DOI]

Nils Christian Froleyks

Dominik Schreiber

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Finding Optimal Longest Paths by Dynamic Programming in Parallel.

[BibT_eX]

[DOI]

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Memory Efficient Parallel SAT Solving with Inprocessing.

[BibT_eX]

[DOI]

Markus Iser

Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019

Using DimSpec for Bounded and Unbounded Software Model Checking.

[BibT_eX]

[DOI]

Marko Kleine Büning

Proceedings of the Formal Methods and Software Engineering, 2019

Efficient SAT Encodings for Hierarchical Planning.

[BibT_eX]

[DOI]

Proceedings of the 11th International Conference on Agents and Artificial Intelligence, 2019

Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018

Unbounded Software Model Checking with Incremental SAT-Solving.

[BibT_eX]

[DOI]

Marko Kleine Büning

CoRR, 2018

Using Algorithm Configuration Tools to Generate Hard SAT Benchmarks.

[BibT_eX]

[DOI]

Lukás Chrpa

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Parallel Satisfiability.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Parallel Constraint Reasoning., 2018

2017

Optimal Longest Paths by Dynamic Programming.

[BibT_eX]

[DOI]

Kai Fieger

Christian Schulz

CoRR, 2017

Using an Algorithm Portfolio to Solve Sokoban.

[BibT_eX]

[DOI]

Nils Christian Froleyks

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Accelerating SAT Based Planning with Incremental SAT Solving.

[BibT_eX]

[DOI]

Stephan Gocht

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

SAT Competition 2016: Recent Developments.

[BibT_eX]

[DOI]

Marijn J. H. Heule

Matti Järvisalo

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

SAT Race 2015.

[BibT_eX]

[DOI]

Artif. Intell., 2016

HordeQBF: A Modular and Massively Parallel QBF Solver.

[BibT_eX]

[DOI]

Florian Lonsing

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2015

No One SATPlan Encoding To Rule Them All.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

HordeSat: A Massively Parallel Portfolio SAT Solver.

[BibT_eX]

[DOI]

Peter Sanders

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

2014

On Different Strategies for Eliminating Redundant Actions from Plans.

[BibT_eX]

[DOI]

Lukás Chrpa

Asma Kilani

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2014, 2014

2013

Complexity issues related to propagation completeness.

[BibT_eX]

[DOI]

Artif. Intell., 2013

Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas.

[BibT_eX]

[DOI]

Martin Babka

Jaroslav Keznikl

Proceedings of the Software Engineering Research, 2013

Relaxing the Relaxed Exist-Step Parallel Planning Semantics.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Conference on Tools with Artificial Intelligence, 2013

2012

On Improving Plan Quality via Local Enhancements.

[BibT_eX]

[DOI]

Pavel Surynek

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

On hierarchies over the SLUR class.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2012

Shortening Plans by Local Re-planning.

[BibT_eX]

[DOI]