{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:10:19Z","timestamp":1726042219029},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030290061"},{"type":"electronic","value":"9783030290078"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29007-8_6","type":"book-chapter","created":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:10:06Z","timestamp":1566429006000},"page":"94-111","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Algebra of Modular Systems: Static and Dynamic Perspectives"],"prefix":"10.1007","author":[{"given":"Eugenia","family":"Ternovska","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,14]]},"reference":[{"key":"6_CR1","first-page":"127","volume":"74","author":"B J\u00f3nsson","year":"1952","unstructured":"J\u00f3nsson, B., Tarski, A.: Representation problems for relation algebras. Bull. Amer. Math. Soc. 74, 127\u2013162 (1952)","journal-title":"Bull. Amer. Math. Soc."},{"key":"6_CR2","unstructured":"Pratt, V.R.: Origins of the calculus of binary relations. In: Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS 1992), Santa Cruz, California, USA, 22\u201325 June 1992, pp. 248\u2013254 (1992)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Surinx, D., den Bussche, J.V., Gucht, D.V.: The primitivity of operators in the algebra of binary relations under conjunctions of containments. In: LICS 2017 (2017)","DOI":"10.1109\/LICS.2017.8005122"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.ins.2014.11.031","volume":"298","author":"G Fletcher","year":"2015","unstructured":"Fletcher, G., et al.: Relative expressive power of navigational querying on graphs. Inf. Sci. 298, 390\u2013406 (2015)","journal-title":"Inf. Sci."},{"issue":"7","key":"6_CR5","first-page":"1053","volume":"21","author":"M Jackson","year":"2011","unstructured":"Jackson, M., Stokes, T.: Modal restriction semigroups: towards an algebra of functions. IJAC 21(7), 1053\u20131095 (2011)","journal-title":"IJAC"},{"issue":"4","key":"6_CR6","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1093\/logcom\/exu081","volume":"27","author":"B McLean","year":"2017","unstructured":"McLean, B.: Complete representation by partial functions for composition, intersection and anti-domain. J. Log. Comput. 27(4), 1143\u20131156 (2017)","journal-title":"J. Log. Comput."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic (Foundations of Computing) (2000)","DOI":"10.7551\/mitpress\/2516.001.0001"},{"key":"6_CR8","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, 3\u20139 August 2013, pp. 854\u2013860 (2013)"},{"key":"6_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4074.001.0001","volume-title":"Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems","author":"R Reiter","year":"2001","unstructured":"Reiter, R.: Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, Cambridge (2001)"},{"issue":"1\u20133","key":"6_CR10","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"H Levesque","year":"1997","unstructured":"Levesque, H., Reiter, R., Lesp\u00e9rance, Y., Lin, F., Scherl, R.: GOLOG: a logic programming language for dynamic domains. J Log. Program. Spec. Issue Actions 31(1\u20133), 59\u201383 (1997)","journal-title":"J Log. Program. Spec. Issue Actions"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-24364-6_18","volume-title":"Frontiers of Combining Systems","author":"Shahab Tasharrofi","year":"2011","unstructured":"Tasharrofi, S., Ternovska, E.: A semantic account for modularity in multi-language modelling of search problems. In: Proceedings of the 8th International Symposium on Frontiers of Combining Systems (FroCoS), October 2011, pp. 259\u2013274 (2011)"},{"key":"6_CR12","unstructured":"Tasharrofi, S.: Arithmetic and modularity in declarative languages for knowledge representation. Ph.D. dissertation, School of Computing Science, Simon Fraser University, December 2013"},{"key":"6_CR13","unstructured":"Ternovska, E.: An algebra of combined constraint solving. In: Global Conference on Artificial Intelligence, GCAI 2015, Tbilisi, Georgia, 16\u201319 October 2015, pp. 275\u2013295 (2015)"},{"key":"6_CR14","unstructured":"Ternovska, E.: Recent progress on the algebra of modular systems. In: Proceedings of the 11th Alberto Mendelzon International Workshop on Foundations of Data Management and the Web, Montevideo, Uruguay, 7\u20139 June 2017 (2017)"},{"key":"6_CR15","volume-title":"Cylindric Algebras Part I","author":"L Henkin","year":"1971","unstructured":"Henkin, L., Monk, J., Tarski, A.: Cylindric Algebras Part I. North-Holland, Amsterdam (1971)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/3-540-44802-0_2","volume-title":"Computer Science Logic","author":"J Bussche","year":"2001","unstructured":"Bussche, J.: Applications of Alfred Tarski\u2019s ideas in database theory. In: Fribourg, L. (ed.) CSL 2001. LNCS, vol. 2142, pp. 20\u201337. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-44802-0_2"},{"key":"6_CR17","unstructured":"Mitchell, D.G., Ternovska, E.: A framework for representing and solving NP search problems. In: Proceedings of AAAI 2005, pp. 430\u2013435 (2005)"},{"key":"6_CR18","unstructured":"Vardi, M.Y.: The complexity of relational query language. In: 14th ACM Symposium Theory of Computing, Springer Verlag (Heidelberg, FRG and NewYork NY, USA)-Verlag, 1982"},{"issue":"2","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1342991.1342998","volume":"9","author":"M Denecker","year":"2008","unstructured":"Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. ACM Trans. Comput. Log. (TOCL) 9(2), 1\u201352 (2008)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-16242-8_32","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Kolokolova","year":"2010","unstructured":"Kolokolova, A., Liu, Y., Mitchell, D., Ternovska, E.: On the complexity of model expansion. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 447\u2013458. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16242-8_32"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BFb0055501","volume-title":"Transactions and Change in Logic Databases","author":"E Ternovskaia","year":"1998","unstructured":"Ternovskaia, E.: Inductive definability and the situation calculus. In: Freitag, B., Decker, H., Kifer, M., Voronkov, A. (eds.) DYNAMICS 1997. LNCS, vol. 1472, pp. 227\u2013248. Springer, Heidelberg (1998). \n                      https:\/\/doi.org\/10.1007\/BFb0055501"},{"key":"6_CR22","unstructured":"Abu Zaid, F., Gr\u00e4del, E., Jaax, S.: Bisimulation safe fixed point logic. In: Invited and Contributed Papers from the Tenth Conference on Advances in Modal Logic 10. Advances in Modal Logic. Held in Groningen, The Netherlands, 5\u20138 August 2014, pp. 1\u201315 (2014)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Semantical considerations on Floyd-Hoare logic. In: 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25\u201327 October 1976, pp. 109\u2013121 (1976)","DOI":"10.1109\/SFCS.1976.27"},{"issue":"2","key":"6_CR24","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18(2), 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","volume":"31","author":"H Levesque","year":"1997","unstructured":"Levesque, H., Reiter, R., Lesp\u00e9rance, Y., Lin, F., Scherl, R.: GOLOG: a logic programming language for dynamic domains. J. Log. Program. 31, 59\u201384 (1997)","journal-title":"J. Log. Program."},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-23264-5_37","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"D Mitchell","year":"2015","unstructured":"Mitchell, D., Ternovska, E.: Clause-learning for modular systems. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds.) LPNMR 2015. LNCS (LNAI), vol. 9345, pp. 446\u2013452. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23264-5_37"},{"key":"6_CR27","unstructured":"Bogaerts, B., Ternovska, E., Mitchell, D.: Propagators and solvers for the algebra of modular systems. In: Logic for Programming, Artificial Intelligence and Reasoning (LPAR) (2017)"},{"key":"6_CR28","series-title":"Graduate Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Graduate Texts in Computer Science. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/978-1-4612-0539-5"}],"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-030-29007-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T23:12:33Z","timestamp":1566429153000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29007-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030290061","9783030290078"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29007-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FroCoS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Frontiers of Combining Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"frocos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.frocos2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}