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

17th international conference on Logic Programming and Non-monotonic Reasoning

作者： Bistarelli, Stefano Chiara, Maria M. Taticchi, Carlo Univ Perugia Perugia Italy Univ G dAnnunzio Chieti Italy

ISBN: (纸本)9783031742088;9783031742095

In the fast-growing area of Artificial Intelligence (AI), the ability of autonomous agents to engage in complex debates is crucial for consensus building on beliefs, actions, or goals and forms the basis for applications in decision-making, planning, opinion polling, and negotiation. In this paper, we leverage the Timed Concurrent language for Argumentation, a modelling language derived from concurrent programming paradigms and Argumentation theory, to introduce well-known high-level propositions (claim, counter, why, argue, concede, and retract) to model various debate forms, making it a powerful tool for agent interaction. the obtained constructs, specifically designed for multi-agent reasoning and the facilitation of argumentation, define the dialogue language DICLA (DIalogic Concurrent language for Argumentation) that enables domain experts to employ advanced computational argumentation tools without needing programming skills, bridging the gap between theoretical argumentation models and practical, real-world applications.

关键词： Computational Argumentation Debates Concurrency Multi-agent Reasoning

来源：评论

学校读者我要写书评

暂无评论

Controlling the Mutation in Large language Models for the Efficient Evolution of Algorithms 28th

Controlling the Mutation in Large Language Models for the...

引用

28th European conference on applications of Evolutionary Computation, Evoapplications 2025, held as part of EvoStar 2025

作者： Yin, Haoran Kononova, Anna V. Bäck, thomas van Stein, Niki LIACS Leiden University Leiden Netherlands

ISBN: (纸本)9783031900648

the integration of Large language Models (LLMs) with evolutionary computation has introduced a promising paradigm for automating the design of metaheuristic algorithms. However, existing frameworks, such as the Large language Model Evolutionary Algorithm (LLaMEA), often lack precise control over mutation mechanisms, leading to inefficiencies in solution space exploration and potentially suboptimal convergence. this paper introduces a novel approach to mutation control within LLM-driven evolutionary frameworks, inspired by theory of genetic algorithms. Specifically, we propose dynamic mutation prompts that adaptively regulate mutation rates, leveraging a heavy-tailed power-law distribution to balance exploration and exploitation. Experiments using GPT-3.5-turbo and GPT-4o models demonstrate that the former fails to adhere to the specific mutation instructions. At the same time, the latter is able to control its mutation rate under the instruction of well-constructed mutation prompts. Further experiments show that the introduction of these dynamic rates can improve the convergence speed and adaptability of LLaMEA when using GPT-4o. this work sets a starting point for better controlled LLM-based mutations in code optimization tasks, paving the way for further advancements in automated metaheuristic design. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Recent Trends and Challenges in Assistive applications for Sinhala-Speaking Adults with Dyslexia: A Decade in Review

Recent Trends and Challenges in Assistive Applications for S...

引用

Advanced Research in Computing (ICARC), international conference on

作者： Peshala Perera Deshan Sumanathilaka School of Computing Informatics Institute of Technology Colombo Sri Lanka School of Mathematics and Computer Science Swansea University United Kingdom

ISBN: (数字)9798331530983

ISBN: (纸本)9798331530990

this paper discusses assistive technologies developed for Sinhala-speaking dyslexics, focusing on the challenges they face and how existing tools attempt to address them. Using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) framework, this review analyzed research publications from 2015 to 2024, highlighting topics such as phonetic processing, text normalization, and error detection. Of the 85 initially reviewed, 32 were included in the meta-analysis to represent major challenges posed by the lack of annotated datasets and Natural language Processing (NLP) resources tailored to the cognitive and linguistic needs of the adult patient population. this review points out the need for the extension of low-resource language toolkits and proper integration of assistive NLP applications. the study concludes that while significant progress has been made, a collaborative, interdisciplinary approach is crucial to improving literacy, independence, and social participation for Sinhala-speaking adults with dyslexia.

关键词： Training Adaptation models Collaboration Phonetics Assistive technologies Dyslexia Natural language processing Complexity theory Text to speech Systematic literature review

来源：评论

学校读者我要写书评

暂无评论

Building a Contextualized Arabic Voice Command Corpus for Industrial Automation Systems

Building a Contextualized Arabic Voice Command Corpus for In...

引用

Innovative Research in Applied Science, Engineering and Technology (IRASET),conference on

作者： Naouar Laaidi Abderrahim Ezzine Meryam Telmem Mohamed Lamrini Hassan Satori Department of Computer Sciences FSDM LISAC Laboratory USMBA University Fez Morocco Department of Computer Sciences Moulay Ismail University Meknes Morocco Department of Computer Sciences FSDM USMBA University Fez Morocco

ISBN: (数字)9798331532970

ISBN: (纸本)9798331532987

Voice command systems are increasingly critical for enhancing human-machine interaction, particularly in industrial environments shaped by Industry 4.0. However, deploying such systems in Arabic-Speaking contexts presents unique challenges due to the morphological complexity of the Arabic language, dialectal variations, and the lack of standardized industrial command corpora. this study addresses these gaps by introducing a specialized Arabic voice command corpus tailored for industrial applications. Data was collected from major stakeholders in sectors such as energy production, railway operations, and chemical processing, culminating in a corpus of 35 distinct commands. A comprehensive syllabic analysis revealed dominant patterns in CV and CVC structures, essential for optimizing speech recognition systems. Cross-Sector validation was conducted with industry professionals from prominent Moroccan organizations, including ONE, ONCF, and OCP, ensuring alignment with real-world operational requirements. the resulting corpus covers critical industrial functions such as process control, safety protocols, maintenance, and inventory management. By integrating linguistic insights with practical applications, this research lays the groundwork for developing robust, context-aware Arabic automatic speech recognition (ASR) systems. the study contributes to the advancement of Arabic natural language processing and enhances accessibility to Industry 4.0 technologies in Arabic-Speaking regions.

关键词： Industries Protocols Standards organizations Production Acoustics Rail transportation Fourth Industrial Revolution Complexity theory Safety Stakeholders

来源：评论

学校读者我要写书评

暂无评论

Green's Relations and their Use in automata theory

Green's Relations and Their Use in Automata Theory

引用

5th international conference on language and automata theory and applications

作者： Colcombet, thomas Univ Paris 07 LIAFA CNRS F-75221 Paris 05 France

ISBN: (纸本)9783642212536

the objective of this survey is to present the ideal theory of monoids, the so-called Green's relations, and to illustrate the usefulness of this tool for solving automata related questions. We use Green's relations for proving four classical results related to automata theory: the result of Schutzenberger characterizing star-free languages, the theorem of factorization forests of Simon, the characterization of infinite words of decidable monadic theory due to Semenov, and the result of determinization of automata over infinite words of McNaughton.

关键词： automata theory

来源：评论

学校读者我要写书评

暂无评论

the Parameterized Complexity of Chosen Problems for Finite automata on Trees

The Parameterized Complexity of Chosen Problems for Finite A...

引用

5th international conference on language and automata theory and applications

作者： Barecka, Agata Charatonik, Witold Univ Wroclaw Inst Math Pl Grunwaldzki 2-4 PL-50384 Wroclaw Poland Univ Wroclaw Inst Comp Sci PL-50383 Wroclaw Poland

ISBN: (纸本)9783642212536

there are many decision problems in automata theory (including membership, emptiness, emptiness of intersection, inclusion and universality problems) that for some classes of tree automata are NP-hard. the study of their parameterized complexity allows us to find new bounds of their non-polynomial time algorithmic behaviors. We present results of such a study for classical tree automata (TA), rigid tree automata (RTA), tree automata with global equality and disequality (TAGED) and t-DAG automata.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Restarting automata with Auxiliary Symbols and Small Lookahead

Restarting Automata with Auxiliary Symbols and Small Lookahe...

引用

5th international conference on language and automata theory and applications

作者： Schluter, Natalie IT Univ Copenhagen DK-2300 Copenhagen S Denmark

ISBN: (纸本)9783642212536

We present a study on lookahead hierarchies for restarting automata with auxiliary symbols and small lookahead. In particular, we show that there are just two different classes of languages recognised by RRWW automata, through the restriction of lookahead size. We also show that the respective (left-) monotone restarting automaton models characterise the context-free languages and that the respective right-left-monotone restarting automata characterise the linear languages both with just lookahead length 2.

关键词： Context free languages

来源：评论

学校读者我要写书评

暂无评论

Planarity of Knots, Register automata and LogSpace Computability

Planarity of Knots, Register Automata and LogSpace Computabi...

引用

5th international conference on language and automata theory and applications

作者： Lisitsa, Alexei Potapov, Igor Saleh, Rafiq Univ Liverpool Dept Comp Sci Liverpool L69 3BX Merseyside England

ISBN: (纸本)9783642212536

In this paper we investigate the complexity of planarity of knot diagrams encoded by Gauss words, both in terms of recognition by automata over infinite alphabets and in terms of classical logarithmic space complexity. As the main result, we show that recognition of planarity of unsigned Gauss words can be done in deterministic logarithmic space and by deterministic register automata. We also demonstrate generic results on the mutual simulations between logspace bounded classical computations (over finite alphabets) and register automata working over infinite alphabets.

关键词： automata theory

来源：评论

学校读者我要写书评

暂无评论

Expressiveness of propositional projection temporal logic with star

引用

thEORETICAL COMPUTER SCIENCE 2011年第18期412卷 1729-1744页

作者： Tian, Cong Duan, Zhenhua Xidian Univ ICTT & ISN Lab Xian 710071 Peoples R China

this paper investigates the expressiveness of Propositional Projection Temporal Logic with Star (PPTL*). To this end, Buchi automata and omega-regular expressions are first extended as Stutter Buchi automata (SBA) and Extended Regular Expressions (ERE) to include both finite and infinite strings. Further, by equivalent transformations among PPTL* formulas, SBAs and EREs. PPTL* is proved to represent exactly the full regular language. Moreover, some fragments of PPTL* are characterized, and finally, PPTL* and its fragments are classified into five different language classes. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Temporal logic Expressiveness automata theory Regular expressions Verification

来源：评论

学校读者我要写书评

暂无评论

Classifying Regular languages via Cascade Products of automata

Classifying Regular Languages via Cascade Products of Automa...

引用

5th international conference on language and automata theory and applications

作者： Gelderie, Marcus Rhein Westfal TH Aachen Lehrstuhl Informat 7 D-52056 Aachen Germany

ISBN: (纸本)9783642212536

Building on the celebrated Krohn-Rhodes theorem we characterize classes of regular languages in terms of the cascade decompositions of minimal DFA of languages in those classes. More precisely we provide characterizations for the classes of piecewise testable languages and commutative languages. To this end we use biased resets, which are resets in the classical sense, that can change their state at most once. Next, we introduce the concept of the scope of a cascade product of reset automata in order to capture a notion of locality inside a cascade product and show that there exist constant bounds on the scope for certain classes of languages. Finally we investigate the impact of biased resets in a product of resets on the dot-depth of languages recognized by this product. this investigation allows us to refine an upper bound on the dot-depth of a language, given by Cohen and Brzozowski.

关键词： Finite automata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：