Author

A. Dijkstra

h-index 10 View on Semantic Scholar

We have 1 of 38 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Using SAT-Solving

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 eﬃciently expressed and computed using SAT solvers.

J. Bransen, L. T. van Binsbergen, Koen Claessen et al. · 0 citations