{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:10:36Z","timestamp":1743131436870,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030930998"},{"type":"electronic","value":"9783030931001"}],"license":[{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,16]],"date-time":"2021-12-16T00:00:00Z","timestamp":1639612800000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93100-1_12","type":"book-chapter","created":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T23:02:26Z","timestamp":1639609346000},"page":"180-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computational Properties of Partial Non-deterministic Matrices and Their Logics"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6941-7555","authenticated-orcid":false,"given":"S\u00e9rgio","family":"Marcelino","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5587-6585","authenticated-orcid":false,"given":"Carlos","family":"Caleiro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7164-8264","authenticated-orcid":false,"given":"Pedro","family":"Filipe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,16]]},"reference":[{"issue":"5","key":"12_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ipl.2005.02.004","volume":"94","author":"S Anantharaman","year":"2005","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231\u2013240 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2005.02.004","journal-title":"Inf. Process. Lett."},{"key":"12_CR2","unstructured":"Avron, A.: Non-deterministic semantics for families of paraconsistent logics. In: Handbook of Paraconsistency, Studies in Logic, vol. 9. College Publications (2007)"},{"issue":"3","key":"12_CR3","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/logcom\/exi001","volume":"15","author":"A Avron","year":"2005","unstructured":"Avron, A., Lev, I.: Non-deterministic multiple-valued structures. J. Log. Comput. 15(3), 241\u2013261 (2005). https:\/\/doi.org\/10.1093\/logcom\/exi001","journal-title":"J. Log. Comput."},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic. Handbook of Philosophical Logic, vol. 16. Springer, Dordrecht (2011). https:\/\/doi.org\/10.1007\/978-94-007-0479-4_4","DOI":"10.1007\/978-94-007-0479-4_4"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1017\/S1755020318000321","volume":"12","author":"A Avron","year":"2019","unstructured":"Avron, A., Zohar, Y.: Rexpansions of non-deterministic matrices and their applications. Rev. Symb. Log. 12(1), 173\u2013200 (2019). https:\/\/doi.org\/10.1017\/S1755020318000321","journal-title":"Rev. Symb. Log."},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-013-9273-x","volume":"51","author":"M Baaz","year":"2013","unstructured":"Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. J. Autom. Reason. 51(4), 401\u2013430 (2013). https:\/\/doi.org\/10.1007\/s10817-013-9273-x","journal-title":"J. Autom. Reason."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-59533-6_6","volume-title":"Logic, Language, Information, and Computation","author":"C Caleiro","year":"2019","unstructured":"Caleiro, C., Marcelino, S.: Analytic calculi for monadic PNmatrices. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 84\u201398. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-59533-6_6"},{"key":"12_CR8","unstructured":"Caleiro, C., Marcelino, S.: Modular semantics for combined many-valued logics (2021, submitted)"},{"key":"12_CR9","series-title":"Outstanding Contributions to Logic","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-030-71258-7_3","volume-title":"Arnon Avron on Semantics and Proof Theory of Non-Classical Logics","author":"C Caleiro","year":"2021","unstructured":"Caleiro, C., Marcelino, S.: On axioms and rexpansions. In: Arieli, O., Zamansky, A. (eds.) Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. OCL, vol. 21, pp. 39\u201369. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71258-7_3"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Caleiro, C., Marcelino, S., Filipe, P.: Infectious semantics and analytic calculi for even more inclusion logics. In: 2020 IEEE 50th International Symposium on Multiple-Valued Logic, pp. 224\u2013229 (2020). https:\/\/doi.org\/10.1109\/ISMVL49045.2020.000-1","DOI":"10.1109\/ISMVL49045.2020.000-1"},{"key":"12_CR11","unstructured":"Charatonik, W.: Automata on DAG representations of finite trees. Technical report, MPI-I-1999-2-001, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, Germany (1999)"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Taming paraconsistent (and other) logics: an algorithmic approach. ACM Trans. Comput. Log. 16(1), 5:1\u20135:16 (2014). https:\/\/doi.org\/10.1145\/2661636","DOI":"10.1145\/2661636"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, STOC 1971, pp. 151\u2013158. Association for Computing Machinery (1971). https:\/\/doi.org\/10.1145\/800157.805047","DOI":"10.1145\/800157.805047"},{"key":"12_CR14","unstructured":"Font, J.: Abstract Algebraic Logic. Mathematical Logic and Foundations, vol. 60. College Publications (2016)"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.3390\/e22020156","volume":"22","author":"JP Jorge","year":"2020","unstructured":"Jorge, J.P., Holik, F.: Non-deterministic semantics for quantum states. Entropy 22(2), 156 (2020). https:\/\/doi.org\/10.3390\/e22020156","journal-title":"Entropy"},{"issue":"3","key":"12_CR16","doi-asserted-by":"publisher","first-page":"182","DOI":"10.2307\/2266783","volume":"15","author":"J Kalicki","year":"1950","unstructured":"Kalicki, J.: A test for the existence of tautologies according to many-valued truth-tables. J. Symb. Log. 15(3), 182\u2013184 (1950). https:\/\/doi.org\/10.2307\/2266783","journal-title":"J. Symb. Log."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.2307\/2267687","volume":"17","author":"J Kalicki","year":"1952","unstructured":"Kalicki, J.: A test for the equality of truth-tables. J. Symb. Log. 17(3), 161\u2013163 (1952). https:\/\/doi.org\/10.2307\/2267687","journal-title":"J. Symb. Log."},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series. Springer, Boston, MA (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Lau, D.: Function Algebras on Finite Sets. A Basic Course on Many-Valued Logic and Clone Theory. Springer Monographs in Mathematics. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-36023-9","DOI":"10.1007\/3-540-36023-9"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Marcelino, S.: An unexpected Boolean connective. Logica Universalis (2021). https:\/\/doi.org\/10.1007\/s11787-021-00280-7","DOI":"10.1007\/s11787-021-00280-7"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-662-55386-2_17","volume-title":"Logic, Language, Information, and Computation","author":"S Marcelino","year":"2017","unstructured":"Marcelino, S., Caleiro, C.: Disjoint fibring of non-deterministic matrices. In: Kennedy, J., de Queiroz, R.J.G.B. (eds.) WoLLIC 2017. LNCS, vol. 10388, pp. 242\u2013255. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-55386-2_17"},{"issue":"22","key":"12_CR22","doi-asserted-by":"publisher","first-page":"5373","DOI":"10.1007\/s11229-019-02142-8","volume":"198","author":"S Marcelino","year":"2019","unstructured":"Marcelino, S., Caleiro, C.: Axiomatizing non-deterministic many-valued generalized consequence relations. Synthese 198(22), 5373\u20135390 (2019). https:\/\/doi.org\/10.1007\/s11229-019-02142-8","journal-title":"Synthese"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s11225-009-9196-z","volume":"92","author":"J Marcos","year":"2009","unstructured":"Marcos, J.: What is a non-truth-functional Logic? Stud. Logica. 92(2), 215\u2013240 (2009). https:\/\/doi.org\/10.1007\/s11225-009-9196-z","journal-title":"Stud. Logica."},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Omori, H., Skurt, D.: Untruth, falsity and non-deterministic semantics. In: 2021 IEEE 51th International Symposium on Multiple-Valued Logic, pp. 74\u201380 (2021). https:\/\/doi.org\/10.1109\/ISMVL51352.2021.00022","DOI":"10.1109\/ISMVL51352.2021.00022"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Scott, D.: Completeness and axiomatizability in many-valued logic. In: Henkin, L., Addison, J., Chang, C., Craig, W., Scott, D., Vaught, R. (eds.) Proceedings of the Tarski Symposium. Proceedings of Symposia in Pure Mathematics, vol. XXV, pp. 411\u2013435. American Mathematical Society (1974). https:\/\/doi.org\/10.1007\/978-3-0346-0145-0_24","DOI":"10.1007\/978-3-0346-0145-0_24"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Shoesmith, D., Smiley, T.: Multiple-Conclusion Logic. Cambridge University Press (1978). https:\/\/doi.org\/10.1017\/CBO9780511565687","DOI":"10.1017\/CBO9780511565687"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"W\u00f3jcicki, R.: Theory of Logical Calculi. Basic Theory of Consequence Operations. Synthese Library, vol. 199. Kluwer (1998). https:\/\/doi.org\/10.1007\/978-94-015-6942-2","DOI":"10.1007\/978-94-015-6942-2"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93100-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T00:04:10Z","timestamp":1640563450000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93100-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,16]]},"ISBN":["9783030930998","9783030931001"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93100-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021,12,16]]},"assertion":[{"value":"16 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/","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":"35","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":"23","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":"66% - 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.4","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)"}}]}}