eprintid: 1355
rev_number: 7
eprint_status: archive
userid: 40
dir: disk0/00/00/13/55
datestamp: 2012-09-18 12:20:53
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-18 12:20:53
type: book_section
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: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: 8th International Symposium, FroCoS 2011, Saarbrücken, Germany, October 5-7, 2011
abstract: Modularity is a highly desirable property in the development 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
series: Lecture Notes in Computer Science
number: 6989
publisher: Springer
pagerange: 211-226
id_number: 10.1007/978-3-642-24364-6_15
refereed: TRUE
isbn: 978-3-642-24363-9
book_title: Frontiers of Combining Systems :  Title     Frontiers of Combining Systems : Proceedings of the 8th International Symposium, FroCoS 2011
official_url: http://dx.doi.org/10.1007/978-3-642-24364-6_15
citation:   Ringeissen, Christophe and Senni, Valerio  Modular Termination and Combinability for Superposition Modulo Counter Arithmetic.   In:  Frontiers of Combining Systems : Title Frontiers of Combining Systems : Proceedings of the 8th International Symposium, FroCoS 2011.   Lecture Notes in Computer Science  (6989).  Springer, pp. 211-226.  ISBN 978-3-642-24363-9      (2011)