OptiRica: Towards an Efficient Optimizing Horn Solver

November 22, 2022 ยท The Ethereal ยท ๐Ÿ› HCVS/VPT@ETAPS

๐Ÿ”ฎ THE ETHEREAL: The Ethereal
Pure theory โ€” exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hossein Hojjat, Philipp Rรผmmer arXiv ID 2211.12229 Category cs.LO: Logic in CS Cross-listed cs.SE Citations 0 Venue HCVS/VPT@ETAPS Last Checked 5 months ago
Abstract
This paper describes an ongoing effort to develop an optimizing version of the Eldarica Horn solver. The work starts from the observation that many kinds of optimization problems, and in particular the MaxSAT/SMT problem, can be seen as search problems on lattices. The paper presents a Scala library providing a domain-specific language (DSL) to uniformly model optimization problems of this kind, by defining, manipulating, and systematically exploring lattices with associated objective functions. The framework can be instantiated to obtain an optimizing Horn solver. As an illustration, the application of an optimizing solver for repairing software-defined networks is described.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Logic in CS