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

arXiv 2019年

作者： Erdem, Esra Formisano, Andrea Vidal, Germán Yang, Fangkai Sabanci University Turkey Università di Perugia Italy MiST VRAIN Universitat Politècnica de València Spain NVIDIA Corporation United States

this volume contains the Regular Papers, Technical Communications and the Doctoral Consortium papers of the 35th international conference on logic programming (iclp 2019), held in Las Cruces, New Mexico, USA, from September 20–25, 2019. Since the first conference held in Marseille in 1982, iclp has been the premier international event for presenting research in logic programming. Contributions are sought in all areas of logic programming, including but not restricted to: Copyright © 2019, the Authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Revisiting Immediate Consequences Operator on First-Order logic programming 20th

Revisiting Immediate Consequences Operator on First-Order L...

引用

20th international conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, IPMU 2024

作者： Medina, Jesús Torné-Zambrano, José Antonio Department of Mathematics University of Cádiz Cádiz Spain

ISBN: (纸本)9783031739996

logic programming is a fundamental paradigm based on formal logic with relevant features in the design of automatic intelligence systems. the computation of the consequences from a given dataset, modeled by logic rules, is given by the immediate consequences operator. this paper clarifies the definition of this operator in the first-order logic programming framework and remarks the consideration of two sets in the computation of the immediate consequences operator. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Multi-Agent Path Planning for Finite Horizon Tasks with Counting Time Temporal logics

Multi-Agent Path Planning for Finite Horizon Tasks with Coun...

引用

IEEE international conference on Automation Science and Engineering (CASE)

作者： Peng Lv Shaoyuan Li Xiang Yin Department of Automation and Key Laboratory of System Control and Information Processing Shanghai Jiao Tong University Shanghai China

ISBN: (数字)9798350358513

ISBN: (纸本)9798350358520

In this paper, we consider the multi-agent path planning problem for high-level tasks with finite horizons. In many situations, there is the need to count how many times a sub-task is satisfied in order to achieve the overall task. However, existing temporal logic languages, such as linear temporal logic, may not be efficient in describing such requirements. To address this issue, we propose a new temporal logic language called Counting Time Temporal logic (CTTL) that extends linear temporal logic by explicitly counting the number of times that some tasks are satisfied. To solve the CTTL path planning problem, we use integer linear programming to encode the satisfaction of the task. We demonstrate that our approach is both sound and complete. To validate our results, we present numerical experiments to show the scalability of the proposed approach. Furthermore, we provide a simulation case study of a team of autonomous robots to illustrate the synthesis procedure.

关键词： Computer aided software engineering Automation Scalability Integer linear programming Path planning Planning Delays logic Standards Autonomous robots

来源：评论

学校读者我要写书评

暂无评论

Design of Multi-channel Pulse Signal Generator with Adjustable Time Sequence*

Design of Multi-channel Pulse Signal Generator with Adjustab...

引用

Pulsed Power conference, international conference on High-Power Particle Beams and international Symposium on Electromagnetic Launch Technology (EAPPC/BEAMS/EML), Euro-Asian

作者： Weiwei Pan Hengyu Lv Kun Liu Rongyao Fu Wanyu Liu Yuxiang Huo Yaohong Sun Institute of Electrical Engineering Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of High Density Electromagnetic Power and Systems(Chinese Academy of Sciences) Institute of Electrical Engineering Chinese Academy of Sciences Beijing China

ISBN: (数字)9789038661353

ISBN: (纸本)9798350352733

the development of electromagnetic launch technology imposes higher requirements on the discharge control of Pulse Forming Networks (PFN). this paper introduces a multi-channel time sequence pulse signal generating platform based on FPGA NiosII system. the user logic is designed by employing modular programming methodologies. Furthermore, the host computer software is developed utilizing the Qt Creator to facilitate comprehensive control over 30-channel output pulse signals. Within a short delay range, the adjustment step size of channel output time sequence can reach 20ns. To meet various discharge requirements, the signal generator is designed with the capability to store multiple sets of time sequence data. Upon receiving of a designated group number, it promptly calls the corresponding time sequence to generate trigger pulses, thereby swiftly modulating the output current waveform of the PFN. To verify the correctness of the FPGA logic program, SignalTap II logic Analyzer, an embedded logic analyzer of the Quartus platform, is used to logically judge the FPGA output signals. Additionally, a digital oscilloscope is employed for precise measurement of analog signals from FPGA pins. the experimental waveforms demonstrate that the FPGA logic program meets the design requirements. the connection between host computer and FPGA is established through serial communication for joint debugging and testing. In order to test the signal generator's adjustment functionality of time sequence, the host computer issues the group number. Test results substantiate that output pulse signals of the signal generator are accordant with the setting of the host computer, and the generator can update the output time sequence online based on the received group number. Applying this signal generator to PFN systems allows flexible adjustment of multi-module trigger time sequence according to discharge waveform requirements, which is beneficial for improving the discharge accuracy of PFN sys

关键词： Time-frequency analysis programming Signal generators Discharges (electric) Software Pins logic Electromagnetics Field programmable gate arrays Testing

来源：评论

学校读者我要写书评

暂无评论

How well do SOTA legal reasoning models support abductive reasoning? 39

How well do SOTA legal reasoning models support abductive re...

引用

39th international conference on logic programming Workshops, iclp Workshops 2023

作者： Nguyen, Ha thanh Goebel, Randy Toni, Francesca Stathis, Kostas Satoh, Ken 2-1-2 Hitotsubashi Chiyoda City Tokyo Japan University of Alberta 116 St & 85 Ave EdmontonABT6G 2R3 Canada Imperial College London Exhibition Rd South Kensington LondonSW7 2BX United Kingdom Royal Holloway University of London Egham Hill EghamTW20 0EX United Kingdom

We examine how well the state-of-the-art (SOTA) models used in legal reasoning support abductive reasoning tasks. Abductive reasoning is a form of logical inference in which a hypothesis is formulated from a set of observations, and that hypothesis is used to explain the observations. the ability to formulate such hypotheses is important for lawyers and legal scholars as it helps them articulate logical arguments, interpret laws, and develop legal theories. Our motivation is to consider the belief that deep learning models, especially large language models (LLMs), will soon replace lawyers because they perform well on tasks related to legal text processing. But to do so, we believe, requires some form of abductive hypothesis formation. In other words, while LLMs become more popular and powerful, we want to investigate their capacity for abductive reasoning. To pursue this goal, we start by building a logic-augmented dataset for abductive reasoning with 498,697 samples and then use it to evaluate the performance of a SOTA model in the legal field. Our experimental results show that although these models can perform well on tasks related to some aspects of legal text processing, they still fall short in supporting abductive reasoning tasks. 2023 Copyright for this paper by its authors.

关键词： Text processing

来源：评论

学校读者我要写书评

暂无评论

Prioritize Team Actions: Multi-Agent Temporal logic Task Planning with Ordering Constraints

Prioritize Team Actions: Multi-Agent Temporal Logic Task Pla...

引用

IEEE international conference on Automation Science and Engineering (CASE)

作者： Bowen Ye Jianing Zhao Shaoyuan Li Xiang Yin Department of Automation Shanghai Jiao Tong University and the Key Laboratory of System Control and Information Processing the Ministry of Education of China Shanghai China

ISBN: (数字)9798350358513

ISBN: (纸本)9798350358520

In this paper, we investigate the problem of linear temporal logic (LTL) path planning for multi-agent systems, introducing the new concept of ordering constraints. Specifically, we consider a generic objective function that is defined for the path of each individual agent. the primary objective is to find a global plan for the team of agents, ensuring they collectively meet the specified LTL requirements. Simultaneously, we aim to maintain a pre-determined order in the values of the objective function for each agent, which we refer to as the ordering constraints. this new requirement stems from scenarios like security-aware planning, where relative orders outweigh absolute values in importance. We present an efficient algorithm to solve this problem, supported by proofs of correctness that demonstrate the optimality of our solution. Additionally, we provide a case study in security-aware path planning to illustrate the practicality and effectiveness of our proposed approach.

关键词： Uncertainty Computer aided software engineering Automation Information security Linear programming Path planning Planning logic Multi-agent systems

来源：评论

学校读者我要写书评

暂无评论

Abstract Simulation of Reaction Networks via Boolean Networks 20th

Abstract Simulation of Reaction Networks via Boolean Network...

引用

20th international conference on Computational Methods in Systems Biology (CMSB)

作者： Niehren, Joachim Vaginay, Athenais Versari, Cristian Univ Lille BioComp Team CRIStAL Lab Lille France Inria Lille Lille France Univ Lorraine CNRS CRAN F-54000 Nancy France Univ Lorraine CNRS INRIA LORIA F-54000 Nancy France

ISBN: (纸本)9783031150333;9783031150340

We propose to simulate chemical reaction networks with the deterministic semantics abstractly, without any precise knowledge on the initial concentrations. For this, the concentrations of species are abstracted to Booleans stating whether the species is present or absent, and the derivatives of the concentrations are abstracted to signs saying whether the concentration is increasing, decreasing, or unchanged. We use abstract interpretation over the structure of signs for mapping the ODEs of a reaction network to a Boolean network with nondeterministic updates. the abstract state transition graph of such Boolean networks can be computed by finite domain constraint programming over the finite structure of signs. Constraints on the abstraction of the initial concentrations can be added naturally, leading to an abstract simulation algorithm that produces only the part of the abstract state transition graph that is reachable from the abstraction of the initial state. We prove the soundness of our abstract simulation algorithm, and show its applicability to reaction networks in the SBML format from the BioModels database.

关键词： Systems Biology Reaction networks SBML Boolean networks Abstract interpretation logic Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Learning Chinese as a Second Language by Educational Robots Integrating the Operation of Conditional logic in Computational thinking and the Usage of the Causal Sentences 20

Learning Chinese as a Second Language by Educational Robots ...

引用

20th IEEE international conference on Advanced Learning Technologies (ICALT)

作者： Hsu, Ting-Chia Wong, Lung-Hsiang Aw, Guat Poh Natl Taiwan Normal Univ Dept Technol Applicat & Human Resource Dev Taipei Taiwan Nanyang Technol Univ Natl Inst Educ Singapore Singapore

ISBN: (数字)9781728160900

ISBN: (纸本)9781728160900

this study attempted to carry out interdisciplinary learning activities which integrate computational thinking into language learning. the participants were 56 5th-grade Chinese as a Second Language (CSL) students in Singapore. the students were required to learn the ability to apply conditional complex sentences in Chinese language and learn the conditional structural logic through coding educational robots to interact with each other in Chinese. the results showed that the students improved significantly in the linguistic knowledge. Furthermore, the computer programming self-efficacy of the students has also promoted significantly in terms of logical thinking, control and debugging. the students had also shown a high level of learning engagement, low anxiety and a high intention in the robot coding activity. this study presented the empirical results of this cross-domain integration of educational robots and language learning, providing a reference and teaching practices for future teachers.

关键词： Chinese as a Second Language Computational thinking Educational Robots Computer programming Self-Efficacy

来源：评论

学校读者我要写书评

暂无评论

Research on Elastic Extension of Multi Type Resources for OpenMP Program

Research on Elastic Extension of Multi Type Resources for Op...

引用

IEEE international conference on High Performance Computing and Communications (HPCC)

作者： Junfeng Zhao Xuesong Gao Yuancong Li College of Computer Science Inner Mongolia University Hohhot China

OpenMP is one of the most popular programming models in the field of parallel computing, which is widely used in multi-threaded programming with shared memory. But with the continuous change of program computing scale, the problem of resource supply has become increasingly prominent. Making use of the cloud computing to dynamically provide resources for OpenMP program is a meaningful work. Based on the internal structure characteristics of OpenMP program, a flexible elastic resource allocation strategy is designed, and a load prediction method combining active and reactive prediction based on machine learning is proposed to realize the load prediction of OpenMP program. then, the fuzzy controller is used to coordinate the resources and infer the CPU and memory resources needed by the program in the next cycle. On this basis, the middleware OPEC is designed and implemented to realize the dynamic allocation of cloud resources during the operation of OpenMP program. Parsec, a benchmark test suite based on shared memory, is selected for experimental verification. the experimental results show that the solution proposed in this paper can dynamically provide a variety of resources for OpenMP program to meet program running requirements, effectively improve resource utilization efficiency and reduce program running costs.

关键词： Fuzzy logic Cloud computing Fuzzy control Machine learning Prediction methods programming Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Incremental Answer Set programming with Overgrounding

引用

thEORY AND PRACTICE OF logic programming 2019年第5-6期19卷 957-973页

作者： Calimeri, Francesco Ianni, Giovambattista Pacenza, Francesco Perri, Simona Zangari, Jessica Univ Calabria Dept Math & Comp Sci Commenda Di Rende Italy

Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding approach for the answer set semantics. We focus on the possibility of generating incrementally larger ground logic programs equivalent to a given non-ground one;so called overgrounded programs can be reused in combination with deliberately many different sets of inputs. Updating overgrounded programs requires a small effort, thus making the instantiation of logic programs considerably faster when grounding is repeated on a series of inputs similar to each other. Notably, the proposed approach works "under the hood", relieving designers of logic programs from controlling technical aspects of grounding engines and answer set systems. In this work we present the theoretical basis of the proposed incremental grounding technique, we illustrate the consequent repeated evaluation strategy and report about our experiments.

关键词： Knowledge Representation Answer Set programming Stream Reasoning Grounding Instantiation of logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：