On Combinations of Local Theory Extensions

  • Viorica Sofronie-Stokkermans
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7797)

Abstract

In this paper we study theory extensions in which efficient reasoning is possible. We study local extensions (in which hierarchical reasoning is possible) and give several examples from computer science or mathematics in which such extensions occur in a natural way. We then identify situations in which combinations of local extensions of a theory are again local extensions of that theory. We thus obtain criteria both for recognizing wider classes of local theory extensions, and for modular reasoning in combinations of theories over non-disjoint signatures.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BG96]
    Basin, D.A., Ganzinger, H.: Complexity analysis based on ordered resolution. In: Proc. 11th IEEE Symposium on Logic in Computer Science (LICS 1996), pp. 456–465. IEEE Computer Society Press (1996)Google Scholar
  2. [BG01]
    Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. Journal of the ACM 48(1), 70–109 (2001)MathSciNetCrossRefMATHGoogle Scholar
  3. [BG07]
    Baader, F., Ghilardi, S.: Connecting many-sorted theories. The Journal of Symbolic Logic 72(2), 535–583 (2007)MathSciNetCrossRefMATHGoogle Scholar
  4. [Bur86]
    Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application of Partial Algebras, Part I. Mathematical Research, vol. 31. Akademie-Verlag, Berlin (1986)MATHGoogle Scholar
  5. [Bur95]
    Burris, S.: Polynomial time uniform word problems. Mathematical Logic Quarterly 41, 173–182 (1995)MathSciNetCrossRefMATHGoogle Scholar
  6. [Gan01]
    Ganzinger, H.: Relating semantic and proof-theoretic concepts for polynomial time decidability of uniform word problems. In: Proc. 16th IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 81–92. IEEE Computer Society Press (2001)Google Scholar
  7. [Ghi04]
    Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-4), 221–249 (2004)MathSciNetCrossRefMATHGoogle Scholar
  8. [GM92]
    Givan, R., McAllester, D.: New results on local inference relations. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Third International Conference (KR 1992), pp. 403–412. Morgan Kaufmann Press (1992)Google Scholar
  9. [GSS01]
    Ganzinger, H., Sofronie-Stokkermans, V.: Combining local equational Horn theories. Unpublished manuscript (2001)Google Scholar
  10. [GSSW04]
    Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular Proof Systems for Partial Functions with Weak Equality. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol. 3097, pp. 168–182. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. [GSSW06]
    Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular proof systems for partial functions with Evans equality. Information and Computation 204(10), 1453–1492 (2006)MathSciNetCrossRefMATHGoogle Scholar
  12. [McA93]
    McAllester, D.: Automatic recognition of tractability in inference relations. Journal of the Association for Computing Machinery 40(2), 284–303 (1993)MathSciNetCrossRefMATHGoogle Scholar
  13. [NO79]
    Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (1979)Google Scholar
  14. [SS05]
    Sofronie-Stokkermans, V.: Hierarchic Reasoning in Local Theory Extensions. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 219–234. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  15. [SS06a]
    Sofronie-Stokkermans, V.: Interpolation in Local Theory Extensions. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 235–250. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  16. [SS06b]
    Sofronie-Stokkermans, V.: Local reasoning in verification. In: Autexier, S., Mantel, H. (eds.) IJCAR 2006 Workshop: VERIFY 2006: Verification Workshop. IJCAR 2006 Workshop Proceedings, pp. 128–145, Seattle, USA (2006)Google Scholar
  17. [SSI07a]
    Sofronie-Stokkermans, V., Ihlemann, C.: Automated reasoning in some local extensions of ordered structures. In: Proceedings of ISMVL 2007, paper 1. IEEE Computer Society (2007)Google Scholar
  18. [SSI07b]
    Sofronie-Stokkermans, V., Ihlemann, C.: Automated reasoning in some local extensions of ordered structures. Journal of Multiple-Valued Logics and Soft Computing 13(4–6), 397–414 (2007)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Viorica Sofronie-Stokkermans
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations