On Combinations of Local Theory Extensions

1. 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. Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. Journal of the ACM 48(1), 70–109 (2001)

   Article  MathSciNet  MATH  Google Scholar 

3. Baader, F., Ghilardi, S.: Connecting many-sorted theories. The Journal of Symbolic Logic 72(2), 535–583 (2007)

   Article  MathSciNet  MATH  Google Scholar 

4. 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)

   MATH  Google Scholar 

5. Burris, S.: Polynomial time uniform word problems. Mathematical Logic Quarterly 41, 173–182 (1995)

   Article  MathSciNet  MATH  Google Scholar 

6. 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. Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-4), 221–249 (2004)

   Article  MathSciNet  MATH  Google Scholar 

8. 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. Ganzinger, H., Sofronie-Stokkermans, V.: Combining local equational Horn theories. Unpublished manuscript (2001)

   Google Scholar 

10. 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)

    Chapter  Google Scholar 

11. Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular proof systems for partial functions with Evans equality. Information and Computation 204(10), 1453–1492 (2006)

    Article  MathSciNet  MATH  Google Scholar 

12. McAllester, D.: Automatic recognition of tractability in inference relations. Journal of the Association for Computing Machinery 40(2), 284–303 (1993)

    Article  MathSciNet  MATH  Google Scholar 

13. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (1979)

    Google Scholar 

14. 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)

    Chapter  Google Scholar 

15. 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)

    Chapter  Google Scholar 

16. 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. 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. 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)

    MathSciNet  MATH  Google Scholar 

Download references