Fri 20 Jan 2023 13:55 - 14:20 at Square - Logic Programming Chair(s): Marco Patrignani

Motivated by applications to open program reasoning such as maximal specification inference, this paper studies \emph{optimal CHC solving}, a problem to compute maximal and/or minimal solutions of constrained Horn clauses (CHCs). This problem and its subproblems have been studied in the literature, and a major approach is to iteratively improve a solution of CHCs until it becomes optimal. So a key ingredient of optimization methods is the optimality checking of a given solution.
We propose a novel optimality checking method, as well as an optimization method using the proposed optimality checker, based on a computational theoretical analysis of the optimality checking problem. The key observation is that the optimality checking problem is closely related to the termination analysis of programs, and this observation is useful both theoretically and practically. From a theoretical perspective, it clarifies a limitation of an existing method and incorrectness of another method in the literature. From a practical perspective, it allows us to apply techniques of termination analysis to the optimality checking of a solution of CHCs. We present an optimality checking method based on constraint-based synthesis of termination arguments, implemented our method, evaluated it on CHCs that encode maximal specification synthesis problems, and obtained promising results.

Fri 20 Jan

Displayed time zone: Eastern Time (US & Canada) change

13:30 - 14:45
Logic ProgrammingPOPL at Square
Chair(s): Marco Patrignani University of Trento
13:30
25m
Talk
Modular Primal-Dual Fixpoint Logic Solving for Temporal VerificationDistinguished Paper
POPL
Hiroshi Unno University of Tsukuba; RIKEN AIP, Tachio Terauchi Waseda University, Yu Gu University of Tsukuba, Eric Koskinen Stevens Institute of Technology
DOI
13:55
25m
Talk
Optimal CHC Solving via Termination Proofs
POPL
Yu Gu University of Tsukuba, Takeshi Tsukada Chiba University, Hiroshi Unno University of Tsukuba; RIKEN AIP
DOI
14:20
25m
Talk
From SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Selection Problems
POPL
Aaron Bembenek Harvard University, Michael Greenberg Stevens Institute of Technology, Stephen Chong Harvard University
DOI Pre-print