Encoding Hard String Problems with Answer Set Programming
Published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) • Jan 1, 2023
Authors:
Köppl, Dominik
Abstract
Despite the simple, one-dimensional nature of strings, several computationally hard problems on strings are known. Tackling hard problems beyond sizes of toy instances with straight-forward solutions is infeasible. To solve these problems on datasets of even small sizes, effort has to be put into th...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!