The paper discusses the challenges in bridging the gap between Prolog/CLP semantics and the SMT-LIB language used by CHC solvers. It presents a comprehensive approach to translate Prolog features, including functions, lists, and integer arithmetic, into SMT-LIB constructs.
The key highlights are:
The authors note that their translation does not fully capture all aspects of Prolog semantics, such as the missing occurs-check in unification. However, they argue that the finite-term semantics of SMT-LIB data-types is often the intended semantics of Prolog programs.
The goal of this work is to simplify the integration of CLP and CHC solving techniques, by providing a systematic way to translate Prolog programs to the common input language of CHC solvers, the SMT-LIB format.
Til et andet sprog
fra kildeindhold
arxiv.org
Vigtigste indsigter udtrukket fra
by Dane... kl. arxiv.org 04-24-2024
https://arxiv.org/pdf/2404.14924.pdfDybere Forespørgsler