发布求助
文献互助 智能选刊 最新文献

Fundamenta Informaticae最新文献

筛选
英文 中文
Shift Design with Answer Set Programming Shift设计与答案集规划
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-09-27 DOI: 10.3233/FI-2016-1396
Michael Abseher, M. Gebser, Nysret Musliu, Torsten Schaub, S. Woltran
{"title":"Shift Design with Answer Set Programming","authors":"Michael Abseher, M. Gebser, Nysret Musliu, Torsten Schaub, S. Woltran","doi":"10.3233/FI-2016-1396","DOIUrl":"https://doi.org/10.3233/FI-2016-1396","url":null,"abstract":"Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"6 1","pages":"32-39"},"PeriodicalIF":0.8,"publicationDate":"2015-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74513434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 31
Tight Bounds for Cut-Operations on Deterministic Finite Automata 确定性有限自动机上切操作的紧界
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-09-09 DOI: 10.3233/FI-2017-1577
F. Drewes, M. Holzer, Sebastian Jakobi, Brink van der Merwe
{"title":"Tight Bounds for Cut-Operations on Deterministic Finite Automata","authors":"F. Drewes, M. Holzer, Sebastian Jakobi, Brink van der Merwe","doi":"10.3233/FI-2017-1577","DOIUrl":"https://doi.org/10.3233/FI-2017-1577","url":null,"abstract":"We investigate the state complexity of the cut and iterated cut operation for deterministic finite automata (DFAs), answering an open question stated in [M. Berglund, et al.: Cuts in regular expressions. In Proc. DLT, LNCS 7907, 2011]. These operations can be seen as an alternative to ordinary concatenation and Kleene star modelling leftmost maximal string matching. We show that the cut operation has a matching upper and lower bound of ((n-1)cdot m+n) states on DFAs accepting the cut of two individual languages that are accepted by n- and m-state DFAs, respectively. In the unary case we obtain (max (2n-1,m+n-2)) states as a tight bound. For accepting the iterated cut of a language accepted by an n-state DFA we find a matching bound of (1+(n+1)cdot mathsf {F}(,1,n+2,-n+2;n+1mid -1,)) states on DFAs, where (mathsf {F}) refers to the generalized hypergeometric function. This bound is in the order of magnitude (varTheta ((n-1)!)). Finally, the bound drops to (2n-1) for unary DFAs accepting the iterated cut of an n-state DFA and thus is similar to the bound for the cut operation on unary DFAs.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"6 1","pages":"45-60"},"PeriodicalIF":0.8,"publicationDate":"2015-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75834279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Reversible Limited Automata 可逆有限自动机
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-09-09 DOI: 10.3233/FI-2017-1575
Martin Kutrib, Matthias Wendlandt
{"title":"Reversible Limited Automata","authors":"Martin Kutrib, Matthias Wendlandt","doi":"10.3233/FI-2017-1575","DOIUrl":"https://doi.org/10.3233/FI-2017-1575","url":null,"abstract":"A k-limited automaton is a linear bounded automaton that may rewrite each tape square only in the first k visits, where (kge 0) is a fixed constant. It is known that these automata accept context-free languages only. We investigate deterministic k-limited automata towards their ability to perform reversible computations, that is, computations in which every configuration has at most one predecessor. A first result is that, for all (kge 0), sweeping k-limited automata accept regular languages only. In contrast to reversible finite automata, all regular languages are accepted by sweeping 0-limited automata. Then we study the computational power gained in the number k of possible rewrite operations. It is shown that the reversible 2-limited automata accept regular languages only and, thus, are strictly weaker than general 2-limited automata. Furthermore, a proper inclusion between reversible 3-limited and 4-limited automata languages is obtained. The next levels of the hierarchy are separated between every k and (k+3) rewrite operations. Finally, it turns out that all k-limited automata accept Church-Rosser languages only, that is, the intersection between context-free and Church-Rosser languages contains an infinite hierarchy of language families beyond the deterministic context-free languages.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"68 1","pages":"113-128"},"PeriodicalIF":0.8,"publicationDate":"2015-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80263534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Complete Characterization of Zero-expressible Functions 零可表达函数的完全刻画
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-07-01 DOI: 10.5555/2756707.2756710
DąbrowskiRobert, PlandowskiWojciech
{"title":"Complete Characterization of Zero-expressible Functions","authors":"DąbrowskiRobert, PlandowskiWojciech","doi":"10.5555/2756707.2756710","DOIUrl":"https://doi.org/10.5555/2756707.2756710","url":null,"abstract":"We describe an intersection of the family of expressible relations and another natural family of relations. This is the first result of this kind existing in the literature. To obtain it we extend ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71134069","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On String Languages Generated by Spiking Neural P Systems with Astrocytes 星形胶质细胞脉冲神经系统生成的字符串语言
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-07-01 DOI: 10.3233/FI-2015-1154
Yuan Kong, Zheng Zhang, Yang Liu
{"title":"On String Languages Generated by Spiking Neural P Systems with Astrocytes","authors":"Yuan Kong, Zheng Zhang, Yang Liu","doi":"10.3233/FI-2015-1154","DOIUrl":"https://doi.org/10.3233/FI-2015-1154","url":null,"abstract":"Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way spikes pass along the synapses between neurons. In this work, we investigate the computational power of SNPA systems as language generators. Specifically, representations of recursively enumerable languages and of regular languages are given by means of SNPA systems without forgetting rules. Furthermore, a simple finite language is produced which can be generated by SNPA systems, while it cannot be generated by usual spiking neural P systems. These results show that the astrocytes are a powerful ingredient for spiking neural P systems as language generators.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"20 1","pages":"225-229"},"PeriodicalIF":0.8,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83860580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Reversible Spiking Neural P Systems with Astrocytes 星形胶质细胞的可逆脉冲神经系统
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-07-01 DOI: 10.5555/2734192.2734196
Kongyuan, ShiXiaolong, XuJinbang, HuangXinquan
{"title":"Reversible Spiking Neural P Systems with Astrocytes","authors":"Kongyuan, ShiXiaolong, XuJinbang, HuangXinquan","doi":"10.5555/2734192.2734196","DOIUrl":"https://doi.org/10.5555/2734192.2734196","url":null,"abstract":"Spiking neural P systems with astrocytes (SNPA systems, for short) are a class of distributed parallel computing devices inspired from the way neurons communicate by means of spikes. In this work, ...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71132397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Hybrid Cloud Scheduling Method for Cloud Bursting 云爆发的混合云调度方法
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-01-01 DOI: 10.3233/FI-2015-1220
Chunlin Li, La-yuan Li
{"title":"Hybrid Cloud Scheduling Method for Cloud Bursting","authors":"Chunlin Li, La-yuan Li","doi":"10.3233/FI-2015-1220","DOIUrl":"https://doi.org/10.3233/FI-2015-1220","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"138 1","pages":"435-455"},"PeriodicalIF":0.8,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2015-1220","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Multigranulation Decision-theoretic Rough Set in Ordered Information System 有序信息系统中的多粒决策理论粗糙集
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-01-01 DOI: 10.3233/FI-2015-1226
Wentao Li, Weihua Xu
{"title":"Multigranulation Decision-theoretic Rough Set in Ordered Information System","authors":"Wentao Li, Weihua Xu","doi":"10.3233/FI-2015-1226","DOIUrl":"https://doi.org/10.3233/FI-2015-1226","url":null,"abstract":"As a generalized extension of Pawlak’s rough set model, the multigranulation decision-theoretic rough set model in ordered information systems utilizes the basic set assignment function to construct probability measure spaces through dominance relations. It is an effective tool to deal with uncertain problems and widely used in practical decision problems. However, when the scale of dataset is large, it takes a lot of time to characterize the approximations of the target concept, as well as complicated calculation processes. In this paper, we develop a novel model called local multigranulation decision-theoretic rough set in an ordered information system to overcome the above-mentioned limitation. Firstly, to reduce the computing time of the information granule independent of the target concept, we only use the characterization of the elements in the target concept to approximate this target concept. Moreover, the corresponding local multigranulation decision-theoretic rough set in an ordered information system is addressed according to the established local model, and the comparisons are made between the proposed local algorithm and the algorithm of original multigranulation decision-theoretic rough set in ordered information systems. Finally, the validity of the local approximation operators is verified through the experimental evaluation using six datasets coming from the University of California-Irvine (UCI) repository.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"139 1","pages":"67-89"},"PeriodicalIF":0.8,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2015-1226","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903220","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 49
Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2014 Petri网与其他并发模型的应用与理论:2014年Petri网论文选集特刊
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2015-01-01 DOI: 10.3233/FI-2015-1242
G. Ciardo, E. Kindler, W. Penczek
{"title":"Application and Theory of Petri Nets and Other Models of Concurrency: Special Issue of Selected Papers from Petri Nets 2014","authors":"G. Ciardo, E. Kindler, W. Penczek","doi":"10.3233/FI-2015-1242","DOIUrl":"https://doi.org/10.3233/FI-2015-1242","url":null,"abstract":"","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"140 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2015-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2015-1242","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903235","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Free Word-Order and Restarting Automata 免费词序和重新启动自动机
IF 0.8 4区 计算机科学
Fundamenta Informaticae Pub Date : 2014-10-01 DOI: 10.3233/FI-2014-1083
F. Mráz, F. Otto, Martin Plátek
{"title":"Free Word-Order and Restarting Automata","authors":"F. Mráz, F. Otto, Martin Plátek","doi":"10.3233/FI-2014-1083","DOIUrl":"https://doi.org/10.3233/FI-2014-1083","url":null,"abstract":"In natural languages with a high degree of word-order freedom, syntactic phenomena like dependencies (subordinations) or valences do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: the degree of j-monotonicity, and the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"12 1","pages":"425-436"},"PeriodicalIF":0.8,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90653088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信