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

Logic Programming and Automated Reasoning最新文献

筛选
英文 中文
An ASP-based Approach for Boolean Networks Representation and Attractor Detection 一种基于asp的布尔网络表示和吸引子检测方法
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/fb4f
T. Khaled, B. Benhamou
{"title":"An ASP-based Approach for Boolean Networks Representation and Attractor Detection","authors":"T. Khaled, B. Benhamou","doi":"10.29007/fb4f","DOIUrl":"https://doi.org/10.29007/fb4f","url":null,"abstract":"In biology, Boolean networks are conventionally used to represent and simulate gene regulatory networks. The attractors are the subject of special attention in analyzing the dynamics of a Boolean network. They correspond to stable states and stable cycles, which play a crucial role in biological systems. In this work, we study a new representation of the dynamics of Boolean networks that are based on a new semantics used in answer set programming (ASP). Our work is based on the enumeration of all the attractors of asynchronous Boolean networks having interaction graphs which are circuits. We show that the used semantics allows to design a new approach for computing exhaustively both the stable cycles and the stable states of such networks. The enumeration of all the attractors and the distinction between both types of attractors is a significant step to better understand some critical aspects of biology. We applied and evaluated the proposed approach on randomly generated Boolean networks and the obtained results highlight the benefits of this approach, and match with some conjectured results in biology.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134569555","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Parameter Synthesis for Probabilistic Hyperproperties 概率超性质的参数综合
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/37lf
E. Ábrahám, E. Bartocci, Borzoo Bonakdarpour, Oyendrila Dobe
{"title":"Parameter Synthesis for Probabilistic Hyperproperties","authors":"E. Ábrahám, E. Bartocci, Borzoo Bonakdarpour, Oyendrila Dobe","doi":"10.29007/37lf","DOIUrl":"https://doi.org/10.29007/37lf","url":null,"abstract":"In this paper, we study the parameter synthesis problem for probabilistic hyperproperties. A probabilistic hyperproperty stipulates quantitative dependencies among a set of executions. In particular, we solve the following problem: given a probabilistic hyperproperty ψ and discrete-time Markov chain D with parametric transition probabilities, compute regions of parameter configurations that instantiate D to satisfy ψ, and regions that lead to violation. We address this problem for a fragment of the temporal logic HyperPCTL that allows expressing quantitative reachability relation among a set of computation trees. We illustrate the application of our technique in the areas of differential privacy, probabilistic nonintereference, and probabilistic conformance.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114241556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Antiprenexing for WSkS: A Little Goes a Long Way WSkS的反前置:一点点就能走很远
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/6bfc
Vojtěch Havlena, L. Holík, Ondřej Lengál, Ondrej Vales, Tomáš Vojnar
{"title":"Antiprenexing for WSkS: A Little Goes a Long Way","authors":"Vojtěch Havlena, L. Holík, Ondřej Lengál, Ondrej Vales, Tomáš Vojnar","doi":"10.29007/6bfc","DOIUrl":"https://doi.org/10.29007/6bfc","url":null,"abstract":"We study light-weight techniques for preprocessing of WSkS formulae in an automatabased decision procedure as implemented, e.g., in Mona. The techniques we use are based on antiprenexing, i.e., pushing quantifiers deeper into a formula. Intuitively, this tries to alleviate the explosion in the size of the constructed automata by making it happen sooner on smaller automata (and have the automata minimization reduce the output). The formula transformations that we use to implement antiprenexing may, however, be applied in different ways and extent and, if used in an unsuitable way, may also cause an explosion in the size of the formula and the automata built while deciding it. Therefore, our approach uses informed rules that use an estimation of the cost of constructing automata for WSkS formulae. The estimation is based on a model learnt from runs of the decision algorithm on various formulae. An experimental evaluation of our technique shows that antiprenexing can significantly boost the performance of the base WSkS decision procedure, sometimes allowing one to decide formulae that could not be decided before.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"610 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127524790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Verified SAT Solver Framework including Optimization and Partial Valuations 一个经过验证的SAT求解器框架，包括优化和部分估值
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/96wb
M. Fleury, Christoph Weidenbach
{"title":"A Verified SAT Solver Framework including Optimization and Partial Valuations","authors":"M. Fleury, Christoph Weidenbach","doi":"10.29007/96wb","DOIUrl":"https://doi.org/10.29007/96wb","url":null,"abstract":"Based on the formal framework for CDCL (conflict-driven clause learning) verified by Blanchette et al. using the proof assistant Isabelle/HOL, we verify an optimizing extension of CDCL based on branch and bound, called OCDCL, first by developing a framework for CDCL with branch and bounds, called CDCLBnB. OCDCL computes models of minimal cost with respect to total valuations. Through the dual rail encoding, we reduce the search for cost-optimal models with respect to partial valuations to searching for total cost-optimal models, as derived by OCDCL. OCDCL can also be used to solve further optimization tasks such as MAX-SAT and CDCLBnB can be used to find a set of covering models. A large part of the original CDCL framework could be reused without changes to reduce the complexity of the new formalization. To the best of our knowledge, this is the first rigorous formalization of an optimizing CDCL calculus and the first solution that computes cost-optimal models with respect to partial valuations.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128443477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Minimal Modifications of Deep Neural Networks using Verification 使用验证的深度神经网络的最小修改
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/699q
B. Goldberger, Guy Katz, Yossi Adi, Joseph Keshet
{"title":"Minimal Modifications of Deep Neural Networks using Verification","authors":"B. Goldberger, Guy Katz, Yossi Adi, Joseph Keshet","doi":"10.29007/699q","DOIUrl":"https://doi.org/10.29007/699q","url":null,"abstract":"Deep neural networks (DNNs) are revolutionizing the way complex systems are designed, developed and maintained. As part of the life cycle of DNN-based systems, there is often a need to modify a DNN in subtle ways that affect certain aspects of its behavior, while leaving other aspects of its behavior unchanged (e.g., if a bug is discovered and needs to be fixed, without altering other functionality). Unfortunately, retraining a DNN is often difficult and expensive, and may produce a new DNN that is quite different from the original. We leverage recent advances in DNN verification and propose a technique for modifying a DNN according to certain requirements, in a way that is provably minimal, does not require any retraining, and is thus less likely to affect other aspects of the DNN’s behavior. Using a proof-of-concept implementation, we demonstrate the usefulness and potential of our approach in addressing two real-world needs: (i) measuring the resilience of DNN watermarking schemes; and (ii) bug repair in already-trained DNNs.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"207 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124643357","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 49
Polynomial Loops: Beyond Termination 多项式循环:超越终止
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/nxv1
Marcel Hark, Florian Frohn, J. Giesl
{"title":"Polynomial Loops: Beyond Termination","authors":"Marcel Hark, Florian Frohn, J. Giesl","doi":"10.29007/nxv1","DOIUrl":"https://doi.org/10.29007/nxv1","url":null,"abstract":"In the last years, several works were concerned with identifying classes of programs where termination is decidable. We consider triangular weakly non-linear loops (twn-loops) over a ring Z ≤ S ≤ RA, where RA is the set of all real algebraic numbers. Essentially, the body of such a loop is a single assignment ( x1 ... xd ) ← ( c1·x1+pol1 ... cd·xd+pold ) where each xi is a variable, ci ∈ S, and each pol i is a (possibly non-linear) polynomial over S and the variables xi+1, . . . , xd. Recently, we showed that termination of such loops is decidable for S = RA and non-termination is semi-decidable for S = Z and S = Q [19]. In this paper, we show that the halting problem is decidable for twn-loops over any ring Z ≤ S ≤ RA. In contrast to the termination problem, where termination on all inputs is considered, the halting problem is concerned with termination on a given input. This allows us to compute witnesses for non-termination. Moreover, we present the first computability results on the runtime complexity of such loops. More precisely, we show that for twn-loops over Z one can always compute a polynomial f such that the length of all terminating runs is bounded by f(‖(x1, . . . , xd)‖), where ‖ · ‖ denotes the 1-norm. As a corollary, we obtain that the runtime of a terminating triangular linear loop over Z is at most linear.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"498 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116326442","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Rotation Based MSS/MCS Enumeration 基于轮换的MSS/MCS枚举
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/8btb
Jaroslav Bendík, I. Cerná
{"title":"Rotation Based MSS/MCS Enumeration","authors":"Jaroslav Bendík, I. Cerná","doi":"10.29007/8btb","DOIUrl":"https://doi.org/10.29007/8btb","url":null,"abstract":"Given an unsatisfiable Boolean Formula F in CNF, i.e., a set of clauses, one is often interested in identifying Maximal Satisfiable Subsets (MSSes) of F or, equivalently, the complements of MSSes called Minimal Correction Subsets (MCSes). Since MSSes (MC-Ses) find applications in many domains, e.g. diagnosis, ontologies debugging, or axiom pinpointing, several MSS enumeration algorithms have been proposed. Unfortunately, finding even a single MSS is often very hard since it naturally subsumes repeatedly solving the satisfiability problem. Moreover, there can be up to exponentially many MSSes, thus their complete enumeration is often practically intractable. Therefore, the algorithms tend to identify as many MSSes as possible within a given time limit. In this work, we present a novel MSS enumeration algorithm called RIME . Compared to existing algorithms, RIME is much more frugal in the number of performed satisfiability checks which we witness via an experimental comparison. Moreover, RIME is several times faster than existing tools.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117155132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Coloring Unit-Distance Strips using SAT 用SAT给单位距离条上色
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/btmj
Peter Oostema, R. Martins, Marijn J. H. Heule
{"title":"Coloring Unit-Distance Strips using SAT","authors":"Peter Oostema, R. Martins, Marijn J. H. Heule","doi":"10.29007/btmj","DOIUrl":"https://doi.org/10.29007/btmj","url":null,"abstract":"Satisfiability (SAT) solving has become an important technology in computer-aided mathematics with various successes in number and graph theory. In this paper we apply SAT solvers to color infinitely long strips in the plane with a given height and number of colors. The coloring is constrained as follows: two points that are exactly unit distance apart must be colored differently. To finitize the problem, we tile the strips and all points on a tile have the same color. We evaluated our approach using two different tile shapes: squares and hexagons. The visualization of bounded height strips using 3 to 6 colors reveal patterns that are similar to the best known lower bounds for infinite strips. Our method can be a useful tool for mathematicians to search for patterns that can be generalized to infinite strips and allowed us to increase the lower bound for the strip height with 5 colors to an improved height of 1.700084.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131683761","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard 带归纳定义的分离逻辑中的蕴涵检查是2-EXPTIME困难的
Logic Programming and Automated Reasoning Pub Date : 2020-04-16 DOI: 10.29007/f5wh
M. Echenim, Radu Iosif, N. Peltier
{"title":"Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard","authors":"M. Echenim, Radu Iosif, N. Peltier","doi":"10.29007/f5wh","DOIUrl":"https://doi.org/10.29007/f5wh","url":null,"abstract":"The entailment between separation logic formulae with inductive predicates, also known as symbolic heaps, has been shown to be decidable for a large class of inductive definitions. Recently, a 2-EXPTIME algorithm was proposed and an EXPTIME-hard bound was established; however no precise lower bound is known. In this paper, we show that deciding entailment between predicate atoms is 2-EXPTIME-hard. The proof is based on a reduction from the membership problem for exponential-space bounded alternating Turing machines.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115795356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A Mechanised Semantics for HOL with Ad-hoc Overloading 具有hoc重载的HOL的机械化语义
Logic Programming and Automated Reasoning Pub Date : 2020-02-24 DOI: 10.29007/413D
Johannes Åman Pohjola, A. Gengelbach
{"title":"A Mechanised Semantics for HOL with Ad-hoc Overloading","authors":"Johannes Åman Pohjola, A. Gengelbach","doi":"10.29007/413D","DOIUrl":"https://doi.org/10.29007/413D","url":null,"abstract":"Isabelle/HOL augments classical higher-order logic with ad-hoc overloading of constant definitions---that is, one constant may have several definitions for non-overlapping types. In this paper, we present a mechanised proof that HOL with ad-hoc overloading is consistent. All our results have been formalised in the HOL4 theorem prover.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123181070","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
首页 上一页 下一页 尾页
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学术官方微信