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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

293 篇 会议
18 册 图书
7 篇 期刊文献

馆藏范围

318 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

229 篇 工学
- 218 篇 计算机科学与技术...
- 109 篇 软件工程
- 23 篇 电气工程
- 15 篇 控制科学与工程
- 14 篇 信息与通信工程
- 4 篇 生物医学工程（可授...
- 3 篇 机械工程
- 3 篇 建筑学
- 3 篇 交通运输工程
- 2 篇 仪器科学与技术
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 生物工程
- 1 篇 力学（可授工学、理...
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 安全科学与工程
47 篇 理学
- 44 篇 数学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 大气科学
14 篇 管理学
- 10 篇 管理科学与工程(可...
- 7 篇 工商管理
- 3 篇 图书情报与档案管...
7 篇 教育学
- 7 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学

主题

69 篇 logic programmin...
17 篇 answer set progr...
15 篇 inductive logic ...
12 篇 mathematical log...
11 篇 artificial intel...
11 篇 logics and meani...
10 篇 fuzzy logic
10 篇 programming
10 篇 programming lang...
9 篇 software enginee...
9 篇 logic
7 篇 application soft...
7 篇 logic gates
7 篇 inductive logic ...
7 篇 semantics
7 篇 programming tech...
7 篇 system testing
6 篇 software enginee...
6 篇 machine learning
6 篇 algorithm analys...

机构

3 篇 new mexico state...
3 篇 univ calabria ar...
3 篇 tu wien inst log...
3 篇 tech univ dresde...
2 篇 technological ed...
2 篇 univ oxford oxfo...
2 篇 univ nebraska om...
2 篇 univ helsinki de...
2 篇 network operatio...
2 篇 univ freiburg in...
2 篇 inria lille nord...
2 篇 tech univ dortmu...
2 篇 ecole polytech i...
2 篇 univ paris 13 li...
2 篇 univ pisa dept c...
2 篇 tech univ munich...
2 篇 portland state u...
2 篇 univ london impe...
2 篇 katholieke univ ...
1 篇 bolsista do prog...

作者

4 篇 riguzzi fabrizio
4 篇 ricca francesco
3 篇 gaggl sarah alic...
3 篇 kramer stefan
3 篇 page david
3 篇 son tran cao
3 篇 srinivasan ashwi...
3 篇 froehler sebasti...
3 篇 alphonse erick
2 篇 muggleton stephe...
2 篇 giordano laura
2 篇 toivonen h.
2 篇 ong irene m.
2 篇 revoredo k.
2 篇 bellodi elena
2 篇 osmani aomar
2 篇 bryant christoph...
2 篇 ray oliver
2 篇 hutter dieter
2 篇 costa vitor sant...

语言

314 篇 英文
2 篇 中文
1 篇 葡萄牙文
1 篇 其他

检索条件"任意字段=16th International Conference of Inductive Logic Programming"

共 318 条记录，以下是41-50 订阅

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

详细简洁

排序：

State Transition in Multi-agent Epistemic Domains Using Answer Set programming 16th

State Transition in Multi-agent Epistemic Domains Using Answ...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Izmirlioglu, Yusuf Pham, Loc Son, Tran Cao Pontelli, Enrico New Mexico State Univ Las Cruces NM 88003 USA

ISBN: (纸本)9783031157073;9783031157066

In this paper we develop a state transition function for partially observable multi-agent epistemic domains and implement it using Answer Set programming (ASP). the transition function computes the next state upon an occurrence of a single action. thus it can be used as a module in epistemic planners. Our transition function incorporates ontic, sensing and announcement actions and allows for arbitrary nested belief formulae and general common knowledge. A novel feature of our model is that upon an action occurrence, an observing agent corrects his (possibly wrong) initial beliefs about action precondition and his observability. By examples, we show that this step is necessary for robust state transition. We establish some properties of our state transition function regarding its soundness in updating beliefs of agents consistent with their observability.

关键词： Answer Set programming Multi-agent systems Epistemic planning State transition

来源：评论

学校读者我要写书评

暂无评论

Representing Abstract Dialectical Frameworks with Binary Decision Diagrams 16th

Representing Abstract Dialectical Frameworks with Binary Dec...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Ellmauthaler, Stefan Gaggl, Sarah Alice Rusovac, Dominik Wallner, Johannes P. Tech Univ Dresden Cfaed Knowledge Based Syst Grp Dresden Germany Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany Graz Univ Technol Inst Software Technol Graz Austria

ISBN: (纸本)9783031157073;9783031157066

A Abstract dialectical frameworks (ADFs) are a well-studied generalisation of the prominent argumentation frameworks due to Phan Minh Dung. In this paper we propose to use reduced ordered binary decision diagrams (RoBDDs) as a suitable representation of the acceptance conditions of arguments within ADFs. We first show that computational complexity of reasoning on ADFs represented by RoBDDs is milder than in the general case, with a drop of one level in the polynomial hierarchy. Furthermore, we present a framework to systematically define heuristics for search space exploitation, based on easily retrievable properties of RoBDDs and the recently proposed approach of weighted faceted navigation for answer set programming. Finally, we present preliminary experiments of an implementation of our approach showing promise both when compared to state-of-the-art solvers and when developing heuristics for reasoning.

关键词： Abstract dialectical frameworks Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade up Strategy 16th

Tunas - Fishing for Diverse Answer Sets: A Multi-shot Trade ...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Boehl, Elisa Gaggl, Sarah Alice Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany

ISBN: (纸本)9783031157073;9783031157066

Answer set programming (ASP) solvers have advanced in recent years, with a variety of different specialisation and overall development. thus, even more complex and detailed programs can be solved. A side effect of this development are growing solution spaces and the problem of how to find those answer sets one is interested in. One general approach is to give an overview in form of a small number of highly diverse answer sets. By choosing a favourite and repeating the process, the user is able to leap through the solution space. But finding highly diverse answer sets is computationally expensive. In this paper we introduce a new approach called Tunas for Trade Up Navigation for Answer Sets to find diverse answer sets by reworking existing solution collections. the core idea is to collect diverse answer sets one after another by iteratively solving and updating the program. Once no more answer sets can be added to the collection, the program is allowed to trade answer sets from the collection for different answer sets, as long as the collection grows and stays diverse. Elaboration of the approach is possible in three variations, which we implemented and compared to established methods in an empirical evaluation. the evaluation shows that the Tunas approach is competitive with existing methods, and that efficiency of the approach is highly connected to the underlying logic program.

关键词： multi-shot answer set programming navigation diverse answer sets

来源：评论

学校读者我要写书评

暂无评论

Ladder logic implementation for Romanian railway interlockings

Ladder Logic implementation for Romanian railway interlockin...

引用

international conference on Electronics, Computers and Artificial Intelligence (ECAI)

作者： Florin Bădău Valentin Iordache Valentin Alexandru Stan Angel Ciprian Cormoș Faculty of Transports National University of Science and Technology POLITEHNICA Bucharest Bucharest Romania

ISBN: (数字)9798350371154

ISBN: (纸本)9798350371161

Interlockings are critical systems for the railway network which ensure the safety of train operations. While previous generations of interlockings use hardware logic to implement safety functions, electronic interlockings employ different techniques and architectures to comply with strict reliability and redundancy standards. Ladder logic has been used for decades for industrial automation, which has witnessed a transition from relay-based to PLC-based systems. this paper proposes a standard for translating relay interlocking schematics into Ladder programmes. the proposed model is evaluated against a physical relay interlocking.

关键词： Termination of employment programming Rail transportation Safety Topology logic Reliability

来源：评论

学校读者我要写书评

暂无评论

Optimising Business Process Discovery Using Answer Set programming 16th

Optimising Business Process Discovery Using Answer Set Progr...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Chesani, Federico Di Francescomarino, Chiara Ghidini, Chiara Grundler, Giulia Loreti, Daniela Maggi, Fabrizio Maria Mello, Paola Montali, Marco Tessaris, Sergio DISI Univ Bologna Bologna Italy Fdn Bruno Kessler Trento Italy Free Univ Bozen Bolzano Bolzano Italy

ISBN: (纸本)9783031157073;9783031157066

Declarative business process discovery aims at identifying sets of constraints, from a given formal language, that characterise a workflow by using pre-recorded activity logs. Since the provided logs represent a fraction of all the consistent evolution of a process, and the fact that many sets of constraints covering those examples can be selected, empirical criteria should be employed to identify the "best" candidates. In our work we frame the process discovery as an optimisation problem, where we want to identify optimal sets of constraints according to preference criteria. Declarative constraints for processes are usually characterised via temporal logics, so different solutions can be semantically equivalent. For this reason, it is difficult to use an arbitrary finite domain constraints solvers for the optimisation. the use of Answer Set programming enables the combination of deduction rules within the optimisation algorithm, in order to take into account not only the user preferences but also the implicit semantics of the formal language. In this paper we show how we encoded the process discovery problem using the ASPrin framework for qualitative and quantitative optimisation in ASP, and the results of our experiments.

关键词： Preferences Answer set programming Optimisation Process mining Process discovery Declarative process models

来源：评论

学校读者我要写书评

暂无评论

IASCAR: Incremental Answer Set Counting by Anytime Refinement 16th

IASCAR: Incremental Answer Set Counting by Anytime Refinemen...

引用

16th international conference on logic programming and Non-Monotonic Reasoning (LPNMR)

作者： Fichte, Johannes Klaus Gaggl, Sarah Alice Hecher, Markus Rusovac, Dominik TU Wien Inst Log & Computat Vienna Austria Tech Univ Dresden Log Programming & Argumentat Grp Dresden Germany

ISBN: (纸本)9783031157073;9783031157066

Answer set programming (ASP) is a popular declarative programming paradigm with various applications. Programs can easily have so many answer sets that they cannot be enumerated in practice, but counting still allows to quantify solution spaces. If one counts under assumptions on literals, one obtains a tool to comprehend parts of the solution space, so called answer set navigation. But navigating through parts of the solution space requires counting many times, which is expensive in theory. there, knowledge compilation compiles instances into representations on which counting works in polynomial time. However, these techniques exist only for CNF formulas and compiling ASP programs into CNF formulas can introduce an exponential overhead. In this paper, we introduce a technique to iteratively count answer sets under assumptions on knowledge compilations of CNFs that encode supported models. Our anytime technique uses the principle of inclusion-exclusion to systematically improve bounds by over- and undercounting. In a preliminary empirical analysis we demonstrate promising results. After compiling the input (offline phase) our approach quickly (re)counts.

关键词： ASP Answer set counting Knowledge compilation

来源：评论

学校读者我要写书评

暂无评论

Intelligent Decision Support for Cybersecurity Incident Response Teams: Autonomic Architecture and Mitigation Search 16th

Intelligent Decision Support for Cybersecurity Incident Resp...

引用

16th international conference on Risks and Security of Internet and Systems (CRiSIS)

作者： Correa, Camilo Robin, Jacques Mazo, Raul Abreu, Salvador Univ Paris 1 Pantheon Sorbonne CRI Paris France ENSTA Bretagne Lab STICC Brest France Eafit Univ GIDITIC Medellin Colombia Univ Evora NOVA LINCS Evora Portugal

ISBN: (纸本)9783031020674;9783031020667

Critical infrastructures must be able to mitigate, at run-time, suspected ongoing cyberattacks that have eluded preventive security measures. To tackle this issue, we first propose an autonomic computing architecture for a Cyber-Security Incident Response Team Intelligent Decision Support System (CSIRT-IDSS) with a precise set of technologies for each of its components. We then zoom in on the component responsible for proposing to the CSIRT, automatically ranked sets of runtime actions to mitigate suspected ongoing cyber-attacks. We formalize its task as a Constraint Optimization Problem (COP). We then propose to implement it by a Constraint Object-Oriented logic Program (COOLP) deployed as a containerized web service through the integration of three orthogonal extensions of logic programming (LP): Web Service Oriented LP (WSOLP), Constraint LP (CLP) and Object-Oriented LP (OOLP). this integration supports seamlessly reusing platform and task independent cybersecurity ontological knowledge to dynamically build a mitigation action search COP that is customized to an input suspected cyberattack action set. this customization then allows the COP, to be solved by a generic CLP engine efficiently enough to propose mitigation actions to the CSIRT team while they can still be effective. To validate this approach, we implemented a prototype called CARMAS (Cyber Attack Runtime Mitigation Action Search) and ran scalability tests on simulated attacks with various COP construction strategies.

关键词： Intelligent Decision Support System Autonomic computing Cybersecurity incident response Object-oriented logic programming Constraint logic programming

来源：评论

学校读者我要写书评

暂无评论

FOLD-R++: A Scalable Toolset for Automated inductive Learning of Default theories from Mixed Data 1

引用

16th international Symposium on Functional and logic programming, FLOPS 2022

作者： Wang, Huaduo Gupta, Gopal Department of Computer Science The University of Texas at Dallas RichardsonTX United States

ISBN: (数字)9783030994617

ISBN: (纸本)9783030994600

FOLD-R is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) normal logic program (NLP) rule set for classification tasks. We present an improved FOLD-R algorithm, called FOLD-R++, that significantly increases the efficiency and scalability of FOLD-R by orders of magnitude. FOLD-R++ improves upon FOLD-R without compromising or losing information in the input training data during the encoding or feature selection phase. the FOLD-R++ algorithm is competitive in performance with the widely-used XGBoost algorithm, however, unlike XGBoost, the FOLD-R++ algorithm produces an explainable model. FOLD-R++ is also competitive in performance with the RIPPER system, however, on large datasets FOLD-R++ outperforms RIPPER. We also create a powerful tool-set by combining FOLD-R++ with s(CASP)—a goal-directed answer set programming (ASP) execution engine—to make predictions on new data samples using the normal logic program generated by FOLD-R++. the s(CASP) system also produces a justification for the prediction. Experiments presented in this paper show that our improved FOLD-R++ algorithm is a significant improvement over the original design and that the s(CASP) system can make predictions in an efficient manner as well. © 2022, Springer Nature Switzerland AG.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Network Forensics for Encrypted SCADA Device programming Traffic

Network Forensics for Encrypted SCADA Device Programming Tra...

引用

16th international conference on Cyber Warfare and Security (ICCWS)

作者： Mellish, Robert Graham, Scott Dunlap, Stephen US Air Force Inst Technol Dayton OH 45433 USA

ISBN: (纸本)9781912764884

CADA (Supervisory Control and Data Acquisition) networks have historically been in isolated locations and thought unassailable. In a post-Stuxnet world this assertion has been shown to not be true. Stuxnet exploited the Siemens Step7 programming software to perform a Control-logic injection attack, inserting malicious code into the programming traffic for end devices controlling centrifuges. this attack methodology poses serious risks to Industrial Control Systems (ICS). One forensic security tool, used for incident response and real-time monitoring, captures, and inspects network packets to identify potential malicious activity. As Programmable logic Controller (PLC) manufacturers move from plain text protocols to more secure alternatives, care must be taken to protect the integrity and availability of the control commands in the network activity while still enabling the forensic process. In this work, we present an analysis of the programming protocol of the SEL-3505 Real Time Automation Controller and a process to extract the control logic program from the captured encrypted network traffic for forensic investigators. the results show that control traffic can be secure as it traverses the network but still successfully be used for a forensic investigation or continuous auditing purposes.

关键词： SCADA ICS PLC forensics

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 2021 16th international conference on Design and Technology of Integrated Systems in Nanoscale Era, DTIS 2021

Proceedings - 2021 16th International Conference on Design a...

引用

16th IEEE international conference on Design and Technology of Integrated Systems in Nanoscale Era, DTIS 2021

ISBN: (纸本)9781665436540

the proceedings contain 26 papers. the topics discussed include: design and evaluation of implementation impact on a fault-tolerant network-on-chip router;characterization of a RISC-V system-on-chip under neutron radiation;a 270 Hz, fine frequency tuning class-C oscillator using capacitive-inductive degeneration technique in 130 -nm CMOS;memory encryption support for an FPGA-based RISC-V implementation;innovative methods for burn-in related stress metrics computation;microarchitecture-aware fault models: experimental evidence and cross-layer inference methodology;power side channel attacks: where are we standing?;and simulation of state of the art EEPROM programming window closure during endurance degradation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：