Weighted Linear Dynamic Logic

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS International Journal of Foundations of Computer Science Pub Date : 2023-11-16 DOI:10.1142/s0129054123480088
Manfred Droste, Gustav Grabolle, George Rahonis
{"title":"Weighted Linear Dynamic Logic","authors":"Manfred Droste, Gustav Grabolle, George Rahonis","doi":"10.1142/s0129054123480088","DOIUrl":null,"url":null,"abstract":"<p>We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger theorem. Surprisingly, the equivalence does not require any restriction to our weighted LDL. Our results hold over arbitrary (resp. totally complete) semirings for finite (resp. infinite) words. As a consequence, the equivalence problem for weighted LDL formulas over fields is decidable in doubly exponential time. In contrast to classical logics, we show that our weighted LDL is expressively incomparable to weighted LTL for finite words. We determine a fragment of the weighted LTL such that series over finite and infinite words definable by LTL formulas in this fragment are definable also by weighted LDL formulas. This is an extended version of [17].</p>","PeriodicalId":50323,"journal":{"name":"International Journal of Foundations of Computer Science","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Foundations of Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1142/s0129054123480088","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

We introduce a weighted linear dynamic logic (weighted LDL for short) and show the expressive equivalence of its formulas to weighted rational expressions. This adds a new characterization for recognizable series to the fundamental Schützenberger theorem. Surprisingly, the equivalence does not require any restriction to our weighted LDL. Our results hold over arbitrary (resp. totally complete) semirings for finite (resp. infinite) words. As a consequence, the equivalence problem for weighted LDL formulas over fields is decidable in doubly exponential time. In contrast to classical logics, we show that our weighted LDL is expressively incomparable to weighted LTL for finite words. We determine a fragment of the weighted LTL such that series over finite and infinite words definable by LTL formulas in this fragment are definable also by weighted LDL formulas. This is an extended version of [17].

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
加权线性动态逻辑
我们引入了加权线性动态逻辑(简称加权 LDL),并展示了其公式与加权有理表达式的表达等价性。这为基本 Schützenberger 定理的可识别数列添加了新的特征。令人惊讶的是,等价性并不需要对我们的加权 LDL 做任何限制。我们的结果适用于有限(或无限)词的任意(或完全)语义。因此,域上加权 LDL 公式的等价问题可在双指数时间内解决。与经典逻辑不同的是,我们证明我们的加权 LDL 在表达上无法与有限词的加权 LTL 相提并论。我们确定了加权 LTL 的一个片段,使得该片段中可由 LTL 公式定义的有限词和无限词上的数列也可由加权 LDL 公式定义。这是 [17] 的扩展版本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
International Journal of Foundations of Computer Science
International Journal of Foundations of Computer Science 工程技术-计算机:理论方法
CiteScore
1.60
自引率
12.50%
发文量
63
审稿时长
3 months
期刊介绍: The International Journal of Foundations of Computer Science is a bimonthly journal that publishes articles which contribute new theoretical results in all areas of the foundations of computer science. The theoretical and mathematical aspects covered include: - Algebraic theory of computing and formal systems - Algorithm and system implementation issues - Approximation, probabilistic, and randomized algorithms - Automata and formal languages - Automated deduction - Combinatorics and graph theory - Complexity theory - Computational biology and bioinformatics - Cryptography - Database theory - Data structures - Design and analysis of algorithms - DNA computing - Foundations of computer security - Foundations of high-performance computing
期刊最新文献
The 4-Set Tree Connectivity of Folded Hypercube An Efficient Algorithm to Compute Dot Product Dimension of Some Outerplanar Graphs The Longest Wave Subsequence Problem: Generalizations of the Longest Increasing Subsequence Problem State Complexity of Boolean Operations on Graph-Walking Automata Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata Over Small Alphabets
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1