Markus Iser
YOU?
Author Swipe
View article: Active Learning for SAT Solver Benchmarking
Active Learning for SAT Solver Benchmarking Open
Benchmarking is crucial for developing new algorithms. This also applies to solvers for the propositional satisfiability (SAT) problem. Benchmark selection is about choosing representative problem instances that reliably discriminate solve…
View article: Global Benchmark Database
Global Benchmark Database Open
This paper presents Global Benchmark Database (GBD), a comprehensive suite of tools for provisioning and sustainably maintaining benchmark instances and their metadata. The availability of benchmark metadata is essential for many tasks in …
View article: Oracle-Based Local Search for Pseudo-Boolean Optimization
Oracle-Based Local Search for Pseudo-Boolean Optimization Open
Significant advances have been recently made in the development of increasingly effective in-exact (or incomplete) search algorithms—particularly geared towards finding good though not provably optimal solutions fast—for the constraint opt…
View article: Active Learning for SAT Solver Benchmarking
Active Learning for SAT Solver Benchmarking Open
Benchmarking is a crucial phase when developing algorithms. This also applies to solvers for the SAT (propositional satisfiability) problem. Benchmark selection is about choosing representative problem instances that reliably discriminate …
View article: SATViz: Real-Time Visualization of Clausal Proofs
SATViz: Real-Time Visualization of Clausal Proofs Open
Visual layouts of graphs representing SAT instances can highlight the community structure of SAT instances. The community structure of SAT instances has been associated with both instance hardness and known clause quality heuristics. Our t…
View article: SAT Competition 2020
SAT Competition 2020 Open
The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provid…
View article: Fast approximate calculation of valid domains in a satisfiability-based product configurator
Fast approximate calculation of valid domains in a satisfiability-based product configurator Open
Calculating valid domains is an important feature of an interactive product configurator. Since it is an NP hard problem, it is necessary (for large real-world instances) to calculate valid domains only approximately in order to keep the r…
View article: Unit Propagation with Stable Watches (Short Paper)
Unit Propagation with Stable Watches (Short Paper) Open
Unit propagation is the hottest path in CDCL SAT solvers, therefore the related data-structures, algorithms and implementation details are well studied and highly optimized. State-of-the-art implementations are based on reduced occurrence …
View article: Collaborative Management of Benchmark Instances and their Attributes
Collaborative Management of Benchmark Instances and their Attributes Open
Experimental evaluation is an integral part in the design process of algorithms. Publicly available benchmark instances are widely used to evaluate methods in SAT solving. For the interpretation of results and the design of algorithm portf…
View article: Integrating Static Code Analysis Toolchains
Integrating Static Code Analysis Toolchains Open
This paper proposes an approach for a tool-agnostic and heterogeneous static\ncode analysis toolchain in combination with an exchange format. This approach\nenhances both traceability and comparability of analysis results. State of the\nar…
View article: A Problem Meta-Data Library for Research in SAT
A Problem Meta-Data Library for Research in SAT Open
Experimental data and benchmarks play a crucial role in developing new algorithms and implementations of SAT solvers. Besides comparing and evaluating solvers, they provide the basis for all kinds of experiments, for setting up hypothesis …