{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:10:42Z","timestamp":1762459842224,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030435196"},{"type":"electronic","value":"9783030435202"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43520-2_13","type":"book-chapter","created":{"date-parts":[[2020,3,31]],"date-time":"2020-03-31T23:08:28Z","timestamp":1585696108000},"page":"204-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Expressive Power and Succinctness of the Positive Calculus of Relations"],"prefix":"10.1007","author":[{"given":"Yoshiki","family":"Nakamura","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,1]]},"reference":[{"key":"13_CR1","volume-title":"Foundations of Databases: The Logical Level","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases: The Logical Level. Addison-Wesley, Boston (1995)"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1007\/BF01225472","volume":"33","author":"H Andr\u00e9ka","year":"1995","unstructured":"Andr\u00e9ka, H., Bredikhin, D.A.: The equational theory of union-free algebras of relations. Algebra Universalis 33(4), 516\u2013532 (1995). https:\/\/doi.org\/10.1007\/BF01225472","journal-title":"Algebra Universalis"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A Chandra","year":"1982","unstructured":"Chandra, A., Harel, D.: Structure and complexity of relational queries. J. Comput. Syst. Sci. 25(1), 99\u2013128 (1982). https:\/\/doi.org\/10.1016\/0022-0000(82)90012-5","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2559946","volume":"15","author":"H Chen","year":"2014","unstructured":"Chen, H.: On the complexity of existential positive queries. ACM Trans. Comput. Logic 15(1), 1\u201320 (2014). https:\/\/doi.org\/10.1145\/2559946","journal-title":"ACM Trans. Comput. Logic"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. J. Artif. Intell. Res. 17, 229\u2013264 (2002). https:\/\/doi.org\/10.1613\/jair.989","journal-title":"J. Artif. Intell. Res."},{"key":"13_CR6","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28788-4","volume-title":"Finite Model Theory","author":"H-D Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. SMM, 2nd edn. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-28788-4","edition":"2"},{"issue":"2\u20133","key":"13_CR7","first-page":"233","volume":"9","author":"K Ellul","year":"2004","unstructured":"Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: new results and open problems. J. Automata Lang. Comb. 9(2\u20133), 233\u2013256 (2004)","journal-title":"J. Automata Lang. Comb."},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-65235-1","volume-title":"Introduction to Relation Algebras: Relation Algebras","author":"S Givant","year":"2017","unstructured":"Givant, S.: Introduction to Relation Algebras: Relation Algebras, vol. 1. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-65235-1"},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10817-006-9062-x","volume":"37","author":"S Givant","year":"2007","unstructured":"Givant, S.: The calculus of relations as a foundation for mathematics. J. Autom. Reason. 37(4), 277\u2013322 (2007). https:\/\/doi.org\/10.1007\/s10817-006-9062-x","journal-title":"J. Autom. Reason."},{"key":"13_CR10","unstructured":"Gogic, G., Kautz, C., Papadimitriou, H., Selman, B.: The comparative linguistics of knowledge representation. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, (IJCAI 1995), vol. 1, pp. 862\u2013869. Morgan Kaufmann Publishers Inc. (1995)"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. Logical Methods Comput. Sci. 1(1) (2005). https:\/\/doi.org\/10.2168\/LMCS-1(1:6)2005","DOI":"10.2168\/LMCS-1(1:6)2005"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-70583-3_4","volume-title":"Automata, Languages and Programming","author":"H Gruber","year":"2008","unstructured":"Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 39\u201350. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_4"},{"key":"13_CR13","volume-title":"Cylindric Algebras. Part 2","author":"L Henkin","year":"1985","unstructured":"Henkin, L., Donald Monk, J., Tarski, A.: Cylindric Algebras. Part 2. North-Holland, Amsterdam (1985)"},{"key":"13_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L Libkin","year":"2012","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-662-07003-1"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Maddux, R.D.: Calculus of relations, Chap. 1. In: Relation Algebras. Studies in Logic and the Foundations of Mathematics, vol. 150, pp. 1\u201333. Elsevier (2006). https:\/\/doi.org\/10.1016\/S0049-237X(06)80023-6","DOI":"10.1016\/S0049-237X(06)80023-6"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Meyer, A.R., Fischer, M.J.: Economy of description by automata, grammars, and formal systems. In: 12th Annual Symposium on Switching and Automata Theory (SWAT 1971), pp. 188\u2013191. IEEE (1971). https:\/\/doi.org\/10.1109\/SWAT.1971.11","DOI":"10.1109\/SWAT.1971.11"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Nakamura, Y.: Partial derivatives on graphs for Kleene allegories. In: 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2017), pp. 1\u201312. IEEE (2017). https:\/\/doi.org\/10.1109\/LICS.2017.8005132","DOI":"10.1109\/LICS.2017.8005132"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-662-58771-3_11","volume-title":"Logic and Its Applications","author":"Y Nakamura","year":"2019","unstructured":"Nakamura, Y.: The undecidability of FO3 and the calculus of relations with just one binary relation. In: Khan, M.A., Manuel, A. (eds.) ICLA 2019. LNCS, vol. 11600, pp. 108\u2013120. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-58771-3_11"},{"key":"13_CR19","doi-asserted-by":"publisher","unstructured":"Pous, D.: On the positive calculus of relations with transitive closure. In: 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), vol. 96, pp. 3:1\u20133:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018). https:\/\/doi.org\/10.4230\/LIPICS.STACS.2018.3","DOI":"10.4230\/LIPICS.STACS.2018.3"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Pous, D., Vignudelli, V.: Allegories: decidability and graph homomorphisms. In: Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2018), pp. 829\u2013838. ACM Press (2018). https:\/\/doi.org\/10.1145\/3209108.3209172","DOI":"10.1145\/3209108.3209172"},{"key":"13_CR21","unstructured":"Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. Ph.D. thesis. Massachusetts Institute of Technology (1974)"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.2307\/2268577","volume":"6","author":"A Tarski","year":"1941","unstructured":"Tarski, A.: On the calculus of relations. J. Symb. Logic 6(3), 73\u201389 (1941). https:\/\/doi.org\/10.2307\/2268577","journal-title":"J. Symb. Logic"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Tarski, A., Givant, S.: A Formalization of Set Theory Without Variables, vol. 41. Colloquium Publications\/American Mathematical Society (1987)","DOI":"10.1090\/coll\/041"},{"key":"13_CR24","doi-asserted-by":"publisher","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), pp. 137\u2013146. ACM Press (1982). https:\/\/doi.org\/10.1145\/800070.802186","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43520-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T19:03:21Z","timestamp":1709665401000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-43520-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030435196","9783030435202"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43520-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palaiseau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ramics18.gforge.inria.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"29","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":"69% - 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":"4","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}