Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423663 | Electronic Notes in Theoretical Computer Science | 2008 | 13 Pages |
Abstract
Traditional methods for combining theory solvers rely on capabilities of the solvers to produce all implied equalities or a pre-processing step that introduces additional literals into the search space. This paper introduces a combination method that incrementally reconciles models maintained by each theory. We evaluate the practicality and efficiency of this approach.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics