arXiv - CS - Logic in Computer Science最新文献_第5页

A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory (Extended Version) 从范畴论角度看高阶逼近定点理论（扩展版）

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-21 DOI: arxiv-2408.11712

Samuele Pollaci, Babis Kostopoulos, Marc Denecker, Bart Bogaerts

引用次数: 0

Scalable Knowledge Refactoring using Constrained Optimisation 利用约束优化进行可扩展的知识重构

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-21 DOI: arxiv-2408.11530

Minghao Liu, David M. Cerna, Filipe Gouveia, Andrew Cropper

引用次数: 0

Solving Decision Theory Problems with Probabilistic Answer Set Programming 用概率答案集编程法解决决策理论问题

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-21 DOI: arxiv-2408.11371

Damiano Azzolini, Elena Bellodi, Rafael Kiesel, Fabrizio Riguzzi

引用次数: 0

Formalizing equivalences without tears 不流泪的等价形式化

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-21 DOI: arxiv-2408.11501

Tom de Jong

引用次数: 0

CTL* Verification and Synthesis using Existential Horn Clauses 使用存在角子句进行 CTL* 验证和合成

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-21 DOI: arxiv-2408.11502

Mishel Carelli, Orna Grumberg

{"title":"CTL* Verification and Synthesis using Existential Horn Clauses","authors":"Mishel Carelli, Orna Grumberg","doi":"arxiv-2408.11502","DOIUrl":"https://doi.org/arxiv-2408.11502","url":null,"abstract":"This work proposes a novel approach for automatic verification and synthesis\u0000of infinite-state reactive programs with respect to ${CTL}^*$ specifications,\u0000based on translation to Existential Horn Clauses (EHCs). $CTL^*$ is a powerful temporal logic, which subsumes the temporal logics LTL\u0000and CTL, both widely used in specification, verification, and synthesis of\u0000complex systems. EHCs with its solver E-HSF, is an extension of Constrained Horn Clauses,\u0000which includes existential quantification as well as the power of handling\u0000well-foundedness. We develop the translation system textit{Trans}, which given a verification\u0000problem consisting of a program $P$ and a specification $phi$, builds a set of\u0000EHCs which is satisfiable iff $P$ satisfies $phi$. We also develop a synthesis\u0000algorithm that given a program with holes in conditions and assignments, fills\u0000the holes so that the synthesized program satisfies the given $CTL^*$\u0000specification. We prove that our verification and synthesis algorithms are both sound and\u0000relative complete. Finally, we present case studies to demonstrate the\u0000applicability of our algorithms for $CTL^*$ verification and synthesis.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192459","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

Hologram Reasoning for Solving Algebra Problems with Geometry Diagrams 用几何图解解决代数问题的全息图推理法

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-20 DOI: arxiv-2408.10592

Litian Huang, Xinguo Yu, Feng Xiong, Bin He, Shengbing Tang, Jiawen Fu

{"title":"Hologram Reasoning for Solving Algebra Problems with Geometry Diagrams","authors":"Litian Huang, Xinguo Yu, Feng Xiong, Bin He, Shengbing Tang, Jiawen Fu","doi":"arxiv-2408.10592","DOIUrl":"https://doi.org/arxiv-2408.10592","url":null,"abstract":"Solving Algebra Problems with Geometry Diagrams (APGDs) is still a\u0000challenging problem because diagram processing is not studied as intensively as\u0000language processing. To work against this challenge, this paper proposes a\u0000hologram reasoning scheme and develops a high-performance method for solving\u0000APGDs by using this scheme. To reach this goal, it first defines a hologram,\u0000being a kind of graph, and proposes a hologram generator to convert a given\u0000APGD into a hologram, which represents the entire information of APGD and the\u0000relations for solving the problem can be acquired from it by a uniform way.\u0000Then HGR, a hologram reasoning method employs a pool of prepared graph models\u0000to derive algebraic equations, which is consistent with the geometric theorems.\u0000This method is able to be updated by adding new graph models into the pool.\u0000Lastly, it employs deep reinforcement learning to enhance the efficiency of\u0000model selection from the pool. The entire HGR not only ensures high solution\u0000accuracy with fewer reasoning steps but also significantly enhances the\u0000interpretability of the solution process by providing descriptions of all\u0000reasoning steps. Experimental results demonstrate the effectiveness of HGR in\u0000improving both accuracy and interpretability in solving APGDs.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192464","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

Rejection in Abstract Argumentation: Harder Than Acceptance? 抽象论证中的拒绝：比接受更难？

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-20 DOI: arxiv-2408.10683

Johannes K. Fichte, Markus Hecher, Yasir Mahmood, Arne Meier

引用次数: 0

Variations on distributed belief 分布式信仰的变体

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-20 DOI: arxiv-2408.10637

John Lindqvist, Fernando R. Velázquez-Quesada, Thomas Ågotnes

引用次数: 0

Learning Brave Assumption-Based Argumentation Frameworks via ASP 通过 ASP 学习基于假设的勇敢论证框架

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-19 DOI: arxiv-2408.10126

Emanuele De AngelisCNR-IASI, Rome, Italy, Maurizio ProiettiCNR-IASI, Rome, Italy, Francesca ToniImperial, London, UK

引用次数: 0

Query languages for neural networks 神经网络查询语言

arXiv - CS - Logic in Computer Science Pub Date : 2024-08-19 DOI: arxiv-2408.10362

Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche

{"title":"Query languages for neural networks","authors":"Martin Grohe, Christoph Standke, Juno Steegmans, Jan Van den Bussche","doi":"arxiv-2408.10362","DOIUrl":"https://doi.org/arxiv-2408.10362","url":null,"abstract":"We lay the foundations for a database-inspired approach to interpreting and\u0000understanding neural network models by querying them using declarative\u0000languages. Towards this end we study different query languages, based on\u0000first-order logic, that mainly differ in their access to the neural network\u0000model. First-order logic over the reals naturally yields a language which views\u0000the network as a black box; only the input--output function defined by the\u0000network can be queried. This is essentially the approach of constraint query\u0000languages. On the other hand, a white-box language can be obtained by viewing\u0000the network as a weighted graph, and extending first-order logic with summation\u0000over weight terms. The latter approach is essentially an abstraction of SQL. In\u0000general, the two approaches are incomparable in expressive power, as we will\u0000show. Under natural circumstances, however, the white-box approach can subsume\u0000the black-box approach; this is our main result. We prove the result concretely\u0000for linear constraint queries over real functions definable by feedforward\u0000neural networks with a fixed number of hidden layers and piecewise linear\u0000activation functions.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"131 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142192465","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