检索结果-内蒙古大学图书馆

16th European Parallel-Virtual-Machine-and-Message-Passing-Interface-Users-Group Meeting (PVM/MPI)

作者： Schneidenbach, Lars Schnor, Bettina Gebser, Martin Kaminski, Roland Kaufmann, Benjamin Schaub, Torsten IBM Ireland Dublin Software Lab Dublin 15 Ireland Univ Potsdam Inst Informat D-14482 Potsdam Germany

ISBN: (纸本)9783642037696

This paper presents the concept of parallelisation of a solver for answer set programming (ASP). While there already exist some approaches to parallel ASP solving, there was a lack of a parallel version of the powerful clasp solver. We implemented a parallel version of clasp based on message-passing. Experimental results on Blue Gene P/L indicate the potential of such an approach.

关键词： Applications based on Message-Passing answer set programming Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Teaching Commonsense and Dynamic Knowledge to Service Robots 11th

Teaching Commonsense and Dynamic Knowledge to Service Robots

引用

11th International Conference on Social Robotics (ICSR)

作者： Opfer, Stephan Jakob, Stefan Geihs, Kurt Univ Kassel Wilhelmshoher Allee 73 D-34121 Kassel Germany

ISBN: (纸本)9783030358884;9783030358877

Incorporating commonsense and coping with dynamic knowledge are key capabilities of service robots to efficiently interact with humans. In the presented system, we demonstrate how to equip service robots with commonsense knowledge and the dynamic reasoning capabilities of answer set programming (ASP). We investigated the response of our system to basic human needs and evaluated the viability and scalability of the combination of the commonsense knowledge database ConceptNet 5 and the ASP solver Clingo. Our results show the flexibility and versatility of our approach. Further, we identified the need for research on scalability in case of environments that are abundant with objects.

关键词： Commonsense reasoning Dynamic knowledge answer set programming Service robots Cognitive Robotics Human-robot interaction

来源：评论

学校读者我要写书评

暂无评论

The Role of Foundation Models in Neuro-Symbolic Learning and Reasoning 18th

The Role of Foundation Models in Neuro-Symbolic Learning and...

引用

18th International Conference on Neural-Symbolic Learning and Reasoning (NeSy)

作者： Cunnington, Daniel Law, Mark Lobo, Jorge Russo, Alessandra Durable Ai Louisville CO 80027 USA Imperial Coll London London England ILASP Ltd Grantham England Univ Pompeu Fabra Barcelona Spain IBM Res Yorktown Hts NY USA

ISBN: (纸本)9783031711664;9783031711671

Neuro-Symbolic AI (NeSy) holds promise to ensure the safe deployment of AI systems, as interpretable symbolic techniques provide formal behaviour guarantees. The challenge is how to effectively integrate neural and symbolic computation, to enable learning and reasoning from raw data. Existing pipelines that train the neural and symbolic components sequentially require extensive labelling, whereas end-to-end approaches are limited in terms of scalability, due to the combinatorial explosion in the symbol grounding problem. In this paper, we leverage the implicit knowledge within foundation models to enhance the performance in NeSy tasks, whilst reducing the amount of data labelling and manual engineering. We introduce a new architecture, called NeSyGPT, which fine-tunes a vision-language foundation model to extract symbolic features from raw data, before learning a highly expressive answer set program to solve a downstream task. Our comprehensive evaluation demonstrates that NeSyGPT has superior accuracy over various baselines, and can scale to complex NeSy tasks. Finally, we highlight the effective use of a large language model to generate the programmatic interface between the neural and symbolic components, significantly reducing the amount of manual engineering required. The Appendix is presented in the longer version of this paper, which contains additional results and analysis [8].

关键词： Neuro-Symbolic Learning Foundation Models answer set programming

来源：评论

学校读者我要写书评

暂无评论

DeduDeep: An Extensible Framework for Combining Deep Learning and ASP-Based Models 16th

DeduDeep: An Extensible Framework for Combining Deep Learnin...

引用

16th International Conference on Logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Bruno, Pierangela Calimeri, Francesco Marte, Cinzia Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783031157073;9783031157066

In the last decades, Deep Learning (DL)-based approaches have been fruitfully employed in many tasks, such as providing valuable support to computer-aided diagnosis and medicine. However, DL-based approaches are known to suffer from some limitations;for instance, they lack of proper means for providing clear explanations and interpretations of the results, or explicitly including available knowledge to drive decisions. In this work, we present DeduDeep, the prototypical implementation of a framework explicitly conceived with the aim of tackling such limitations by making use of deductive declarative formalisms. In particular, the framework aims at enabling the declarative encoding of explicit knowledge, and, by relying on the use of answer set programming (ASP), taking advantage of it for driving decisions taken by neural networks and refining the output. The framework has been tested using different artificial neural networks tailored to semantic segmentation tasks over Laryngeal Endoscopic Images and Freiburg Sitting People Images.

关键词： answer set programming Knowledge Representation and Reasoning Non-monotonic reasoning Deep Learning Semantic Segmentation Inductive-deductive coupling

来源：评论

学校读者我要写书评

暂无评论

Weighted knowledge bases with typicality and defeasible reasoning in a gradual argumentation semantics

引用

INTELLIGENZA ARTIFICIALE 2024年第1期18卷 153-174页

作者： Alviano, Mario Giordano, Laura Dupre, Daniele Theseider Univ Calabria Dipartimento Matemat & Informat DEMACS Arcavacata Di Rende Italy Univ Piemonte Orientale Dipartimento Sci & Innovaz Tecnolog DISIT Viale Michel 11 I-15121 Alessandria Italy

. Weighted knowledge bases for description logics with typicality provide a logical interpretation of MultiLayer Perceptrons, based on a "concept-wise" multi-preferential semantics. On the one hand, in the finitely many-valued case, answer set programming (ASP) has been shown to be suitable for addressing defeasible reasoning from weighted knowledge bases for the boolean fragment of ALC. . On the other hand, the semantics of weighted knowledge bases with typicality, in their different variants, have suggested some new gradual argumentation semantics, as well as an approach for defeasible reasoning over a weighted argumentation graph, building on the gradual semantics and, specifically on the (p-coherent semantics. In this paper, we explore the relationships between weighted knowledge bases and weighted argumentation graphs, to develop proof methods for defeasible reasoning over an argumentation graph under the (p-coherent semantics, in the finitely-valued case. We establish a mapping from a weighted argumentation graph to a weighted knowledge base as well as a lower bound on the complexity of the problem of verifying graded implications over an argumentation graph in the (p-coherent semantics. We also consider a mapping from weighted knowledge bases to weighted argumentation graphs, and provide an ASP implementation and some experimental results.

关键词： Preferential semantics description logic many-valued logic answer set programming gradual argumentation

来源：评论

学校读者我要写书评

暂无评论

Reasoning for Autonomous Agents in Dynamic Domains: Towards Automatic Satisfaction of the Module Property 1

引用

9th International Conference on Agents and Artificial Intelligence (ICAART)

作者： Opfer, Stephan Jakob, Stefan Geihs, Kurt Univ Kassel Distributed Syst Res Grp Wilhelmshoher Allee 73 Kassel Germany

ISBN: (数字)9783319935812

ISBN: (纸本)9783319935812;9783319935805

State-of-the-art service robots that fetch a cup of coffee and clean up rooms require cognitive skills such as learning, planning, and reasoning. Especially reasoning in dynamic and human populated environments demands for novel approaches that can handle comprehensive and fluent knowledge bases. Our long-term objective is an autonomous robotic team that is capable of handling dynamic and domestic environments. Therefore, we combined ALICA - A Language for Interactive Cooperative Agents - with the answer set programming solver Clingo. The answer set programming approach offers multi-shot solving techniques and non-monotonic stable model semantics, but requires to keep the Module Property satisfied. We developed an automatic satisfaction of the Module Property and chose topological path planning as our evaluation scenario. We utilised the Region Connection Calculus as the underlying formalism of our evaluation and investigated the scalability of our implementation. The results show that our approach handles dynamic environments and scales up to appropriately large problem sizes while automatically satisfying the Module Property.

关键词： answer set programming Region Connection Calculus Module Property Multi-shot solving

来源：评论

学校读者我要写书评

暂无评论

Semantic Inference for Pharmacokinetic Drug-Drug Interactions

Semantic Inference for Pharmacokinetic Drug-Drug Interaction...

引用

8th IEEE International Conference on Semantic Computing

作者： Moitra, Abha Palla, Ravi Tari, Luis Krishnamoorthy, Mukkai GE Global Res Knowledge Discovery Lab Niskayuna NY 12309 USA Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA

ISBN: (纸本)9781479940035

Drug-drug interaction (DDI) study is an important aspect of therapy management and drug efficacy. DDI study investigates how drugs interact with each other and determine whether these interactions may lead to dire effects or nullify the therapeutic effects of each other. In this paper we model metabolic pathways of drugs that include the reaction effects between drugs and the related enzymes. By modeling the reaction effects, our model captures the degree of the effects of the interacting drugs. We introduce a novel methodology that combines semantics, ontology to model the concepts and interactions, and answer set programming for temporal reasoning. We illustrate our method by inferring the effects of DDI among three drugs clozapine, olanzapine and fluvoxamine.

关键词： Drug-Drug Interactions Ontology Semantics Temporal Reasoning answer set programming

来源：评论

学校读者我要写书评

暂无评论

Results in Workflow Resiliency Complexity, New Formulation, and ASP Encoding 19

Results in Workflow Resiliency Complexity, New Formulation, ...

引用

9th ACM Conference on Data and Application Security and Privacy (CODASPY)

作者： Fong, Philip W. L. Univ Calgary Calgary AB Canada

ISBN: (纸本)9781450360999

First proposed by Wang and Li in 2007, workflow resiliency is a policy analysis for ensuring that, even when an adversarial environment removes a subset of workers from service, a workflow can still be instantiated to satisfy all the security constraints. Wang and Li proposed three notions of workflow resiliency: static, decremental, and dynamic resiliency. While decremental and dynamic resiliency are both PSPACE-complete, Wang and Li did not provide a matching lower and upper bound for the complexity of static resiliency. The present work begins with proving that static resiliency is Pi(p)(2)-complete, thereby bridging a long-standing complexity gap in the literature. In addition, a fourth notion of workflow resiliency, one-shot resiliency, is proposed and shown to remain in the third level of the polynomial hierarchy. This shows that sophisticated notions of workflow resiliency need not be PSPACE-complete. Lastly, we demonstrate how to reduce static and one-shot resiliency to answer set programming (ASP), a modern constraint-solving technology that can be used for solving reasoning tasks in the lower levels of the polynomial hierarchy. In summary, this work demonstrates the value of focusing on notions of workflow resiliency that reside in the lower levels of the polynomial hierarchy.

关键词： Availability Workflow authorization model Workflow resiliency Static resiliency One-shot resiliency answer set programming

来源：评论

学校读者我要写书评

暂无评论

LACE: A Logical Approach to Collective Entity Resolution 22

LACE: A Logical Approach to Collective Entity Resolution

引用

41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems (PODS)

作者： Bienvenu, Meghyn Cima, Gianluca Gutierrez-Basulto, Victor Univ Bordeaux CNRS Bordeaux INP LaBRIUMR 5800 Talence France Cardiff Univ Sch Comp Sci & Informat Cardiff Wales

ISBN: (纸本)9781450392600

In this paper, we revisit the problem of entity resolution and propose a novel, logical framework, LACE, which mixes declarative and procedural elements to achieve a number of desirable properties. Our approach is fundamentally declarative in nature: it utilizes hard and soft rules to specify conditions under which pairs of entity references must or may be merged, together with denial constraints that enforce consistency of the resulting instance. Importantly, however, rule bodies are evaluated on the instance resulting from applying the already `derived' merges. It is the dynamic nature of our semantics that enables us to capture collective entity resolution scenarios, where merges can trigger further merges, while at the same time ensuring that every merge can be justified. As the denial constraints restrict which merges can be performed together, we obtain a space of (maximal) solutions, from which we can naturally define notions of certain and possible merges and query answers. We explore the computational properties of our framework and determine the precise computational complexity of the relevant decision problems. Furthermore, as a first step towards implementing our approach, we demonstrate how we can encode the various reasoning tasks using answer set programming.

关键词： Collective Entity Resolution Declarative Framework Logical Constraints Complexity Analysis answer set programming

来源：评论

学校读者我要写书评

暂无评论

Vicious Circle Principle and Logic Programs with Aggregates

Vicious Circle Principle and Logic Programs with Aggregates

引用

30th International Conference on Logic programming

作者： Gelfond, Michael Zhang, Yuanlin Texas Tech Univ Lubbock TX 79414 USA

The paper presents a knowledge representation language Alog which extends ASP with aggregates. The goal is to have a language based on simple syntax and clear intuitive and mathematical semantics. We give some propert... 详细信息

关键词： Aggregates answer set programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：