Cesare Tinelli and Christophe Ringeissen. Unions of theories and com- binations of satisfiability procedures. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 1996. (in preparation).  Home/Search   Document Not in Database   Summary   Related Articles   Check

....presented in this paper suggests that we can tackle the problem of non disjoint combination from another angle. The Nelson Oppen combination method has been recently extended to the combination of theories with non disjoint signatures [11] and more work in this direction is currently under way [16]. Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [11, 16] may be used to extend our combination procedure to the case of equational theories sharing also non constant functors. However, any such extension appears to be ....

.... combination method has been recently extended to the combination of theories with non disjoint signatures [11] and more work in this direction is currently under way [16] Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [11, 16] may be used to extend our combination procedure to the case of equational theories sharing also non constant functors. However, any such extension appears to be non trivial and will probably impose more serious limitations on the type of equational theories that can be combined. ....

Cesare Tinelli and Christophe Ringeissen. Unions of theories and combinations of satisfiability procedures. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 1996. (in preparation).

....presented in this paper suggests that we can tackle the problem of non disjoint combination from another angle. The Nelson Oppen combination method has been recently extended to the combination of the ories with non disjoint signatures [11] and more work in this direction is currently under way [16]. Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [11, 16] may be used to extend our combination procedure to the case of equational theories sharing also non constant functors. However, any such extension appears to be ....

.... combination method has been recently extended to the combination of the ories with non disjoint signatures [11] and more work in this direction is currently under way [16] Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [11, 16] may be used to extend our combination procedure to the case of equational theories sharing also non constant functors. However, any such extension appears to be non trivial and will probably impose more serious limitations on the type of equational theories that can be combined. 18 ....

Cesare Tinelli and Christophe Ringeissen. Unions of theories and com- binations of satisfiability procedures. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 1996. (in preparation).

....presented in this paper suggests that we can tackle the problem of non disjoint combination from another angle. The Nelson Oppen combination method has been recently extended to the combination of theories with non disjoint signatures [12] and more work in this direction is currently under way [17]. Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [12, 17] may be used to extend our combination procedure to the case of equational theories sharing also nonconstant functors. However, any such extension appears to be non trivial ....

.... combination method has been recently extended to the combination of theories with non disjoint signatures [12] and more work in this direction is currently under way [17] Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [12, 17] may be used to extend our combination procedure to the case of equational theories sharing also nonconstant functors. However, any such extension appears to be non trivial and will probably impose more serious limitations on the type of equational theories that can be combined. ....

C. Tinelli and C. Ringeissen. Unions of theories and combinations of satisfiability procedures. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 1997. In preparation.

....on the classes of constraint domains and languages they can combine. Furthermore, essentially all of them require the component constraint languages to have pairwise disjoint signatures. 3 3 But see [Rin96] for a first attempt to lift this restriction. A more general approach is proposed in [TR97] A relatively general method has been proposed by Nelson and Oppen in [NO79] for combining decision procedures for the satifiability of quantifierfree formulas with respect to first order theories with equality. In this paper, we will show how the main idea of the Nelson Oppen method can be ....

....lift the restriction in Def. 2 that the theory be universal. With the new definition then every complete theory admitting an infinite model, for instance, becomes stably infinite. Since a proof of the correctness of such lifting is beyond the scope of this paper, we refer the interested reader to [TR97] where the claim is actually a mere consequence of more general combination results. There, one can also see that stable infiniteness is a sufficient but not a necessary condition for Theor. 1 to hold, which means that in principle the combination results above may apply even to some non ....

[Article contains additional citation context not shown here]

Cesare Tinelli and Christophe Ringeissen. Unions of theories and combinations of satisfiability procedures. Technical report, Department of Computer Science, University of Illinois, UrbanaChampaign, Illinois, 1997. (in preparation).

....presented in this paper suggests that we can tackle the problem of non disjoint combination from another angle. The Nelson Oppen combination method has been recently extended to the combination of theories with non disjoint signatures [12] and more work in this direction is currently under way [17]. Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [12, 17] may be used to extend our combination procedure to the case of equational theories sharing also nonconstant functors. However, any such extension appears to be non trivial ....

.... combination method has been recently extended to the combination of theories with non disjoint signatures [12] and more work in this direction is currently under way [17] Since our approach is very similar in spirit to Nelson and Oppen s, it is conceivable that some of the results from [12, 17] may be used to extend our combination procedure to the case of equational theories sharing also nonconstant functors. However, any such extension appears to be non trivial and will probably impose more serious limitations on the type of equational theories that can be combined. ....

C. Tinelli and C. Ringeissen. Unions of theories and combinations of satisfiability procedures. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign, 1997. In preparation.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC