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

Logic Programming and Automated Reasoning最新文献

筛选
英文 中文
Scalable Probabilistic Routes 可扩展概率路由
Logic Programming and Automated Reasoning Pub Date : 2023-06-19 DOI: 10.29007/5t69
Suwei Yang, Victor Liang, Kuldeep S. Meel
{"title":"Scalable Probabilistic Routes","authors":"Suwei Yang, Victor Liang, Kuldeep S. Meel","doi":"10.29007/5t69","DOIUrl":"https://doi.org/10.29007/5t69","url":null,"abstract":"Inference and prediction of routes have become of interest over the past decade owing to a dramatic increase in package delivery and ride-sharing services. Given the underlying combinatorial structure and the incorporation of probabilities, route prediction involves techniques from both formal methods and machine learning. One promising approach for predicting routes uses decision diagrams that are augmented with probability values. However, the effectiveness of this approach depends on the size of the compiled decision diagrams. The scalability of the approach is limited owing to its empirical runtime and space complexity. In this work, our contributions are two-fold: first, we introduce a relaxed encoding that uses a linear number of variables with respect to the number of vertices in a road network graph to significantly reduce the size of resultant decision diagrams. Secondly, instead of a stepwise sampling procedure, we propose a single pass sampling-based route prediction. In our evaluations arising from a real-world road network, we demonstrate that the resulting system achieves around twice the quality of suggested routes while being an order of magnitude faster compared to state-of-the-art.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":" 22","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120834621","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
A Mathematical Benchmark for Inductive Theorem Provers 归纳定理证明者的数学基准
Logic Programming and Automated Reasoning Pub Date : 2023-04-06 DOI: 10.48550/arXiv.2304.02986
Thibault Gauthier, C. Brown, Mikoláš Janota, J. Urban
{"title":"A Mathematical Benchmark for Inductive Theorem Provers","authors":"Thibault Gauthier, C. Brown, Mikoláš Janota, J. Urban","doi":"10.48550/arXiv.2304.02986","DOIUrl":"https://doi.org/10.48550/arXiv.2304.02986","url":null,"abstract":"We present a benchmark of 29687 problems derived from the On-Line Encyclopedia of Integer Sequences (OEIS). Each problem expresses the equivalence of two syntactically different programs generating the same OEIS sequence. Such programs were conjectured by a learning-guided synthesis system using a language with looping operators. The operators implement recursion, and thus many of the proofs require induction on natural numbers. The benchmark contains problems of varying difficulty from a wide area of mathematical domains. We believe that these characteristics will make it an effective judge for the progress of inductive theorem provers in this domain for years to come.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129013241","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
Tighter Abstract Queries in Neural Network Verification 神经网络验证中的紧密抽象查询
Logic Programming and Automated Reasoning Pub Date : 2022-10-23 DOI: 10.48550/arXiv.2210.12871
Elazar Cohen, Y. Elboher, Clark W. Barrett, Guy Katz
{"title":"Tighter Abstract Queries in Neural Network Verification","authors":"Elazar Cohen, Y. Elboher, Clark W. Barrett, Guy Katz","doi":"10.48550/arXiv.2210.12871","DOIUrl":"https://doi.org/10.48550/arXiv.2210.12871","url":null,"abstract":"Neural networks have become critical components of reactive systems in various do- mains within computer science. Despite their excellent performance, using neural networks entails numerous risks that stem from our lack of ability to understand and reason about their behavior. Due to these risks, various formal methods have been proposed for verify- ing neural networks; but unfortunately, these typically struggle with scalability barriers. Recent attempts have demonstrated that abstraction-refinement approaches could play a significant role in mitigating these limitations; but these approaches can often produce net- works that are so abstract, that they become unsuitable for verification. To deal with this issue, we present CEGARETTE, a novel verification mechanism where both the system and the property are abstracted and refined simultaneously. We observe that this approach allows us to produce abstract networks which are both small and sufficiently accurate, allowing for quick verification times while avoiding a large number of refinement steps. For evaluation purposes, we implemented CEGARETTE as an extension to the recently proposed CEGAR-NN framework. Our results are highly promising, and demonstrate a significant improvement in performance over multiple benchmarks.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"139 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987266","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
Sensitivity Analysis of Locked Circuits 锁定电路的灵敏度分析
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/7tpd
Joseph Sweeney, Marijn J. H. Heule, L. Pileggi
{"title":"Sensitivity Analysis of Locked Circuits","authors":"Joseph Sweeney, Marijn J. H. Heule, L. Pileggi","doi":"10.29007/7tpd","DOIUrl":"https://doi.org/10.29007/7tpd","url":null,"abstract":"Globalization of integrated circuits manufacturing has led to increased security concerns, notably theft of intellectual property. In response, logic locking techniques have been developed for protecting designs, but many of these techniques have been shown to be vulnerable to SAT-based attacks. In this paper, we explore the use of Boolean sensitivity to analyze these locked circuits. We show that in typical circuits there is an inverse relationship between input width and sensitivity. We then demonstrate the utility of this relationship for deobfuscating circuits locked with a class of “provably secure” logic locking techniques. We conclude with an example of how to resist this attack, although the resistance is shown to be highly circuit dependent.","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":"124862960","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
Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation 通过布尔可满足性和有序生成寻找周期公寓
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/k8jd
Jarkko Savela, Emilia Oikarinen, M. Järvisalo
{"title":"Finding Periodic Apartments via Boolean Satisfiability and Orderly Generation","authors":"Jarkko Savela, Emilia Oikarinen, M. Järvisalo","doi":"10.29007/k8jd","DOIUrl":"https://doi.org/10.29007/k8jd","url":null,"abstract":"Motivated by Gromov’s subgroup conjecture (GSC), a fundamental open conjecture in the area of geometric group theory, we tackle the problem of the existence of particular types of subgroups—arising from so-called periodic apartments—for a specific set of hyperbolic groups with respect to which GSC is currently open. This problem is equivalent to determining whether specific types of graphs with a non-trivial combination of properties exist. The existence of periodic apartments allows for ruling the groups out as some of the remaining potential counterexamples to GSC. Our approach combines both automated reasoning techniques—in particular, Boolean satisfiability (SAT) solving—with problem-specific orderly generation. Compared to earlier attempts to tackle the problem through computational means, our approach scales noticeably better, and allows for both confirming results from a previous computational treatment for smaller parameter values as well as ruling out further groups out as potential counterexamples to GSC.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"54 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":"116611333","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
Models of Concurrent Kleene Algebra 并发Kleene代数模型
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/qp92
Alexandra Silva
{"title":"Models of Concurrent Kleene Algebra","authors":"Alexandra Silva","doi":"10.29007/qp92","DOIUrl":"https://doi.org/10.29007/qp92","url":null,"abstract":"Kleene Algebra and variants thereof have been successfully used in verification of sequential programs. The leap to concurrent programs offers many challenges, both in terms of devising the right foundations to study concurrent variants of Kleene Algebra but also in finding the right models to enable effective verification of relevant programs. In this talk, we will review existing and ongoing work on concurrent Kleene Algebra with a focus on a variant called partially observable concurrent Kleene algebra (POCKA). POCKA offers an algebraic framework to reason about concurrent programs with control structures, such as conditionals and loops. We will show how a previously developed technique for completeness of Kleene Algebra can be lifted to prove that POCKA is a sound and complete axiomatization of a model of partial observations. We illustrate the use of the framework in the analysis of sequential consistency, i.e., whether programs behave as if memory accesses taking place were interleaved and executed sequentially. The work described in this invited talk is based on [1, 2, 3], and it is joint with a wonderful group of people: Paul Brunet, Simon Docherty, Tobias Kappé, Jurriaan Rot, Jana Wagemaker, and Fabio Zanasi.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"1 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":"132200485","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
Decision levels are stable: towards better SAT heuristics 决策水平稳定:朝着更好的SAT启发式发展
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/cz1f
R. Nieuwenhuis, A. Lozano, Albert Oliveras, Enric Rodríguez-carbonell
{"title":"Decision levels are stable: towards better SAT heuristics","authors":"R. Nieuwenhuis, A. Lozano, Albert Oliveras, Enric Rodríguez-carbonell","doi":"10.29007/cz1f","DOIUrl":"https://doi.org/10.29007/cz1f","url":null,"abstract":"We shed new light on the Literal Block Distance (LBD) and glue -based heuristics used in current SAT solvers. For this, we first introduce the concept of stickiness : given a run of a CDCL SAT solver, for each pair of literals we define, by a real value between 0 and 1, how sticky they are, basically, how frequently they are set at the same decision level. By means of a careful and detailed experimental setup and analysis, we confirm the following quite surprising fact: given a SAT instance, when running different CDCL SAT solvers on it, no matter their settings or random seeds, the stickiness relation between literals is always very similar, in a precisely defined sense. We analyze how quickly stickiness stabilizes in a run (quite quickly), and show that it is stable even under different encodings of cardinality constraints. We then describe how and why these solid new insights lead to heuristics refinements for SAT (and extensions, such as SMT) and improved information sharing in parallel solvers.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"125 1 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":"132123351","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
NACRE - A Nogood And Clause Reasoning Engine NACRE -一个无良和条款推理引擎
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/dxnb
Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre
{"title":"NACRE - A Nogood And Clause Reasoning Engine","authors":"Gael Glorian, Jean-Marie Lagniez, Christophe Lecoutre","doi":"10.29007/dxnb","DOIUrl":"https://doi.org/10.29007/dxnb","url":null,"abstract":"NACRE, for Nogood And Clause Reasoning Engine, is a constraint solver written in C++. It is based on a modular architecture designed to work with generic constraints while implementing several state-of-the-art search methods and heuristics. Interestingly, its data structures have been carefully designed to play around nogoods and clauses, making it suitable for implementing learning strategies. NACRE was submitted to the CSP MiniTrack of the 2018 and 2019 XCSP3 [8] competitions where it took the first place. This paper gives a general description of NACRE as a framework. We present its kernel, the available search algorithms, and the default settings (notably, used for XCSP3 competitions), which makes NACRE efficient in practice when used as a black-box solver.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"6 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":"114350190","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
Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions 超越符号堆:用归纳定义决定分离逻辑
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/vkmj
Jens Katelaan, Florian Zuleger
{"title":"Beyond Symbolic Heaps: Deciding Separation Logic With Inductive Definitions","authors":"Jens Katelaan, Florian Zuleger","doi":"10.29007/vkmj","DOIUrl":"https://doi.org/10.29007/vkmj","url":null,"abstract":"Symbolic-heap separation logic with inductive definitions is a popular formalism for reasoning about heap-manipulating programs. The fragment SLIDbtw introduced by Iosif, Rogalewicz and Simacek, is one of the most expressive fragments with a decidable entailment problem. In recent work, we improved on the original decidability proof by providing a direct model-theoretic construction, obtaining a 2-Exptime upper bound. In this paper, we investigate separation logics built on top of the inductive definitions from SLIDbtw, i.e., logics that feature the standard Boolean and separation-logic operators. We give an almost tight delineation between decidability and undecidabilty. We establish the decidability of the satisfiability problem (in 2-Exptime) of a separation logic with conjunction, disjunction, separating conjunction and guarded forms of negation, magic wand, and septraction. We show that any further generalization leads to undecidabilty (under mild assumptions).","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"222 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":"122886242","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}
引用次数: 17
The Triguarded Fragment with Transitivity 具有及物性的三角片段
Logic Programming and Automated Reasoning Pub Date : 2020-05-27 DOI: 10.29007/z359
Emanuel Kieronski, Adam Malinowski
{"title":"The Triguarded Fragment with Transitivity","authors":"Emanuel Kieronski, Adam Malinowski","doi":"10.29007/z359","DOIUrl":"https://doi.org/10.29007/z359","url":null,"abstract":"The triguarded fragment of first-order logic is an extension of the guarded fragment in which quantification for subformulas with at most two free variables need not be guarded. Thus, it unifies two prominent decidable logics: the guarded fragment and the two-variable fragment. Its satisfiability problem is known to be undecidable in the presence of equality, but becomes decidable when equality is forbidden. We consider an extension of the triguarded fragment without equality by transitive relations, allowing them to be used only as guards. We show that the satisfiability problem for the obtained formalism is decidable and 2 -ExpTime -complete, that is, it is of the same complexity as for the analogous extension of the classical guarded fragment. In fact, in our satisfiability test we use a decision procedure for the latter as a subroutine. We also show how our approach, consisting in exploiting some existing results on guarded logics, can be used to reprove some known facts, as well as to derive some other new results on triguarded logics.","PeriodicalId":207621,"journal":{"name":"Logic Programming and Automated Reasoning","volume":"77 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":"126252784","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
下一页 尾页
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学术官方微信