hal-00642529, version 1
Combining theories: the Ackerman and Guarded Fragments
8th International Symposium Frontiers of Combining Systems - FroCoS 2011 6989 (2011) 40--54
Abstract: Combination of decision procedures is at the heart of Satisfiability Modulo Theories (SMT) solvers. It provides ways to compose decision procedures for expressive languages which mix symbols from various decidable theories. Typical combinations include (linear) arithmetic, uninterpreted symbols, arrays operators, etc. In a previous paper we showed that any first-order theory from the Bernays-Schönfinkel-Ramsey fragment, the two variable fragment, or the monadic fragment can be combined with virtually any other decidable theory. Here, we complete the picture by considering the Ackermann fragment, and several guarded fragments. All theories in these fragments can be combined with other decidable (combinations of) theories, with only minor restrictions. In particular, it is not required for these other theories to be stably-infinite.
- a – INRIA
- 1:
- CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- 2:
- Universidad Nacional de Córdoba
- 3:
- Université de Lorraine – CNRS : UMR7503 – INRIA
- 4:
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
- Domain : Computer Science/Logic in Computer Science
- hal-00642529, version 1
- http://hal.inria.fr/hal-00642529
- oai:hal.inria.fr:hal-00642529
- From:
- Submitted on: Friday, 18 November 2011 11:26:58
- Updated on: Wednesday, 23 November 2011 15:12:47





Associated documents
Export