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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,156 篇 会议
58 册 图书
37 篇 期刊文献

馆藏范围

1,250 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

921 篇 工学
- 869 篇 计算机科学与技术...
- 470 篇 软件工程
- 93 篇 控制科学与工程
- 66 篇 电气工程
- 43 篇 信息与通信工程
- 13 篇 机械工程
- 10 篇 土木工程
- 8 篇 建筑学
- 8 篇 石油与天然气工程
- 7 篇 交通运输工程
- 7 篇 生物工程
- 6 篇 生物医学工程（可授...
- 5 篇 力学（可授工学、理...
- 5 篇 仪器科学与技术
- 5 篇 电子科学与技术（可...
- 5 篇 农业工程
241 篇 理学
- 203 篇 数学
- 19 篇 系统科学
- 17 篇 物理学
- 15 篇 生物学
- 7 篇 统计学（可授理学、...
97 篇 管理学
- 62 篇 管理科学与工程(可...
- 41 篇 图书情报与档案管...
- 37 篇 工商管理
13 篇 教育学
- 12 篇 教育学
11 篇 医学
- 8 篇 基础医学(可授医学...
- 7 篇 临床医学
10 篇 法学
- 6 篇 社会学
7 篇 经济学
- 7 篇 应用经济学
7 篇 农学
- 6 篇 作物学
4 篇 文学
3 篇 哲学

主题

254 篇 logic programmin...
53 篇 artificial intel...
50 篇 fuzzy logic
42 篇 semantics
40 篇 formal logic
40 篇 mathematical log...
32 篇 computer circuit...
31 篇 logics and meani...
26 篇 software enginee...
23 篇 integer programm...
22 篇 temporal logic
21 篇 programming tech...
20 篇 programming lang...
19 篇 programming
19 篇 calculations
19 篇 knowledge repres...
17 篇 computer science
17 篇 logic
17 篇 answer set progr...
14 篇 software enginee...

机构

9 篇 univ bath dept c...
9 篇 vienna univ tech...
5 篇 univ london impe...
5 篇 rhein westfal th...
5 篇 univ london impe...
5 篇 univ texas dept ...
4 篇 tu wien austria
4 篇 simon fraser uni...
4 篇 department of co...
4 篇 guangxi key labo...
4 篇 univ liverpool d...
4 篇 univ potsdam ins...
4 篇 carnegie mellon ...
4 篇 univ glamorgan c...
4 篇 univ potsdam ins...
3 篇 univ potsdam ins...
3 篇 theoretical comp...
3 篇 saitama univ dep...
3 篇 microsoft resear...
3 篇 univ potsdam pot...

作者

12 篇 schaub torsten
12 篇 de vos marina
10 篇 brain martin
9 篇 ricca francesco
8 篇 gebser martin
8 篇 russo alessandra
7 篇 gore rajeev
6 篇 leone nicola
6 篇 andrei voronkov
6 篇 xu yang
6 篇 giesl juergen
5 篇 cliffe owen
5 篇 eiter thomas
5 篇 faber wolfgang
5 篇 cabalar pedro
5 篇 gupta gopal
5 篇 tompits hans
5 篇 schaub t
4 篇 mileo alessandra
4 篇 chang liang

语言

1,235 篇 英文
8 篇 其他
8 篇 中文
1 篇 葡萄牙文

检索条件"任意字段=7th International Conference on Logic for Programming and Automated Reasoning"

共 1251 条记录，以下是71-80 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A New Method for Automatic Planning of Cyber-Physical Production System's Control logic based on State Space Method and Semantic Web Technology 7

A New Method for Automatic Planning of Cyber-Physical Produc...

引用

7th international conference on Intelligent Computing and Signal Processing, ICSP 2022

作者： Wang, Peng Wang, Zhongfeng Li, Ligang Wang, Chu Hu, Kunyuan Key Laboratory of Networked Control Systems Chinese Academy of Sciences Shenyang China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang China

ISBN: (纸本)9781665478571

Rapid reconfiguration is an important capability of flexible production system supporting personalized customization. When the product requirement change and the existing capacity configuration of the production system cannot meet the new requirement, the production system needs to be reconfigured. Aiming at automating the control logic planning process, this paper propose a new method based on state space and semantic web. Unified modelling concepts and relations between product, equipment and production system are built in an ontological model and different types of semantic queries are defined to process the ontology instance which will be leveraged by the process to construct the state space model. In addition, an linear programming method is used to drive the final control logic inside the generated space model. © 2022 IEEE.

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

NeuroLGP-SM: A Surrogate-Assisted Neuroevolution Approach Using Linear Genetic programming 7th

NeuroLGP-SM: A Surrogate-Assisted Neuroevolution Approach Us...

引用

7th international conference on Optimization and Learning

作者： Stapleton, Fergal Cody-Kenny, Brendan Galvan, Edgar Maynooth Univ Hamilton Inst CS Dept Naturally Inspired Comp Res Grp Maynooth Kildare Ireland Sema Baltimore MD USA

ISBN: (纸本)9783031779404;9783031779411

Evolutionary algorithms are increasingly recognised as a viable computational approach for the automated optimisation of deep neural networks (DNNs) within artificial intelligence. this method extends to the training of DNNs, an approach known as neuroevolution. However, neuroevolution is an inherently resource-intensive process, with certain studies reporting the consumption of thousands of GPU days for refining and training a single DNN network. To address the computational challenges associated with neuroevolution while still attaining good DNN accuracy, surrogate models emerge as a pragmatic solution. Despite their potential, the integration of surrogate models into neuroevolution is still in its early stages, hindered by factors such as the effective use of high-dimensional data and the representation employed in neuroevolution. In this context, we address these challenges by employing a suitable representation based on Linear Genetic programming, denoted as NeuroLGP, and leveraging Kriging Partial Least Squares. the amalgamation of these two techniques culminates in our proposed methodology known as the NeuroLGP-Surrogate Model (NeuroLGP-SM). For comparison purposes, we also code and use a baseline approach incorporating a repair mechanism, a common practice in neuroevolution. Notably, the baseline approach surpasses the renowned VGG-16 model in accuracy. Given the computational intensity inherent in DNN operations, a singular run is typically the norm. To evaluate the efficacy of our proposed approach, we conducted 96 independent runs spanning a duration of 4weeks. Significantly, our methodologies consistently outperform the baseline, with the SM model demonstrating superior accuracy or comparable results to the NeuroLGP approach. Noteworthy is the additional advantage that the SM approach exhibits a 25% reduction in computational requirements, further emphasising its efficiency for neuroevolution.

关键词： Neuroevolution Linear Genetic programming Surrogate-assisted Evolutionary Algorithms

来源：评论

学校读者我要写书评

暂无评论

An Introduction to the theory of Linear Integer Arithmetic 44

An Introduction to the Theory of Linear Integer Arithmetic

引用

44th IARCS Annual conference on Foundations of Software Technology and theoretical Computer Science, FSTTCS 2024

作者： Chistikov, Dmitry Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9783959773553

Presburger arithmetic, or linear integer arithmetic (LIA), is a logic that allows one to express linear constraints on integers: equalities, inequalities, and divisibility by nonzero n ∈ . More formally, it is the first-order theory of integers with addition and ordering. this paper offers a short introduction: what can be expressed in this logical theory, decision problems, and automated reasoning methods. We begin with an elementary introduction, explaining the language of linear arithmetic constraints by examples. We adopt a theoretical perspective, focusing on the decision problem: determining the truth value of a logical sentence. the following three views on Presburger arithmetic give us three effective methods for decision procedures: a view from geometry (using semi-linear sets), from automata theory (using finite automata and recognizable sets), and from symbolic computation (using quantifier elimination). the decision problem for existential formulas of Presburger arithmetic is essentially the feasibility problem of integer linear programming. By a fundamental result due to Borosh and Treybig [Proc. Am. Math. Soc. 55(2), 1976] and Papadimitriou [J. ACM 28(4), 1981], it belongs to the complexity class NP. Echoing the three views discussed above, we sketch three proofs of this result and discuss how these ideas have been used and developed in the recent research literature. this is a companion paper for a conference talk focused on the three views on Presburger arithmetic and their applications. the reader will require background knowledge at the level of undergraduate computer science curricula. the discussion of complexity aspects is more advanced. © 2024 Dmitry Chistikov.

关键词： Integer linear programming

来源：评论

学校读者我要写书评

暂无评论

15th international Symposium on NASA Formal Methods, NFM 2023

15th International Symposium on NASA Formal Methods, NFM 202...

引用

15th international Symposium on NASA Formal Methods, NFM 2023

ISBN: (纸本)9783031331695

the proceedings contain 29 papers. the special focus in this conference is on NASA Formal Methods. the topics include: reasoning with Metric Temporal logic and Resettable Skewed Clocks;centralized Multi-agent Synthesis with Spatial Constraints via Mixed-Integer Quadratic programming;a Framework for Policy Based Negotiation;rewrite-Based Decomposition of Signal Temporal logic Specifications;Quantitative Verification and Strategy Synthesis for BDI Agents;Multi-objective Task Assignment and Multiagent Planning with Hybrid GPU-CPU Acceleration;reasoning over Test Specifications Using Assume-Guarantee Contracts;from the Standards to Silicon: Formally Proved Memory Controllers;Formalising Liveness Properties in Event-B with the Reflexive EB4EB Framework;open- and Closed-Loop Neural Network Verification Using Polynomial Zonotopes;formalized High Level Synthesis with Applications to Cryptographic Hardware;From Natural Language Requirements to the Verification of Programmable logic Controllers: Integrating FRET into PLCverif;automata-Based Software Model Checking of Hyperproperties;condition Synthesis Realizability via Constrained Horn Clauses;a Toolkit for automated Testing of Dafny;Verified ALL(*) Parsing with Semantic Actions and Dynamic Input Validation;Subtropical Satisfiability for SMT Solving;a Linear Weight Transfer Rule for Local Search;adiar 1.1: Zero-Suppressed Decision Diagrams in External Memory;satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem;verifying Attention Robustness of Deep Neural Networks Against Semantic Perturbations;formalizing Piecewise Affine Activation Functions of Neural Networks in Coq;verifying an Aircraft Collision Avoidance Neural Network with Marabou;strategy Synthesis in Markov Decision Processes Under Limited Sampling Access;learning Symbolic Timed Models from Concrete Timed Data;reward Shaping from Hybrid Systems Models in Reinforcement Learning;conservative Safety Monitors of Stochastic Dynamical Sys

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic Analysis of Assurance Cases using s(CASP) 39

Semantic Analysis of Assurance Cases using s(CASP)

引用

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

作者： Murugesan, Anitha Wong, Isaac Hong Stroud, Robert Arias, Joaquín Salazar, Elmer Gupta, Gopal Bloomfield, Robin Varadarajan, Srivatsan Rushby, John Honeywell Aerospace United States United Kingdom CETINIA - Universidad Rey Juan Carlos Spain University of Texas Dallas United States SRI International United States

the use of assurance cases is gaining popularity, particularly in the safety-critical system industry, as an organized approach to submitting documentation for the safety and security certification of systems. However, these arguments can become overwhelming and complicated, even for moderately complex systems. therefore, there is a compelling requirement to develop new automation strategies that can aid in creating and assessing assurance cases. Existing assurance-case tools primarily automate syntactic analysis, focusing on structural completeness, while providing limited or no support for semantically evaluating the logical aspects of the assurance case. In prior work, we introduced a framework called Assurance 2.0, which aims to enhance the rigor of assurance cases by emphasizing the reasoning process, evidence utilized, and explicit identification of counter-claims (defeaters) and counter-evidence. In this paper, we present a new approach to enhancing Assurance 2.0 by incorporating semantic rule-based analysis capabilities. Firstly, we systematically convert the assurance case into Prolog predicates and constraints. then, leveraging the analysis capabilities of the s(CASP), a goal-directed top-down solver for Constraints Answer Set Programs, we evaluate the semantic properties of assurance cases, including logical consistency, completeness, and indefeasibility. the application of these analyses provides both authors and evaluators with higher confidence when assessing the assurance case. 2023 Copyright for this paper by its authors.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

automated modeling of mode-based control algorithms in a hierarchical fuzzy logic controller using fuzzy Petri nets 35

Automated modeling of mode-based control algorithms in a hie...

引用

35th international conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems, ECOS 2022

作者： Cai, Xiaoye Li, Xinling Kümpel, Alexander Alexander Müller, Dirk RWTH-Aachen University E.ON Energy Research Center Institute for Energy Efficient Buildings and Indoor Climate Aachen Germany

ISBN: (纸本)9788774756989

the development of appropriate control strategies for building energy systems has been a challenging issue for the traditional planning process of building automation, especially facing the increasing complexity of building energy conversion and distribution systems. Regarding this problem, the MODI-method has been introduced in previous work to enable a systematic development of mode-based control algorithms for building energy systems. A mode-based control algorithm organizes the automation system by considering mode-switching conditions and selecting appropriate operating modes. However, the development of proper mode-switching conditions remains unfeasible. For this problem, fuzzy logic is a promising solution to determine mode-switching conditions by integrating expert knowledge and human reasoning. Yet, a methodology to integrate fuzzy logic into the mode-based control algorithms is lacked. In this paper, we present an automated modeling approach of mode-based control algorithms in a hierarchical fuzzy logic controller. We describe the controller in fuzzy Petri nets and develop a program to automatically model the controller in the Python programming language. the controller is configured through a graphical user interface and generated as a ready-to-use module. Furthermore, a genetic algorithm is applied for finding optimal transition conditions in the hierarchical fuzzy logic controller. In a case study, we use the developed program to automatically model and optimize a mode-based control strategy for an adaptive cooling supply network in a simulation phase. the simulation results verify the feasibility of this automated modeling approach. In future work, a hardware-in-the-loop test for the controller will be investigated. © Proceedings of ECOS 2022 - 35th international conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

On Optimal QUBO Encoding of Boolean logic, (Max-)3-SAT and (Max-)k-SAT with Integer programming 7

On Optimal QUBO Encoding of Boolean Logic, (Max-)3-SAT and (...

引用

7th international conference on Algorithms, Computing and Systems, ICACS 2023

作者： Morse, Gregory Kozsik, Tamás ELTE Eötvös Loránd University Budapest Hungary

ISBN: (纸本)9798400709098

We present an asymptotic improvement in the number of variables (n + m⌊log2(k − 1)⌋) required for state-of-the-art formulation of (max-)k-SAT problems when encoded as a quadratic unconstrained binary optimization (QUBO) problem. We further show a variable reduction technique (max-)3-SAT formula which achieves the optimal number of substitution variables. We show optimality empirically by presenting an integer linear programming (ILP) construction for arbitrary Boolean formulas. We show how various goals can be encoded, and this model can be generalized to searching for arbitrary substitution variable functions. Lastly, we show the optimal high-order substitution reduction in cubic QUBO equations which has smaller coefficients than the typical construction used. © 2023 Copyright held by the owner/author(s).

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Determining Action Reversibility in STRIPS Using Answer Set programming with Quantifiers 24th

Determining Action Reversibility in STRIPS Using Answer Set...

引用

24th international conference on Practical Aspects of Declarative Languages, PADL 2022

作者： Faber, Wolfgang Morak, Michael Chrpa, Lukáš University of Klagenfurt Klagenfurt Austria Czech Technical University in Prague Prague Czech Republic

ISBN: (纸本)9783030944780

In the field of automated planning, an action is called reversible when other actions can be applied in order to revert the effects of this action and return to the original state. In recent years, there has been renewed interest in this topic, which led to novel results in the widely known STRIPS formalism and the PDDL planning language. In this paper, we aim to solve the computational problem of deciding action reversibility in a practical setting, applying recent advances in the field of logic programming. In particular, a quantified extension of Answer Set programming (ASP) named ASP with Quantifiers (ASP(Q)) has been proposed by Amendola, Ricca, and Truszczynski, which allows for stacking logic programs by quantifying over answer sets of the previous layer. this language is well-suited to express encodings for the action reversibility problem, since this problem naturally contains a quantifier alternation. In addition, a prototype solver for ASP(Q) is currently developed. We make use of the ASP(Q) language to offer an encoding for action reversibility, and then report on preliminary benchmark results on how well this encoding performs compared to classical ASP. © 2022, Springer Nature Switzerland AG.

关键词： Answer set programming automated planning reasoning about action and change

来源：评论

学校读者我要写书评

暂无评论

Implementation of a System for Teaching the Basics of Fuzzy logic Inference Systems and Fuzzy Case-Based reasoning

Implementation of a System for Teaching the Basics of Fuzzy ...

引用

international conference on Information Technologies in Engineering Education (Inforino)

作者： Pavel Varshavskii Anatoly Sesin Matvey Bashlykov dept. of Applied Mathematics NRU “MPEI” Moscow Russia

ISBN: (数字)9798350371369

ISBN: (纸本)9798350371376

this paper presents a software module for working with fuzzy logic inference systems in the context of fuzzy case-based reasoning. Fuzzy logic, providing tools for describing and handling uncertainty, is an important component of engineering practice. the considered free software is used in the National Research University "Moscow Power Engineering Institute" and is implemented in the process of teaching master's degree students of "Applied Mathematics and Computer Science" in the discipline "Actual Problems of Applied Mathematics and Computer Science".

关键词： Fuzzy logic Computer science Power engineering Uncertainty Machine learning Cognition Software

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Test-cases of Increasing Complexity for Autonomous Vehicles at Intersections 13

Automatic Generation of Test-cases of Increasing Complexity ...

引用

13th ACM/IEEE international conference on Cyber-Physical Systems (ICCPS )

作者： Karimi, Abolfazl Duggirala, Parasara Sridhar Univ N Carolina Chapel Hill NC 27515 USA

ISBN: (纸本)9781665409674

this paper presents a new framework for generating test-case scenarios for autonomous vehicles. We address two challenges in automatic test-case generation: first, a formal notion of test-case complexity, and second, an algorithm to generate more-complex test-cases. We characterize the complexity of a test-case by its set of solutions, and compare two complexities by the subset relation. the novelty of our definition is that it only relies on the pass-fail criteria of the test-case, rather than indirect or subjective assessments of what may challenge an ego vehicle to pass a test-case. Given a testcase, we model the problem of generating a more complex test-case as a constraint-satisfaction search problem. the search variables are the changes to the given test-case, and the search constraints define a solution to the search problem. the constraints include steering geometry of cars, the geometry of lanes, the shape of cars, traffic rules, bounds on longitudinal acceleration of cars, etc. To conquer the computational challenge, we divide the constraints to three categories and satisfy them with simulation, answer set programming, and SMT solving. We have implemented our algorithm using the Scenic libraries and the CARLA simulator and generate test-cases for several 3-way and 4-way intersections with different topologies. Our experiments demonstrate that both CARLA's autopilot and autopilot-plus-RSS (Responsibility-Sensitive Safety) can fail as the complexity of test-cases increase.

关键词： test-case complexity test-case generation traffic rules logic programming Answer Set programming Bezier curves SMT CARLA Scenic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共126页 << < 4 5 6 7 8 9 10 11 12 13 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：