Symbolic Model Construction for Saturated Constrained Horn Clauses - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2023

Symbolic Model Construction for Saturated Constrained Horn Clauses

Résumé

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
2305.05064.pdf (336.22 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04315210 , version 1 (30-11-2023)

Licence

Paternité

Identifiants

Citer

Martin Bromberger, Lorenz Leutgeb, Christoph Weidenbach. Symbolic Model Construction for Saturated Constrained Horn Clauses. Max-Planck-Institut für Informatik, Saarbrücken, Germany. 2023. ⟨hal-04315210⟩
10 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More