TL;DR
This paper shows how to encode linearly ordered attribute grammar scheduling as a SAT-problem by transforming the dependency graph to a chordal graph allowing the cycle freeness to be efficiently expressed and computed using SAT solvers.
Combinatorial search—finding solutions that meet constraints within an exponentially large space of candidates—underpins problems from hardware verification to scheduling and combinatorial design. The most successful approach in practice is Propositional Satisfiability (SAT) solving, but modelling a problem for a SAT s...
This book explains how algorithms work, for example, by exploiting the structure of the SAT problem with an appropriate logical calculus, like resolution, but also algorithms based on “physical” principles are considered.
Procedural knowledge and expertise in algorithm design are usually hidden in source code and reproduced for each new optimization problem. In this work, we deal with the important question of how to store and encode this expertise in a reusable way. This is done by so-called Generative Executable Algorithm Knowledge Gr...
This work introduces DueList, an abstraction-refinement approach geared towards list reasoning, which is implemented on top of off-the-shelf SMT solvers and extends reasoning facilities of existing solvers, allowing to conclude about the (un)satisfiability of a larger range of problems, while outperforming existing sol...
The ANVIL compiler architecture is proposed, where ANVIL performs exceptionally well on leading benchmarks by using language models purely where they are effective, rather than as a catch-all tool.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
