eprintid: 1385
rev_number: 11
eprint_status: archive
userid: 40
dir: disk0/00/00/13/85
datestamp: 2012-09-26 14:49:47
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-26 14:49:47
type: conference_item
metadata_visibility: show
creators_name: Ringeissen, Christophe
creators_name: Senni, Valerio
creators_id: 
creators_id: valerio.senni@imtlucca.it
title: Modular Termination and Combinability for Superposition Modulo Counter Arithmetic
ispublished: submitted
subjects: QA75
divisions: CSA
full_text_status: none
pres_type: paper
abstract: Modularity is a highly desirable property in the develop-
ment of satisfiability procedures. In this paper we are interested in using a dedicated superposition calculus to develop satisfiability procedures for (unions of) theories sharing counter arithmetic. In the first place, we are concerned with the termination of this calculus for theories representing data structures and their extensions. To this purpose, we prove a modularity result for termination which allows us to use our superposition
calculus as a satisfiability procedure for combinations of data structures. In addition, we present a general combinability result that permits us to use our satisfiability procedures into a non-disjoint combination method à la Nelson-Oppen without loss of completeness. This latter result is useful whenever data structures are combined with theories for which superposition is not applicable, like theories of arithmetic.
date: 2011
date_type: published
pagerange: 1-16
event_title: FTP 2011 - International Workshop on First-Order Theorem Proving 
event_location: Bern, Switzerland
event_dates: July 4, 2011
event_type: workshop
refereed: TRUE
related_url_url: http://ftp11.csc.liv.ac.uk/programme.html
related_url_url: http://map.uniroma2.it/papers/RS_ftp_2011.pdf
related_url_type: org
related_url_type: author
citation:   Ringeissen, Christophe and Senni, Valerio  Modular Termination and Combinability for Superposition Modulo Counter Arithmetic.  In: FTP 2011 - International Workshop on First-Order Theorem Proving , July 4, 2011, Bern, Switzerland pp. 1-16.      (Submitted)   (2011)