An Efficient Subsumption Test Pipeline for BS(LRA) Clauses - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

An Efficient Subsumption Test Pipeline for BS(LRA) Clauses

Résumé

The importance of subsumption testing for redundancy elimination in first-order logic automatic reasoning is well-known. Although the problem is already NP-complete for first-order clauses, the meanwhile developed test pipelines efficiently decide subsumption in almost all practical cases. We consider subsumption between first-oder clauses of the Bernays-Schönfinkel fragment over linear real arithmetic constraints: BS(LRA). The bottleneck in this setup is deciding implication between the LRA constraints of two clauses. Our new sample point heuristic preempts expensive implication decisions in about 94% of all cases in benchmarks. Combined with filtering techniques for the first-order BS part of clauses, it results again in an efficient subsumption test pipeline for BS(LRA) clauses.
Fichier principal
Vignette du fichier
paper.pdf (487.67 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03881893 , version 1 (02-12-2022)

Identifiants

Citer

Martin Bromberger, Lorenz Leutgeb, Christoph Weidenbach. An Efficient Subsumption Test Pipeline for BS(LRA) Clauses. IJCAR 2022 - International Joint Conference in Automated Reasoning, Aug 2022, Haifa, Israel. pp.147-168, ⟨10.1007/978-3-031-10769-6_10⟩. ⟨hal-03881893⟩
8 Consultations
18 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More