A Strict Constrained Superposition Calculus for Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

A Strict Constrained Superposition Calculus for Graphs

Résumé

Abstract We propose a superposition-based proof procedure to reason on equational first order formulas defined over graphs. First, we introduce the considered graphs that are directed labeled graphs with lists of roots standing for pins or interfaces for replacements. Then the syntax and semantics of the considered logic are defined. The formulas at hand are clause sets built on equations and disequations on graphs. Afterwards, a sound and complete proof procedure is provided, and redundancy criteria are introduced to dismiss useless clauses and improve the efficiency of the procedure. In a first step, a set of inferences rules is provided in the case of uninterpreted labels. In a second step, the proposed rules are lifted to take into account labels defined as terms interpreted in some arbitrary theory. Particular formulas of interest are Horn clauses, for which stronger redundancy criteria can be devised. Essential differences with the usual term superposition calculus are emphasized.

Dates et versions

hal-04297056 , version 1 (21-11-2023)

Identifiants

Citer

Rachid Echahed, Mnacho Echenim, Mehdi Mhalla, Nicolas Peltier. A Strict Constrained Superposition Calculus for Graphs. FOSSACS 2023: 26th International Conference on Foundations of Software Science and Computation Structures, Apr 2023, Paris, France. pp.135-155, ⟨10.1007/978-3-031-30829-1_7⟩. ⟨hal-04297056⟩
5 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More