{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:57:47Z","timestamp":1740095867124,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746201"},{"type":"electronic","value":"9783540746218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74621-8_3","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T11:46:32Z","timestamp":1187783192000},"page":"47-71","source":"Crossref","is-referenced-by-count":10,"title":["Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions"],"prefix":"10.1007","author":[{"given":"Viorica","family":"Sofronie-Stokkermans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"65","volume-title":"FroCos 2005","author":"A. Armando","year":"2005","unstructured":"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.\u00a03717, pp. 65\u201380. Springer, Heidelberg (2005)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/S0890-5401(03)00020-8","volume":"183","author":"A. Armando","year":"2003","unstructured":"Armando, A., Ranise, S., Rusinowitch, M.: A rewriting approach to satisfiability procedures. Information and Computation\u00a0183(2), 140\u2013164 (2003)","journal-title":"Information and Computation"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1006\/inco.2001.3118","volume":"178","author":"F. Baader","year":"2002","unstructured":"Baader, F., Tinelli, C.: Deciding the word problem in the union of equational theories sharing constructors. Information and Computation\u00a0178(2), 346\u2013390 (2002)","journal-title":"Information and Computation"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/363647.363681","volume":"48","author":"D. Basin","year":"2001","unstructured":"Basin, D., Ganzinger, H.: Automated complexity analysis based on ordered resolution. Journal of the ACM\u00a048(1), 70\u2013109 (2001)","journal-title":"Journal of the ACM"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1109\/LICS.1996.561462","volume-title":"Proc. 11th IEEE Symposium on Logic in Computer Science (LICS 1996)","author":"D.A. Basin","year":"1996","unstructured":"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\u2013465. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/11609773_28","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A.R. Bradley","year":"2005","unstructured":"Bradley, A.R., Manna, Z., Sipma, H.B.: What\u2019s decidable about arrays? In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol.\u00a03855, pp. 427\u2013442. Springer, Heidelberg (2005)"},{"key":"3_CR7","volume-title":"Mathematical Research","author":"P. Burmeister","year":"1986","unstructured":"Burmeister, P.: A Model Theoretic Oriented Approach to Partial Algebras: Introduction to Theory and Application of Partial Algebras, Part I. In: Mathematical Research, vol.\u00a031, Akademie-Verlag, Berlin (1986)"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1002\/malq.19950410204","volume":"41","author":"S. Burris","year":"1995","unstructured":"Burris, S.: Polynomial time uniform word problems. Mathematical Logic Quarterly\u00a041, 173\u2013182 (1995)","journal-title":"Mathematical Logic Quarterly"},{"issue":"3","key":"3_CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.2307\/2963593","volume":"22","author":"W. Craig","year":"1957","unstructured":"Craig, W.: Linear reasoning. A new form of the Herbrand-Gentzen theorem. J. Symb. Log.\u00a022(3), 250\u2013268 (1957)","journal-title":"A new form of the Herbrand-Gentzen theorem. J. Symb. Log."},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/261320.261324","volume":"31","author":"A. Dolzmann","year":"1997","unstructured":"Dolzmann, A., Sturm, T.: Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin\u00a031(2), 2\u20139 (1997)","journal-title":"ACM SIGSAM Bulletin"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","volume":"1","author":"W.F. Dowling","year":"1984","unstructured":"Dowling, W.F., Gallier, J.H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programming\u00a01(3), 267\u2013284 (1984)","journal-title":"J. Logic Programming"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1112\/jlms\/s1-26.1.64","volume":"26","author":"T. Evans","year":"1951","unstructured":"Evans, T.: The word problem for abstract algebras. J. London Math. Soc.\u00a026, 64\u201371 (1951)","journal-title":"J. London Math. Soc."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/LICS.2001.932485","volume-title":"Proc. 16th IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"H. Ganzinger","year":"2001","unstructured":"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\u201392. IEEE Computer Society Press, Los Alamitos (2001)"},{"issue":"10","key":"3_CR14","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1016\/j.ic.2005.10.002","volume":"204","author":"H. Ganzinger","year":"2006","unstructured":"Ganzinger, H., Sofronie-Stokkermans, V., Waldmann, U.: Modular proof systems for partial functions with Evans equality. Information and Computation\u00a0204(10), 1453\u20131492 (2006)","journal-title":"Information and Computation"},{"issue":"3-4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10817-004-6241-5","volume":"33","author":"S. Ghilardi","year":"2004","unstructured":"Ghilardi, S.: Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning\u00a033(3-4), 221\u2013249 (2004)","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-540-73595-3_25"},{"key":"3_CR17","first-page":"403","volume-title":"Principles of Knowledge Representation and reasoning","author":"R. Givan","year":"1992","unstructured":"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\u2013412. Morgan Kaufmann Press, San Francisco (1992)"},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1145\/566385.566387","volume":"3","author":"R. Givan","year":"2002","unstructured":"Givan, R., McAllester, D.A.: Polynomial-time computation via local inference relations. ACM Transactions on Computational Logic\u00a03(4), 521\u2013541 (2002)","journal-title":"ACM Transactions on Computational Logic"},{"key":"3_CR19","unstructured":"Ihlemann, C., Jacobs, S., Sofronie-Stokkermans, V.: Locality and data structures. Work in progress (2007)"},{"issue":"8","key":"3_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.entcs.2006.11.038","volume":"174","author":"S. Jacobs","year":"2007","unstructured":"Jacobs, S., Sofronie-Stokkermans, V.: Applications of hierarchical reasoning in the verification of complex systems. Electronic Notes in Theoretical Computer Science\u00a0174(8), 39\u201354 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/151261.151265","volume":"40","author":"D. McAllester","year":"1993","unstructured":"McAllester, D.: Automatic recognition of tractability in inference relations. Journal of the ACM\u00a040(2), 284\u2013303 (1993)","journal-title":"Journal of the ACM"},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.tcs.2005.07.003","volume":"345","author":"K.L. McMillan","year":"2005","unstructured":"McMillan, K.L.: An interpolating theorem prover. Theoretical Computer Science\u00a0345(1), 101\u2013121 (2005)","journal-title":"Theoretical Computer Science"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/11513988_47","volume-title":"Computer Aided Verification","author":"S. McPeak","year":"2005","unstructured":"McPeak, S., Necula, G.C.: Data structure specifications via local equality axioms. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 476\u2013490. Springer, Heidelberg (2005)"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems (1979)","DOI":"10.1145\/357073.357079"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69738-1_25","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Rybalchenko","year":"2007","unstructured":"Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint solving for interpolation. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, Springer, Heidelberg (2007)"},{"key":"3_CR26","unstructured":"Skolem, T.: Logisch-kombinatorische Untersuchungen \u00fcber die Erf\u00fcllbarkeit und Beweisbarkeit mathematischen S\u00e4tze nebst einem Theoreme \u00fcber dichte Mengen. Skrifter utgit av Videnskabsselskapet i Kristiania, I. Matematisk-naturvidenskabelig klasse. vol. 4, pp. 1\u201336 (1920)"},{"key":"3_CR27","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/11532231_16","volume-title":"Automated Deduction \u2013 CADE-20","author":"V. Sofronie-Stokkermans","year":"2005","unstructured":"Sofronie-Stokkermans, V.: Hierarchic reasoning in local theory extensions. In: Nieuwenhuis, R. (ed.) Automated Deduction \u2013 CADE-20. LNCS (LNAI), vol.\u00a03632, pp. 219\u2013234. Springer, Heidelberg (2005)"},{"key":"3_CR28","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11814771_21","volume-title":"Automated Reasoning","author":"V. Sofronie-Stokkermans","year":"2006","unstructured":"Sofronie-Stokkermans, V.: Interpolation in local theory extensions. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 235\u2013250. Springer, Heidelberg (2006)"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Sofronie-Stokkermans, V.: On combinations of local theory extensions (submitted for publication) (2006)","DOI":"10.1007\/11814771_21"},{"key":"3_CR30","volume-title":"Proceedings of ISMVL-2007","author":"V. Sofronie-Stokkermans","year":"2007","unstructured":"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"},{"issue":"1","key":"3_CR31","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(01)00332-2","volume":"290","author":"C. Tinelli","year":"2003","unstructured":"Tinelli, C., Ringeissen, C.: Unions of non-disjoint theories and combinations of satisfiability procedures. Theoretical Computer Science\u00a0290(1), 291\u2013353 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"3_CR32","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10817-005-5204-9","volume":"34","author":"C. Tinelli","year":"2005","unstructured":"Tinelli, C., Zarba, C.: Combining nonstably infinite theories. Journal of Automated Reasoning\u00a034(3), 209\u2013238 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"3_CR33","unstructured":"Ullman, J.: Principles of Database and Knowledge-Base Systems. Computer Science Press (1988)"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"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\u2013149 (1989)","DOI":"10.1145\/73721.73736"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74621-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T21:35:08Z","timestamp":1684013708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74621-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540746201","9783540746218"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74621-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}