J. Bomanson, M. Gebser, T. Janhunen, B. Kaufmann, Torsten Schaub
Acyclicity constraints are prevalent in knowledge representation and, in particular, applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related with recursive structures. The implementation, obtained as an extension to the state-of-the-art answer set solver clasp, provides a unique combination of traditional unfounded set checking with acyclicity propagation.
{"title":"Answer Set Programming Modulo Acyclicity","authors":"J. Bomanson, M. Gebser, T. Janhunen, B. Kaufmann, Torsten Schaub","doi":"10.3233/FI-2016-1398","DOIUrl":"https://doi.org/10.3233/FI-2016-1398","url":null,"abstract":"Acyclicity constraints are prevalent in knowledge representation and, in particular, applications where acyclic data structures such as DAGs and trees play a role. Recently, such constraints have been considered in the satisfiability modulo theories (SMT) framework, and in this paper we carry out an analogous extension to the answer set programming (ASP) paradigm. The resulting formalism, ASP modulo acyclicity, offers a rich set of primitives to express constraints related with recursive structures. The implementation, obtained as an extension to the state-of-the-art answer set solver clasp, provides a unique combination of traditional unfounded set checking with acyclicity propagation.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2015-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77777049","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}
Michael Abseher, M. Gebser, Nysret Musliu, Torsten Schaub, S. Woltran
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.
{"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":null,"pages":null},"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}
F. Drewes, M. Holzer, Sebastian Jakobi, Brink van der Merwe
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.
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
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 ...
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
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, ...
{"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":null,"pages":null},"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}
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.
{"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":null,"pages":null},"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}
{"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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：