A Complete Superposition Calculus for Primal Grammars - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2014

A Complete Superposition Calculus for Primal Grammars

Résumé

The superposition calculus (Bachmair and Ganzinger, J. Log Comput. 3(4), 217–247, 1994; Nieuwenhuis and Rubio 1994) is the state-of-the-art inference system used in saturation-based theorem proving for first-order logic with equality.We present an extension of this calculus that permits us to reason on formulae built on primal grammars (Hermann and Galbavý, Theor. Comput. Sci. 176(1–2), 111–158, 1997) a schematization language that has been devised to denote infinite sequences of structurally similar terms, defined by primitive recursion. We prove that the calculus is sound and refutationally complete.
Fichier non déposé

Dates et versions

hal-01083011 , version 1 (14-11-2014)

Identifiants

Citer

Hicham Bensaid, Nicolas Peltier. A Complete Superposition Calculus for Primal Grammars. Journal of Automated Reasoning, 2014, 53 (4), pp.317-350. ⟨10.1007/s10817-014-9309-x⟩. ⟨hal-01083011⟩
79 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More