A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Discovering and Proving Invariants in Answer Set Programming and Planning
[article]
2019
arXiv
pre-print
Answer set programming (ASP) and planning are two widely used paradigms for solving logic programs with declarative programming. In both cases, the quality of the input programs has a major influence on the quality and performance of the solving or planning process. Hence, programmers need to understand how to make their programs efficient and still correct. In my PhD studies, I explore how input programs can be improved and verified automatically as a means to support programmers. One of my
arXiv:1905.03196v1
fatcat:3tc5jy4oxjdyxm2hyrlkbxbnje