We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques. © Springer-Verlag Berlin Heidelberg 2005.

Nelson-Oppen, Shostak and the extended Canonizer: A family picture with a newborn / Ranise, S.; Ringeissen, C.; Tran, D. -K.. - 3407:(2005), pp. 372-386. (Intervento presentato al convegno First International Colloquium on Theoretical Aspects of Computing - ICTAC 2004 tenutosi a Guiyang, chn nel 2004) [10.1007/978-3-540-31862-0_27].

Nelson-Oppen, Shostak and the extended Canonizer: A family picture with a newborn

Ranise S.;
2005-01-01

Abstract

We consider the problem of building satisfiability procedures for unions of disjoint theories. We briefly review the combination schemas proposed by Nelson-Oppen, Shostak, and others. Three inference systems are directly derived from the properties satisfied by the theories being combined and known results from the literature are obtained in a uniform and abstract way. This rational reconstruction is the starting point for further investigations. We introduce the concept of extended canonizer and derive a modularity result for a new class of theories (larger than Shostak and smaller than Nelson-Oppen theories) which is closed under disjoint union. This is in contrast with the lack of modularity of Shostak theories. We also explain how to implement extended canonizers by using the basic building blocks used in Shostak schema or by means of rewriting techniques. © Springer-Verlag Berlin Heidelberg 2005.
2005
Lecture Notes in Computer Science
Germany
Springer Verlag
978-3-540-25304-4
978-3-540-31862-0
Ranise, S.; Ringeissen, C.; Tran, D. -K.
Nelson-Oppen, Shostak and the extended Canonizer: A family picture with a newborn / Ranise, S.; Ringeissen, C.; Tran, D. -K.. - 3407:(2005), pp. 372-386. (Intervento presentato al convegno First International Colloquium on Theoretical Aspects of Computing - ICTAC 2004 tenutosi a Guiyang, chn nel 2004) [10.1007/978-3-540-31862-0_27].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/333086
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? ND
social impact