Abstract
The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to be correct in the setting of unsorted first-order logic, some current implementations of it appear in tools that use a sorted input language. So far, however, there have been no theoretical results on the correctness of the method in a sorted setting, nor is it obvious that the method in fact lifts as is to logics with sorts. To bridge this gap between the existing theoretical results and the current implementations, we extend the Nelson-Oppen method to (order-)sorted logic and prove it correct under conditions similar to the original ones. From a theoretical point of view, the extension is relevant because it provides a rigorous foundation for the application of the method in a sorted setting. From a practical point of view, the extension has the considerable added benefits that in a sorted setting the method’s preconditions become easier to satisfy in practice, and the method’s nondeterminism is generally reduced.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Technical Report HPL-2–3-148, HP Laboratories, Palo Alto, CA (2003)
Ganesh, V., Berezin, S., Tinelli, C., Dill, D.: Combination results for many sorted theories with overlapping signatures. Technical report, Department of Computer Science, Stanford University (2004)
Ghilardi, S.: Quantifier elimination and provers integration. In: Dahn, I., Vigneron, L. (eds.) First Order Theorem Proving. Electronic Notes in Theoretical Computer Science, vol. 86.1, Elsevier, Amsterdam (2003)
Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning (2004) (to appear)
Goguen, J.A., Meseguer, J.: Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Theoretical Computer Science 105(2), 173–217 (1992)
Maric, F., Janičić, P.: ARGO-LIB: A generic platform for decision procedures. In: International Joint Conference on Automated Reasoning. LNCS, Springer, Heidelberg (2004)
Meseguer, J.: Membership algebra as a logical framework for equational specification. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol. 1376, pp. 18–61. Springer, Heidelberg (1998)
Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)
Stump, A., Barrett, C.W., Dill, D.L.: CVC: A cooperating validity checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 500–504. Springer, Heidelberg (2002)
Tinelli, C.: Cooperation of background reasoners in theory reasoning by residue sharing. Journal of Automated Reasoning 30(1), 1–31 (2003)
Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson-Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems. Applied Logic Series, vol. 3, pp. 103–120. Kluwer, Dordrecht (1996)
Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science 290(1), 291–353 (2003)
Tinelli, C., Zarba, C.G.: Combining decision procedures for sorted theories. Technical Report 04-01, The University of Iowa (2004)
Zarba, C.G.: C-tableaux. Technical Report RR-5229, INRIA (2004)
Zarba, C.G.: The Combination Problem in Automated Reasoning. PhD thesis, Stanford University (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tinelli, C., Zarba, C.G. (2004). Combining Decision Procedures for Sorted Theories. In: Alferes, J.J., Leite, J. (eds) Logics in Artificial Intelligence. JELIA 2004. Lecture Notes in Computer Science(), vol 3229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30227-8_53
Download citation
DOI: https://doi.org/10.1007/978-3-540-30227-8_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23242-1
Online ISBN: 978-3-540-30227-8
eBook Packages: Springer Book Archive