Symbolic Model Construction for Saturated Constrained Horn Clauses - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Symbolic Model Construction for Saturated Constrained Horn Clauses

Abstract

Clause sets saturated by hierarchic ordered resolution do not offer a model representation that can be effectively queried, in general. They only offer the guarantee of the existence of a model. We present an effective symbolic model construction for saturated constrained Horn clauses. Constraints are in linear arithmetic, the first-order part is restricted to a function-free language. The model is constructed in finite time, and non-ground clauses can be effectively evaluated with respect to the model. Furthermore, we prove that our model construction produces the least model.
Fichier principal
Vignette du fichier
978-3-031-43369-6_8.pdf (396.27 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04313817 , version 1 (29-11-2023)

Licence

Identifiers

Cite

Martin Bromberger, Lorenz Leutgeb, Christoph Weidenbach. Symbolic Model Construction for Saturated Constrained Horn Clauses. Frontiers of Combining Systems - 14th International Symposium, FroCoS 2023, Sep 2023, Prague (CZ), Czech Republic. pp.137 - 155, ⟨10.1007/978-3-031-43369-6_8⟩. ⟨hal-04313817⟩
24 View
12 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More