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)Full text not available from this repository.
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 40 not found.|
|Date Deposited:||26 Sep 2012 14:49|
|Last Modified:||07 Mar 2013 12:56|
Actions (login required)