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

Logic Programming and Automated Reasoning最新文献

筛选
英文 中文
Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic 高阶逻辑中综合函数的深度强化学习
Logic Programming and Automated Reasoning Pub Date : 2019-10-25 DOI: 10.29007/7jmg
Thibault Gauthier
{"title":"Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic","authors":"Thibault Gauthier","doi":"10.29007/7jmg","DOIUrl":"https://doi.org/10.29007/7jmg","url":null,"abstract":"The paper describes a deep reinforcement learning framework based on self-supervised learning within the proof assistant HOL4. A close interaction between the machine learning modules and the HOL4 library is achieved by the choice of tree neural networks (TNNs) as machine learning models and the internal use of HOL4 terms to represent tree structures of TNNs. Recursive improvement is possible when a task is expressed as a search problem. In this case, a Monte Carlo Tree Search (MCTS) algorithm guided by a TNN can be used to explore the search space and produce better examples for training the next TNN. As an illustration, term synthesis tasks on combinators and Diophantine equations are specified and learned. We achieve a success rate of 65% on combinator synthesis problems outperforming state-of-the-art ATPs run with their best general set of strategies. We set a precedent for statistically guided synthesis of Diophantine equations by solving 78.5% of the generated test problems.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"312 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133238324","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}
引用次数: 11
A typed parallel lambda-calculus via 1-depth intermediate proofs 通过一深度中间证明的一类并行λ演算
Logic Programming and Automated Reasoning Pub Date : 2019-02-11 DOI: 10.29007/g15z
Federico Aschieri, A. Ciabattoni, Francesco A. Genco
{"title":"A typed parallel lambda-calculus via 1-depth intermediate proofs","authors":"Federico Aschieri, A. Ciabattoni, Francesco A. Genco","doi":"10.29007/g15z","DOIUrl":"https://doi.org/10.29007/g15z","url":null,"abstract":"We introduce a Curry-Howard correspondence for a large class of intermediate logics characterized by intuitionistic proofs with non-nested applications of rules for classical disjunctive tautologies (1-depth intermediate proofs). The resulting calculus, we call it $lambda_{parallel}$, is a strongly normalizing parallel extension of the simply typed $lambda$-calculus. Although simple, the $lambda_{parallel}$ reduction rules can model arbitrary process network topologies, and encode interesting parallel programs ranging from numeric computation to algorithms on graphs.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116556535","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}
引用次数: 0
Symmetry breaking in a new stable model search method 对称破缺中的一种新的稳定模型搜索方法
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/1l5r
T. Khaled, B. Benhamou
{"title":"Symmetry breaking in a new stable model search method","authors":"T. Khaled, B. Benhamou","doi":"10.29007/1l5r","DOIUrl":"https://doi.org/10.29007/1l5r","url":null,"abstract":"","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133987096","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
Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic harsh:符号-堆分离逻辑的统一推理工具
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/QWD8
Jens Katelaan, C. Matheja, T. Noll, Florian Zuleger
{"title":"Harrsh: A Tool for Unied Reasoning about Symbolic-Heap Separation Logic","authors":"Jens Katelaan, C. Matheja, T. Noll, Florian Zuleger","doi":"10.29007/QWD8","DOIUrl":"https://doi.org/10.29007/QWD8","url":null,"abstract":"In this tool paper we present Harrsh – a tool for unified reasoning about symbolic-heap separation logic. Harrsh supports the analysis of robustness properties of the symbolic heap fragment of separation logic with user-defined inductive predicates. Robustness properties, such as satisfiability, reachability, and acyclicity, are important for a wide range of reasoning tasks in automated program analysis and verification based on separation logic. Harrsh makes use of heap automata, which offer a generic approach to reasoning about robustness properties. We report on experimental results for several robustness properties taken from the literature and compare against satisfiability checkers participating in a recent competition. We conclude that a generic approach to checking robustness is feasible and promising for the extension to further properties of interest.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132484913","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}
引用次数: 4
On Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic 关于Halpern-Shoham逻辑自反语义中不允许准时间隔的问题
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/FL6V
P. Walega
{"title":"On Disallowing Punctual Intervals in Reflexive Semantics of Halpern-Shoham Logic","authors":"P. Walega","doi":"10.29007/FL6V","DOIUrl":"https://doi.org/10.29007/FL6V","url":null,"abstract":"Halpern-Shoham logic (HS) is a very expressive and elegant formalism for interval temporal reasoning in which the satisfiability problem is undecidable. One of the methods to obtain HS-fragments of lower computational complexity is to adopt the softened (reflexive) semantics of the accessibility relations. In the paper we consider disallowing punctual intervals in reflexive semantics. We show that in this case we gain additional expressive power, which over discrete orders of time points results in PSpace-hardness of the Horn fragment of HS without diamond modal operators is and in undecidability of the core fragment of HS.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127949409","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}
引用次数: 0
Extending a Verified Simplex Algorithm 扩展一个已验证的单纯形算法
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/5VLQ
René Thiemann
{"title":"Extending a Verified Simplex Algorithm","authors":"René Thiemann","doi":"10.29007/5VLQ","DOIUrl":"https://doi.org/10.29007/5VLQ","url":null,"abstract":"As an ingredient for a verified DPLL(T) solver, it is crucial to have a theory solver that has an incremental interface and provides unsatisfiable cores. To this end, we extend the Isabelle/HOL formalization of the simplex algorithm by Spasić and Marić. We further discuss the impact of their design decisions on the development of our extension.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114340235","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}
引用次数: 5
Towards Efficient Metaquery Generator 迈向高效元查询生成器
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/xxcr
Tamar Bash, R. Ben-Eliyahu-Zohary
{"title":"Towards Efficient Metaquery Generator","authors":"Tamar Bash, R. Ben-Eliyahu-Zohary","doi":"10.29007/xxcr","DOIUrl":"https://doi.org/10.29007/xxcr","url":null,"abstract":"","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124026111","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}
引用次数: 0
Influence of Variables Encoding and Symmetry Breaking on the Performance of Optimization Modulo Theories Tools Applied to Cloud Resource Selection 变量编码和对称破缺对优化模理论工具云资源选择性能的影响
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/ZWDH
Madalina Erascu, Flavia Micota, D. Zaharie
{"title":"Influence of Variables Encoding and Symmetry Breaking on the Performance of Optimization Modulo Theories Tools Applied to Cloud Resource Selection","authors":"Madalina Erascu, Flavia Micota, D. Zaharie","doi":"10.29007/ZWDH","DOIUrl":"https://doi.org/10.29007/ZWDH","url":null,"abstract":"The problem of Cloud resource provisioning for component-based applications is very important. It consists in the allocation of virtual machines (VMs) from various Cloud Providers (CPs), to a set of applications such that the constraints induced by the interactions between components and by the components hardware/software requirements are satisfied and the performance objectives are optimized (e.g. costs are minimized). It can be formulated as a constrained optimization problem and tackled by state-of-the-art optimization modulo theories (OMT) tools. The performance of the OMT tools is highly dependent on the way the problem is formalized as this determines the size of the search space. In the case when the number of VMs offers is large, a naive encoding which does not exploit the symmetries of the underlying problem leads to a huge search space making the optimization problem intractable. We overcame this issue by reducing the search space by using: (1) a heuristic which exploits the particularities of the application by detecting cliques in the conflict graph of the application components fixing all components of the clique with the largest number of component instances, and (2) a lex-leader method for breaking variable symmetry where the canonical solution fulfills an order based on either the number of components deployed on VMs, or on the VMs price. As the result, the running time of the optimization problem improves considerably and the optimization problem scales up to hundreds of VM offers. We also observed that by combining the heuristic with the lex-leader method we obtained better computational results than by using them separately, suggesting the fact that symmetry breaking constraints have the advantage of interacting well with the search heuristic being used.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124559479","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
HoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography hot - crypt:基于密码学的同伦型理论研究
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/TVPP
P. Vivekanandan
{"title":"HoTT-Crypt : A Study in Homotopy Type Theory based on Cryptography","authors":"P. Vivekanandan","doi":"10.29007/TVPP","DOIUrl":"https://doi.org/10.29007/TVPP","url":null,"abstract":"This paper investigates a preliminary application of homotopy type theory in cryptography. It discusses specifying a cryptographic protocol using homotopy type theory which adds the notion of higher inductive type and univalence to Martin-Löf’s intensional type theory. A higher inductive type specification can act as a front-end mapped to a concrete cryptographic implementation in the universe. By having a higher inductive type front-end, we can encode domain-specific laws of the cryptographic implementation as higher-dimensional paths. The higher inductive type gives us a graphical computational model and can be used to extract functions from underlying concrete implementation. Using this model we can extend types to act as formal certificates guaranteeing on correctness properties of a cryptographic implementation.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122314827","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
ProofWatch Meets ENIGMA: First Experiments ProofWatch遇见ENIGMA:第一次实验
Logic Programming and Automated Reasoning Pub Date : 2018-11-18 DOI: 10.29007/Z7QX
Z. Goertzel, Jan Jakubuv, J. Urban
{"title":"ProofWatch Meets ENIGMA: First Experiments","authors":"Z. Goertzel, Jan Jakubuv, J. Urban","doi":"10.29007/Z7QX","DOIUrl":"https://doi.org/10.29007/Z7QX","url":null,"abstract":"","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125201648","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}
引用次数: 6
首页 上一页 下一页 尾页
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学术官方微信