{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:32:23Z","timestamp":1730280743817,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470615","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["Axiomatizations and Computability of Weighted Monadic Second-Order Logic"],"prefix":"10.1109","author":[{"given":"Antonis","family":"Achilleos","sequence":"first","affiliation":[{"name":"Reykjavik University,Department of Computer Science,Reykjavik,Iceland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathias Ruggaard","family":"Pedersen","sequence":"additional","affiliation":[{"name":"Reykjavik University,Department of Computer Science,Reykjavik,Iceland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802186"},{"key":"ref30","first-page":"326","article-title":"Finite automata and the logic of monadic predicates","volume":"149","author":"trakhtenbrot","year":"1961","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1961-0139530-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-009-9225-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1952-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(4:12)2012"},{"key":"ref14","article-title":"Reasoning about bounds in weighted transition systems","volume":"14","author":"hansen","year":"2018","journal-title":"Logical Methods in Computer Science"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0097-8493(93)90079-O"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-9(1:8)2013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5_14"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196794000063"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(61)80020-X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4_13"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02737-6_2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.055"},{"key":"ref29","article-title":"The Complexity of Decision Problems in Automata Theory","author":"stockmeyer","year":"1974","journal-title":"PhD thesis"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054107004966"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.10.001"},{"key":"ref7","first-page":"76:1","article-title":"Aperiodic weighted automata and weighted first-order logic","volume":"138","author":"droste","year":"2019","journal-title":"44th International Symposium on Mathematical Foundations of Computer Science MFCS 2019"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104651"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-015-9658-9"},{"key":"ref1","article-title":"Axiomatizations and computability of weighted monadic second-order logic","author":"achilleos","year":"2021","journal-title":"CoRR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.03.007"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2015.07.002"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2015.12.018"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-016-2193-z"},{"key":"ref26","first-page":"455","article-title":"Weighted Muller tree automata and weighted logics","volume":"12","author":"rahonis","year":"2007","journal-title":"Journal of Automata Languages and Combinatorics"},{"key":"ref25","article-title":"Weighted automata in text and speech processing","author":"mohri","year":"1996","journal-title":"Proceedings of the 12th biannual European Conference on Artificial Intelligence (ECAI 96) Workshop on Extended finite state models of language"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470615.pdf?arnumber=9470615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T23:01:55Z","timestamp":1659481315000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470615\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470615","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}