Normalization and Rewriting for Answer Set Programming and Optimization

Jori Bomanson

Research output: ThesisDoctoral ThesisCollection of Articles


Answer-set programming (ASP) is an automated problem-solving paradigm specifically suitable for combinatorial search and optimization problems. Such problems can be solved both in theory and also increasingly in practice by ASP technology. The purpose of this dissertation is to contribute to ASP technology and particularly to the efficiency of ASP solving tools. In more detail, the contributions of this thesis focus on ASP optimization algorithms as well as ASP search algorithms based on so-called lazy-grounding. To these ends, several methods are proposed and shown theoretically and experimentally to have measurable performance increasing potential. The methods belong to two novel classes of ASP transformations: optimization rewritings, aimed at enhancing optimization performance, and firstorder lazy-normalizations aimed at extending the applicability of lazy-grounding in general. On the topic of transformations, this dissertation moreover presents novel systematic ways to test and verify the correctness of certain types of ASP transformations. These verification methods are distinct in the way they compare programs, which has been designed to reflect the behavior of standard ASP solvers to be as practically relevant as possible. Regarding practical optimization performance, the value of this work is substantial as evidenced by the excellent optimization performance of the proposed techniques in the highly competitive ASP Competition series. In particular, early versions of the techniques attained first place in the optimization track of the sixth edition of the series [56]. Moreover, the included work on lazy-grounding removed an obstacle previously preventing lazy-grounding from being applied to broad classes of programs that are central to the ASP paradigm.
Translated title of the contributionSääntöpohjaisten haku- ja optimointiohjelmien normalisointi ja uudelleenkirjoitus
Original languageEnglish
QualificationDoctor's degree
Awarding Institution
  • Aalto University
  • Niemelä, Ilkka, Supervising Professor
  • Gebser, Martin, Thesis Advisor
  • Janhunen, Tomi, Thesis Advisor
Print ISBNs978-952-64-0078-5
Electronic ISBNs978-952-64-0079-2
Publication statusPublished - 2020
MoE publication typeG5 Doctoral dissertation (article)


  • computational logic
  • logic programming


Dive into the research topics of 'Normalization and Rewriting for Answer Set Programming and Optimization'. Together they form a unique fingerprint.

Cite this