Automatic Program Rewriting in Non-Ground Answer Set ProgramsProceedings of the 21st International Symposium on Practical Aspects of Declarative Languages (PADL) (2019)
Answer set programming is a popular constraint programming paradigm that has seen wide use across various industry applications. However, logic programs under answer set semantics often require careful design and nontrivial expertise from a programmer to obtain satisfactory solving times. In order to reduce this burden on a software engineer we propose an automated rewriting technique for non-ground logic programs that we implement in a system Projector. We conduct rigorous experimental analysis, which shows that applying system Projector to a logic program can improve its performance, even after significant human-performed optimizations.
Publication DateJanuary, 2019
Citation InformationNicholas Hippen and Yuliya Lierler. "Automatic Program Rewriting in Non-Ground Answer Set Programs" Proceedings of the 21st International Symposium on Practical Aspects of Declarative Languages (PADL) (2019)
Available at: http://works.bepress.com/yuliya_lierler/82/