Dominik Schreiber
YOU?
Author Swipe
View article: From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search
From Scalable SAT to MaxSAT: Massively Parallel Solution Improving Search Open
Maximum Satisfiability (MaxSAT) is an essential framework for combinatorial optimization at the core of automated reasoning. However, to date, no notable parallelizations with convincing scaling behaviour exist. We suggest to exploit and t…
View article: Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers
Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers Open
View article: On the dissertation “Scalable SAT Solving and its Application”
On the dissertation “Scalable SAT Solving and its Application” Open
The author’s dissertation, entitled “Scalable SAT Solving and its Application”, advances the efficient resolution of instances of the propositional satisfiability (SAT) problem, one of the prototypical “hard problems” of computer science w…
View article: MallobSat: Scalable SAT Solving by Clause Sharing
MallobSat: Scalable SAT Solving by Clause Sharing Open
SAT solving in large distributed environments has previously led to some famous results and to impressive speedups for selected inputs. However, in terms of general-purpose SAT solving, prior approaches still cannot make efficient use of a…
View article: Engineering Optimal Parallel Task Scheduling
Engineering Optimal Parallel Task Scheduling Open
The NP-hard scheduling problem P||C_max encompasses a set of tasks with known execution time which must be mapped to a set of identical machines such that the overall completion time is minimized. In this work, we improve existing techniqu…
View article: A Joint Approach Towards Data-Driven Virtual Testing for Automated Driving: The AVEAS Project
A Joint Approach Towards Data-Driven Virtual Testing for Automated Driving: The AVEAS Project Open
With growing complexity and responsibility of automated driving functions in road traffic and growing scope of their operational design domains, there is increasing demand for covering significant parts of development, validation, and veri…
View article: The 2023 International Planning Competition
The 2023 International Planning Competition Open
In this article, we present an overview of the 2023 International Planning Competition. It featured five distinct tracks designed to assess cutting‐edge methods and explore the frontiers of planning within these settings: the classical (de…
View article: Scalable SAT Solving and its Application | Experimental Data
Scalable SAT Solving and its Application | Experimental Data Open
Experimental data accompanying the doctoral thesis of Dominik P. Schreiber entitled "Scalable SAT Solving and its Application", Karlsruhe Institute of Technology, 2023. Upstream URL: https://github.com/domschrei/sssaia -- Funding notices: …
View article: Scalable SAT Solving and its Application | Experimental Data
Scalable SAT Solving and its Application | Experimental Data Open
Experimental data accompanying the doctoral thesis of Dominik P. Schreiber entitled "Scalable SAT Solving and its Application", Karlsruhe Institute of Technology, 2023.Upstream URL: https://github.com/domschrei/sssaia--Funding notices:This…
View article: Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers
Unsatisfiability Proofs for Distributed Clause-Sharing SAT Solvers Open
Distributed clause-sharing SAT solvers can solve problems up to one hundred times faster than sequential SAT solvers by sharing derived information among multiple sequential solvers working on the same problem. Unlike sequential solvers, h…
View article: Mallob: Scalable SAT Solving On Demand WithDecentralized Job Scheduling
Mallob: Scalable SAT Solving On Demand WithDecentralized Job Scheduling Open
Propositional satisfiability (SAT) is the problem of finding a variable assignment for a given propositional formula (i.e., a composition of Boolean variables using logical operators NOT, AND, OR) such that the formula evaluates to true, o…
View article: Decentralized Online Scheduling of Malleable NP-hard Jobs
Decentralized Online Scheduling of Malleable NP-hard Jobs Open
View article: PASAR — Planning as Satisfiability with Abstraction Refinement
PASAR — Planning as Satisfiability with Abstraction Refinement Open
One of the classical approaches to automated planning is the reduction to propositional satisfiability (SAT). Recently, it has been shown that incremental SAT solving can increase the capabilities of several modern encodings for SAT-based …
View article: Finding Optimal Longest Paths by Dynamic Programming in Parallel
Finding Optimal Longest Paths by Dynamic Programming in Parallel Open
We propose an exact algorithm for solving the longest path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than othe…
View article: Lilotane: A Lifted SAT-based Approach to Hierarchical Planning
Lilotane: A Lifted SAT-based Approach to Hierarchical Planning Open
One of the oldest and most popular approaches to automated planning is to encode the problem at hand into a propositional formula and use a Satisfiability (SAT) solver to find a solution. In all established SAT-based approaches for Hierarc…
View article: Scalable SAT Solving in the Cloud
Scalable SAT Solving in the Cloud Open
View article: PASAR Planning as Satisfiability with Abstraction Refinement
PASAR Planning as Satisfiability with Abstraction Refinement Open
One of the classical approaches to automated planning is the reduction to propositional satisfiability (SAT). Recently, it has been shown that incremental SAT solving can increase the capabilities of several modern encodings for SAT-based …
View article: Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning Open
International audience
View article: Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning
Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning Open
In this paper, we propose a novel SAT-based planning approach to solve totally ordered hierarchical planning problems. Our approach called “Tree-like Reduction Exploration” (Tree-REX) makes two contributions: (1) it allows to rapidly solve…
View article: Finding Optimal Longest Paths by Dynamic Programming in Parallel
Finding Optimal Longest Paths by Dynamic Programming in Parallel Open
We propose an exact algorithm for solving the longest simple path problem between two given vertices in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster th…
View article: Efficient SAT Encodings for Hierarchical Planning
Efficient SAT Encodings for Hierarchical Planning Open
Hierarchical Task Networks (HTN) are one of the most expressive representations for automated planning problems. On the other hand, in recent years, the performance of SAT solvers has been drastically improved. To take advantage of these a…
View article: 27: Algorithmen II, Vorlesung, WS 2018/19, 28.01.2019
27: Algorithmen II, Vorlesung, WS 2018/19, 28.01.2019 Open
28 | 0:00:00 Start 0:00:05 Einleitung 0:00:28 Dominik Schreiber - SAT Solving and Automated Planning 0:00:41 Overview 0:01:51 The SAT Problem 0:03:39 SAT Solving 0:05:06 Parallel SAT Solving 0:09:30 Automated Planning 0:13:20 SAT-based Pla…
View article: Hierarchical Task Network Planning Using SAT Techniques
Hierarchical Task Network Planning Using SAT Techniques Open