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

arXiv - CS - Logic in Computer Science最新文献

筛选
英文 中文
Mapping the Provenance Ontology to Basic Formal Ontology 将出处本体映射到基本形式本体
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-02 DOI: arxiv-2408.03866
Tim PrudhommeKarl, Giacomo De ColleKarl, Austin LiebersKarl, Alec SculleyKarl, PeihongKarl, Xie, Sydney Cohen, John Beverley
{"title":"Mapping the Provenance Ontology to Basic Formal Ontology","authors":"Tim PrudhommeKarl, Giacomo De ColleKarl, Austin LiebersKarl, Alec SculleyKarl, PeihongKarl, Xie, Sydney Cohen, John Beverley","doi":"arxiv-2408.03866","DOIUrl":"https://doi.org/arxiv-2408.03866","url":null,"abstract":"The Provenance Ontology (PROV-O) is a World Wide Web Consortium (W3C)\u0000recommended ontology used to structure data about provenance across a wide\u0000variety of domains. Basic Formal Ontology (BFO) is a top-level ontology ISO/IEC\u0000standard used to structure a wide variety of ontologies, such as the OBO\u0000Foundry ontologies and the Common Core Ontologies (CCO). To enhance\u0000interoperability between these two ontologies, their extensions, and data\u0000organized by them, an alignment is presented according to a specific mapping\u0000criteria and methodology which prioritizes structural and semantic\u0000considerations. The ontology alignment is evaluated by checking its logical\u0000consistency with canonical examples of PROV-O instances and querying terms that\u0000do not satisfy the mapping criteria as formalized in SPARQL. A variety of\u0000semantic web technologies are used in support of FAIR (Findable, Accessible,\u0000Interoperable, Reusable) principles.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"109 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934542","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
CHTW-systems with resource-depended parameters. CHTW(R)-systems 参数取决于资源的 CHTW 系统。CHTW(R) 系统
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-02 DOI: arxiv-2408.01245
Alexander Yu. Chunikhin
{"title":"CHTW-systems with resource-depended parameters. CHTW(R)-systems","authors":"Alexander Yu. Chunikhin","doi":"arxiv-2408.01245","DOIUrl":"https://doi.org/arxiv-2408.01245","url":null,"abstract":"In [1] the concept of CHTW-systems as a multidimensional representation of\u0000Petri nets was proposed based on the assumption of multidimensional\u0000distribution of tokens (resources) in positions (branes) and, accordingly,\u0000multidimensional representation of transitions and arcs. The extension of Petri\u0000nets was developed under the assumption of the stationarity of CHTW-system,\u0000when its parameters are constant during the system operation. We consider the\u0000case when the main parameters of CHTW-system (threshold functions and rate\u0000functions) change in accordance with the values of the mark-functions\u0000(multidimensional resource) of some container branes of the same CHTW-system.\u0000The modification of the basic CHTW-system was designated as a CHTW(R) system,\u0000in which (R) means a Resource control of the system parameters.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"77 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934539","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 SAT-based approach to rigorous verification of Bayesian networks 基于 SAT 的贝叶斯网络严格验证方法
arXiv - CS - Logic in Computer Science Pub Date : 2024-08-02 DOI: arxiv-2408.00986
Ignacy Stępka, Nicholas Gisolfi, Artur Dubrawski
{"title":"A SAT-based approach to rigorous verification of Bayesian networks","authors":"Ignacy Stępka, Nicholas Gisolfi, Artur Dubrawski","doi":"arxiv-2408.00986","DOIUrl":"https://doi.org/arxiv-2408.00986","url":null,"abstract":"Recent advancements in machine learning have accelerated its widespread\u0000adoption across various real-world applications. However, in safety-critical\u0000domains, the deployment of machine learning models is riddled with challenges\u0000due to their complexity, lack of interpretability, and absence of formal\u0000guarantees regarding their behavior. In this paper, we introduce a verification\u0000framework tailored for Bayesian networks, designed to address these drawbacks.\u0000Our framework comprises two key components: (1) a two-step compilation and\u0000encoding scheme that translates Bayesian networks into Boolean logic literals,\u0000and (2) formal verification queries that leverage these literals to verify\u0000various properties encoded as constraints. Specifically, we introduce two\u0000verification queries: if-then rules (ITR) and feature monotonicity (FMO). We\u0000benchmark the efficiency of our verification scheme and demonstrate its\u0000practical utility in real-world scenarios.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"108 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141934387","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
Operator-based semantics for choice programs: is choosing losing? (full version) 基于操作符的选择程序语义：选择会输吗？(完整版）
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-31 DOI: arxiv-2407.21556
Jesse Heyninck
{"title":"Operator-based semantics for choice programs: is choosing losing? (full version)","authors":"Jesse Heyninck","doi":"arxiv-2407.21556","DOIUrl":"https://doi.org/arxiv-2407.21556","url":null,"abstract":"Choice constructs are an important part of the language of logic programming,\u0000yet the study of their semantics has been a challenging task. So far, only\u0000two-valued semantics have been studied, and the different proposals for such\u0000semantics have not been compared in a principled way. In this paper, an\u0000operator-based framework allow for the definition and comparison of different\u0000semantics in a principled way is proposed.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865890","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
Formal Ethical Obligations in Reinforcement Learning Agents: Verification and Policy Updates 强化学习代理中的正式道德义务：验证和政策更新
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-31 DOI: arxiv-2408.00147
Colin Shea-Blymyer, Houssam Abbas
{"title":"Formal Ethical Obligations in Reinforcement Learning Agents: Verification and Policy Updates","authors":"Colin Shea-Blymyer, Houssam Abbas","doi":"arxiv-2408.00147","DOIUrl":"https://doi.org/arxiv-2408.00147","url":null,"abstract":"When designing agents for operation in uncertain environments, designers need\u0000tools to automatically reason about what agents ought to do, how that conflicts\u0000with what is actually happening, and how a policy might be modified to remove\u0000the conflict. These obligations include ethical and social obligations,\u0000permissions and prohibitions, which constrain how the agent achieves its\u0000mission and executes its policy. We propose a new deontic logic, Expected Act\u0000Utilitarian deontic logic, for enabling this reasoning at design time: for\u0000specifying and verifying the agent's strategic obligations, then modifying its\u0000policy from a reference policy to meet those obligations. Unlike approaches\u0000that work at the reward level, working at the logical level increases the\u0000transparency of the trade-offs. We introduce two algorithms: one for\u0000model-checking whether an RL agent has the right strategic obligations, and one\u0000for modifying a reference decision policy to make it meet obligations expressed\u0000in our logic. We illustrate our algorithms on DAC-MDPs which accurately\u0000abstract neural decision policies, and on toy gridworld environments.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"75 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141886792","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
An SMT-LIB Theory of Finite Fields 有限域的 SMT-LIB 理论
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-30 DOI: arxiv-2407.21169
Thomas Hader, Alex Ozdemir
{"title":"An SMT-LIB Theory of Finite Fields","authors":"Thomas Hader, Alex Ozdemir","doi":"arxiv-2407.21169","DOIUrl":"https://doi.org/arxiv-2407.21169","url":null,"abstract":"In the last few years there have been rapid developments in SMT solving for\u0000finite fields. These include new decision procedures, new implementations of\u0000SMT theory solvers, and new software verifiers that rely on SMT solving for\u0000finite fields. To support interoperability in this emerging ecosystem, we\u0000propose the SMT-LIB theory of finite field arithmetic (FFA). The theory defines\u0000a canonical representation of finite field elements as well as definitions of\u0000operations and predicates on finite field elements.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"70 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865888","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
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures 在多核架构上对 seL4 的高效锁进行实际依赖/保证验证
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-30 DOI: arxiv-2407.20559
Robert J. Colvin, Ian J. Hayes, Scott Heiner, Peter Höfner, Larissa Meinicke, Roger C. Su
{"title":"Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures","authors":"Robert J. Colvin, Ian J. Hayes, Scott Heiner, Peter Höfner, Larissa Meinicke, Roger C. Su","doi":"arxiv-2407.20559","DOIUrl":"https://doi.org/arxiv-2407.20559","url":null,"abstract":"Developers of low-level systems code providing core functionality for\u0000operating systems and kernels must address hardware-level features of modern\u0000multicore architectures. A particular feature is pipelined \"out-of-order\u0000execution\" of the code as written, the effects of which are typically\u0000summarised as a \"weak memory model\" - a term which includes further\u0000complicating factors that may be introduced by compiler optimisations. In many\u0000cases, the nondeterminism inherent in weak memory models can be expressed as\u0000micro-parallelism, i.e., parallelism within threads and not just between them.\u0000Fortunately Jones' rely/guarantee reasoning provides a compositional method for\u0000shared-variable concurrency, whether that be in terms of communication between\u0000top-level threads or micro-parallelism within threads. In this paper we provide\u0000an in-depth verification of the lock algorithm used in the seL4 microkernel,\u0000using rely/guarantee to handle both interthread communication as well as\u0000micro-parallelism introduced by weak memory models.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"32 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865891","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
Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases 基于成本的语义查询不一致加权知识库
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-30 DOI: arxiv-2407.20754
Meghyn Bienvenu, Camille Bourgaux, Robin Jean
{"title":"Cost-Based Semantics for Querying Inconsistent Weighted Knowledge Bases","authors":"Meghyn Bienvenu, Camille Bourgaux, Robin Jean","doi":"arxiv-2407.20754","DOIUrl":"https://doi.org/arxiv-2407.20754","url":null,"abstract":"In this paper, we explore a quantitative approach to querying inconsistent\u0000description logic knowledge bases. We consider weighted knowledge bases in\u0000which both axioms and assertions have (possibly infinite) weights, which are\u0000used to assign a cost to each interpretation based upon the axioms and\u0000assertions it violates. Two notions of certain and possible answer are defined\u0000by either considering interpretations whose cost does not exceed a given bound\u0000or restricting attention to optimal-cost interpretations. Our main contribution\u0000is a comprehensive analysis of the combined and data complexity of bounded cost\u0000satisfiability and certain and possible answer recognition, for description\u0000logics between ELbot and ALCO.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865889","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
Query maintenance under batch changes with small-depth circuits 小深度电路批量更改下的查询维护
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-29 DOI: arxiv-2407.20031
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
{"title":"Query maintenance under batch changes with small-depth circuits","authors":"Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume","doi":"arxiv-2407.20031","DOIUrl":"https://doi.org/arxiv-2407.20031","url":null,"abstract":"Which dynamic queries can be maintained efficiently? For constant-size\u0000changes, it is known that constant-depth circuits or, equivalently, first-order\u0000updates suffice for maintaining many important queries, among them\u0000reachability, tree isomorphism, and the word problem for context-free\u0000languages. In other words, these queries are in the dynamic complexity class\u0000DynFO. We show that most of the existing results for constant-size changes can\u0000be recovered for batch changes of polylogarithmic size if one allows circuits\u0000of depth O(log log n) or, equivalently, first-order updates that are iterated\u0000O(log log n) times.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"74 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865896","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 Construction of the Lie Algebra of a Lie Group in Isabelle/HOL 用 Isabelle/HOL 构建 Lie 群的 Lie 代数
arXiv - CS - Logic in Computer Science Pub Date : 2024-07-27 DOI: arxiv-2407.19211
Richard Schmoetten, Jacques D. Fleuriot
{"title":"A Construction of the Lie Algebra of a Lie Group in Isabelle/HOL","authors":"Richard Schmoetten, Jacques D. Fleuriot","doi":"arxiv-2407.19211","DOIUrl":"https://doi.org/arxiv-2407.19211","url":null,"abstract":"This paper describes a formal theory of smooth vector fields, Lie groups and\u0000the Lie algebra of a Lie group in the theorem prover Isabelle. Lie groups are\u0000abstract structures that are composable, invertible and differentiable. They\u0000are pervasive as models of continuous transformations and symmetries in areas\u0000from theoretical particle physics, where they underpin gauge theories such as\u0000the Standard Model, to the study of differential equations and robotics.\u0000Formalisation of mathematics in an interactive theorem prover, such as\u0000Isabelle, provides strong correctness guarantees by expressing definitions and\u0000theorems in a logic that can be checked by a computer. Many libraries of\u0000formalised mathematics lack significant development of textbook material beyond\u0000undergraduate level, and this contribution to mathematics in Isabelle aims to\u0000reduce that gap, particularly in differential geometry. We comment on\u0000representational choices and challenges faced when integrating complex\u0000formalisations, such as smoothness of vector fields, with the restrictions of\u0000the simple type theory of HOL. This contribution paves the way for extensions\u0000both in advanced mathematics, and in formalisations in natural science.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"45 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141865735","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
首页 上一页 下一页 尾页
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学术官方微信