Hierarchical and modular reasoning in complex theories: The case of local theory extensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4720 LNAI, Issue , 2007, Pages 47-71

  Sofronie Stokkermans, Viorica ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; LARGE SCALE SYSTEMS; VERIFICATION;

HIERARCHIC REASONING; VERIFICATION LITERATURE;

HIERARCHICAL SYSTEMS;

EID: 38049089787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74621-8_3     Document Type: Conference Paper

References (34)

1. Armando, A., Bonacina, M.P., Ranise, S.: On a rewriting approach to satisfiability procedures: extension, combination of theories and an experimental appraisal. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 65-80. Springer, Heidelberg (2005)
2. Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation 183(2), 140-164 (2003)
3. Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories sharing constructors. Information and Computation 178(2), 346-390 (2002)
4. Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. Journal of the ACM 48(1), 70-109 (2001)
5. Basin, D.A., Ganzinger, H.: Complexity analysis based on ordered resolution. In: Proc. 11th IEEE Symposium on Logic in Computer Science (LICS'96), pp. 456-465. IEEE Computer Society Press, Los Alamitos (1996)
6. Bradley, A.R., Manna, Z., Sipma, H.B.: What's decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 427-442. Springer, Heidelberg (2005)
7. Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application of Partial Algebras, Part I. In: Mathematical Research, vol. 31, Akademie-Verlag, Berlin (1986)
8. Burris, S.: Polynomial time uniform word problems. Mathematical Logic Quarterly 41, 173-182 (1995)
9. Craig, W.: Linear reasoning. A new form of the Herbrand-Gentzen theorem. J. Symb. Log. 22(3), 250-268 (1957)
10. Dolzmann, A., Sturm, T.: Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31(2), 2-9 (1997)
11. Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming 1(3), 267-284 (1984)
12. Evans, T.: The word problem for abstract algebras. J. London Math. Soc., 26, 64-71 (1951)
13. 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'01), pp. 81-92. IEEE Computer Society Press, Los Alamitos (2001)
14. Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular proof systems for partial functions with Evans equality. Information and Computation 204(10), 1453-1492 (2006)
15. Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning 33(3-4), 221-249 (2004)
16. Ghilardi, S., Nicolini, E., Ranise, S., Zucchelli, D.: Combination methods for satisfiability and model-checking of infinite-state systems. In: Pfenning, F. (ed.) CADE 2007, LNCS, vol. 4603, Springer, Heidelberg (2007)
17. Givan, R., McAllester, D.: New results on local inference relations. In: Principles of Knowledge Representation and reasoning. Proceedings of the Third International Conference (KR'92), pp. 403-412. Morgan Kaufmann Press, San Francisco (1992)
18. Givan, R., McAllester, D.A.: Polynomial-time computation via local inference relations. ACM Transactions on Computational Logic 3(4), 521-541 (2002)
19. Ihlemann, C., Jacobs, S., Sofronie-Stokkermans, V.: Locality and data structures. Work in progress (2007)
20. Jacobs, S., Sofronie-Stokkermans, V.: Applications of hierarchical reasoning in the verification of complex systems. Electronic Notes in Theoretical Computer Science 174(8), 39-54 (2007)
21. McAllester, D.: Automatic recognition of tractability in inference relations. Journal of the ACM 40(2), 284-303 (1993)
22. McMillan, K.L.: An interpolating theorem prover. Theoretical Computer Science 345(1), 101-121 (2005)
23. McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 476-490. Springer, Heidelberg (2005)
24. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (1979)
25. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint solving for interpolation. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, Springer, Heidelberg (2007)
26. Skolem, T.: Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit und Beweisbarkeit mathematischen Sätze nebst einem Theoreme über dichte Mengen. Skrifter utgit av Videnskabsselskapet i Kristiania, I. Matematisknaturvidenskabelig klasse. vol. 4, pp. 1-36 (1920)
27. Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) Automated Deduction - CADE-20. LNCS (LNAI), vol. 3632, pp. 219-234. Springer, Heidelberg (2005)
28. 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)
29. Sofronie-Stokkermans, V.: On combinations of local theory extensions (Submitted for publication) (2006)
30. Sofronie-Stokkermans, V., Ihlemann, C.: Automated reasoning in some local extensions of ordered structures. In: Proceedings of ISMVL-2007, IEEE Computer Society, Los Alamitos (2007), http://dx.doi.org/10.1109/ISMVL.2007.10
31. Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science 290(1), 291-353 (2003)
32. Tinelli, C., Zarba, C.: Combining nonstably infinite theories. Journal of Automated Reasoning 34(3), 209-238 (2005)
33. Ullman, J.: Principles of Database and Knowledge-Base Systems. Computer Science Press (1988)
34. Ullman, J.: Bottom-up beats top-down for datalog. In: Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems, pp. 140-149 (1989)