{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:33:53Z","timestamp":1743114833113,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243639"},{"type":"electronic","value":"9783642243646"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24364-6_4","type":"book-chapter","created":{"date-parts":[[2011,9,29]],"date-time":"2011-09-29T01:22:21Z","timestamp":1317259341000},"page":"40-54","source":"Crossref","is-referenced-by-count":2,"title":["Combining Theories: The Ackerman and Guarded Fragments"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Areces","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Fontaine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., N\u00e9meti, I., van Benthem, J.: Modal logics and bounded fragments of predicate logic. Journal of Philosophical Logic\u00a027(3), 217\u2013274 (1998)","journal-title":"Journal of Philosophical Logic"},{"key":"4_CR2","series-title":"Frontiers in Artificial Intelligence and Applications","first-page":"825","volume-title":"Handbook of Satisfiability","author":"C. Barrett","year":"2009","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol.\u00a0185, ch. 26, pp. 825\u2013885. IOS Press, Amsterdam (2009)"},{"key":"4_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"volume-title":"Handbook of Modal Logics","year":"2006","key":"4_CR4","unstructured":"Blackburn, P., Wolter, F., van Benthem, J. (eds.): Handbook of Modal Logics. Elsevier, Amsterdam (2006)"},{"key":"4_CR5","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"E. B\u00f6rger","year":"1997","unstructured":"B\u00f6rger, E., Gr\u00e4del, E., Gurevich, Y.: The Classical Decision Problem. Perspectives in Mathematical Logic. Springer, Berlin (1997)"},{"key":"4_CR6","volume-title":"The Decision Problem: Solvable Classes of Quantificational Formulas","author":"B. Dreben","year":"1979","unstructured":"Dreben, B., Goldfarb, W.D.: The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley, Reading (1979)"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-04222-5_16","volume-title":"Frontiers of Combining Systems","author":"P. Fontaine","year":"2009","unstructured":"Fontaine, P.: Combinations of theories for decidable fragments of first-order logic. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol.\u00a05749, pp. 263\u2013278. Springer, Heidelberg (2009)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Fontaine, P., Gribomont, E.P.: Combining non-stably infinite, non-first order theories. In: Ahrendt, W., Baumgartner, P., de Nivelle, H., Ranise, S., Tinelli, C. (eds.) Selected Papers from the Workshops on Disproving and the Second International Workshop on Pragmatics of Decision Procedures (PDPAR 2004). ENTCS, vol.\u00a0125, pp. 37\u201351 (2005)","DOI":"10.1016\/j.entcs.2004.06.066"},{"key":"4_CR9","first-page":"393","volume-title":"Current Trends in Theoretical Computer Science. Entering the 21st Century","author":"E. Gr\u00e4del","year":"2001","unstructured":"Gr\u00e4del, E.: Why are modal logics so robustly decidable? In: Current Trends in Theoretical Computer Science. Entering the 21st Century, pp. 393\u2013408. World Scientific, Singapore (2001)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0304-3975(01)00151-7","volume":"288","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E.: Guarded fixed point logics and the monadic theory of countable trees. Theoretical Computer Science\u00a0288(1), 129\u2013152 (2002)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","first-page":"45","volume-title":"Logic In Computer Science (LICS)","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Walukiewicz, I.: Guarded fixed point logic. In: Logic In Computer Science (LICS), pp. 45\u201354. IEEE Computer Society Press, Washington, USA (1999)"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E. Gr\u00e4del","year":"1998","unstructured":"Gr\u00e4del, E.: On the restraining power of guards. Journal of Symbolic Logic\u00a064, 1719\u20131742 (1998)","journal-title":"Journal of Symbolic Logic"},{"key":"4_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48660-7_3","volume-title":"Automated Deduction - CADE-16","author":"E. Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E.: Decision procedures for guarded logics. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 31\u201351. Springer, Heidelberg (1999)"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1015178417181","volume":"70","author":"I.M. Hodkinson","year":"2002","unstructured":"Hodkinson, I.M.: Loosely guarded fragment of first-order logic has the finite model property. Studia Logica\u00a070(2), 205\u2013240 (2002)","journal-title":"Studia Logica"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1011207512025","volume":"10","author":"M. Marx","year":"2001","unstructured":"Marx, M.: Tolerance logic. Journal of Logic, Language and Information\u00a010(3), 353\u2013374 (2001)","journal-title":"Journal of Logic, Language and Information"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1145\/357073.357079","volume":"1","author":"G. Nelson","year":"1979","unstructured":"Nelson, G., Oppen, D.C.: Simplifications by cooperating decision procedures. ACM Transactions on Programming Languages and Systems\u00a01(2), 245\u2013257 (1979)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-94-009-0349-4_5","volume-title":"Frontiers of Combining Systems (FroCoS)","author":"C. Tinelli","year":"1996","unstructured":"Tinelli, C., Harandi, M.T.: A new correctness proof of the Nelson\u2013Oppen combination procedure. In: Baader, F., Schulz, K.U. (eds.) Frontiers of Combining Systems (FroCoS), pp. 103\u2013120. Kluwer, Dordrecht (1996)"},{"issue":"1","key":"4_CR18","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":"4_CR19","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.G.: Combining non-stably infinite theories. Journal of Automated Reasoning\u00a034(3), 209\u2013238 (2005)","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR20","unstructured":"van Benthem, J.: Dynamic bits and pieces. Technical Report LP-1997-01, ILLC, University of Amsterdam (January 1997)"},{"key":"4_CR21","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1090\/dimacs\/031\/05","volume-title":"Why is modal logic so robustly decidable?","author":"M. Vardi","year":"1997","unstructured":"Vardi, M.: Why is modal logic so robustly decidable? DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a031, pp. 149\u2013184. AMS, Providence (1997)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-04222-5_23","volume-title":"Frontiers of Combining Systems","author":"T. Wies","year":"2009","unstructured":"Wies, T., Piskac, R., Kuncak, V.: Combining Theories with Shared Set Operations. In: Ghilardi, S., Sebastiani, R. (eds.) FroCoS 2009. LNCS, vol.\u00a05749, pp. 366\u2013382. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24364-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T04:35:07Z","timestamp":1554698107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24364-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243639","9783642243646"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24364-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}