Automatic Decidability for Theories with Counting Operators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Automatic Decidability for Theories with Counting Operators

Abstract

The notion of schematic paramodulation has been introduced to reason on properties of (standard) paramodulation. We present a schematic paramodulation calculus modulo a fragment of arithmetics, namely the theory of Integer Offsets. This new schematic calculus is used to prove the decidability of the satisfiability problem for some theories equipped with counting operators. We illustrate our theoretical contribution on theories representing extensions of classical data structures, e.g., lists and records.
Fichier principal
Vignette du fichier
TushkanovaRGK-ADDCT13.pdf (108.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00920496 , version 1 (18-12-2013)

Identifiers

  • HAL Id : hal-00920496 , version 1

Cite

Elena Tushkanova, Christophe Ringeissen, Alain Giorgetti, Olga Kouchnarenko. Automatic Decidability for Theories with Counting Operators. Automated Deduction: Decidability, Complexity, Tractability (workshop ADDCT), Jun 2013, Lake Placid, United States. ⟨hal-00920496⟩
164 View
70 Download

Share

Gmail Facebook X LinkedIn More