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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

298 篇 会议
27 篇 期刊文献
19 册 图书

馆藏范围

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

日期分布

学科分类号

245 篇 工学
- 229 篇 计算机科学与技术...
- 117 篇 软件工程
- 19 篇 电气工程
- 17 篇 控制科学与工程
- 14 篇 信息与通信工程
- 6 篇 机械工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 3 篇 化学工程与技术
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 农业工程
- 1 篇 光学工程
53 篇 理学
- 39 篇 数学
- 8 篇 生物学
- 4 篇 系统科学
- 4 篇 统计学（可授理学、...
- 3 篇 化学
- 2 篇 物理学
23 篇 管理学
- 14 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
6 篇 经济学
- 3 篇 理论经济学
- 3 篇 应用经济学
3 篇 教育学
- 2 篇 教育学
- 1 篇 心理学(可授教育学...
3 篇 农学
- 2 篇 作物学
2 篇 法学
- 2 篇 社会学
1 篇 医学

主题

70 篇 logic programmin...
18 篇 inductive logic ...
15 篇 artificial intel...
12 篇 programming
12 篇 mathematical log...
11 篇 programming tech...
11 篇 logics and meani...
10 篇 software enginee...
10 篇 logic gates
10 篇 programming lang...
7 篇 computer science
7 篇 semantics
6 篇 computer circuit...
6 篇 inductive logic ...
6 篇 probabilistic lo...
5 篇 optimization
5 篇 logic
5 篇 machine learning
4 篇 formal logic
4 篇 computer archite...

机构

5 篇 inria rennes ren...
5 篇 university of po...
3 篇 microsoft res re...
3 篇 univ paris 13 li...
3 篇 carnegie mellon ...
3 篇 aalto university...
3 篇 univ penn philad...
2 篇 univ wales dept ...
2 篇 stanford univ ct...
2 篇 politecn torino ...
2 篇 indian inst tech...
2 篇 univ freiburg in...
2 篇 univ wisconsin d...
2 篇 czech tech univ ...
2 篇 univ london impe...
2 篇 department of in...
2 篇 univ paris 13 li...
2 篇 harvard univ cam...
2 篇 columbia univ ct...
2 篇 ibm unternehmens...

作者

8 篇 gebser martin
6 篇 srinivasan ashwi...
6 篇 alphonse erick
5 篇 schaub torsten
5 篇 ricca francesco
4 篇 osmani aomar
4 篇 page david
4 篇 camacho rui
3 篇 yamamoto akihiro
3 篇 king ross
3 篇 rouveirol celine
3 篇 moreno gines
3 篇 leger hippolyte
3 篇 janhunen tomi
3 篇 maratea marco
3 篇 bouthinon domini...
3 篇 lebbah mustapha
2 篇 muggleton stephe...
2 篇 fronhöfer b
2 篇 khatibsyarbini

语言

332 篇 英文
7 篇 其他
5 篇 中文

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

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

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

详细简洁

排序：

Which first-order logic clauses can be learned using genetic algorithms?

Which first-order logic clauses can be learned using genetic...

引用

13th international conference on inductive logic programming, ILP 2003

作者： Mărginean, Flaviu Adrian Department of Computer Science The University of York Heslington YorkYO10 5DD United Kingdom

ISBN: (纸本)9783540399179

In this paper we present and prove both negative and positive theoretical results concerning the representation and evaluation of first order logic clauses using genetic algorithms. Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (EC) with inductive logic programming (ILP). the underlying rationale is that evolutionary algorithms, such as genetic algorithms, might mitigate the combinatorial explosions generated by the inductive learning of rich representations, such as those used in first-order logic. Particularly, the genetic algorithms approach to ILP presented by Tamaddoni-Nezhad and Muggleton has attracted the attention of both the EC and ILP communities in recent years. Unfortunately, a series of systematic and fundamental theoretical errors renders their framework moot. this paper critically examines the fallacious claims in the mentioned approach. It is shown that, far from restoring completeness to the learner progol’s search of the subsumption lattice, their proposed binary representation is both incomplete and non compact. It is also shown that their fast evaluation of clauses based on bitwise operations is based on false theorems and therefore invalid. As an alternative to Tamaddoni- Nezhad and Muggleton’s flawed genetic algorithms attempt, we propose a framework based on provably sound and complete binary refinement. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

the design of the sixth answer set programming competition 13th

引用

13th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2015

作者： Gebser, Martin Maratea, Marco Ricca, Francesco Helsinki Institute for Information Technology HIIT Aalto University Espoo Finland DIBRIS Università di Genova Genova Italy Dipartimento di Matematica e Informatica Università della Calabria Rende Cs Italy

ISBN: (纸本)9783319232638

Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning. Similar to other closely-related problemsolving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advances in ASP solving are assessed in competition events. In this paper, we report about the design of the Sixth ASP Competition, which is jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genova (Italy), in affiliation with the 13th international conference on logic programming and Non-Monotonic Reasoning (LPNMR 2015). this edition maintains some of the design decisions introduced in the last event, e.g., the design of tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it features also some novelties, like a benchmarks selection stage to classify instances according to their expected hardness, and a "marathon" track where the best performing systems are given more time for solving hard benchmarks. © Springer international Publishing Switzerland 2015.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

13th international conference on theorem Proving in Higher Order logics, TPHOLs 2000

13th International Conference on Theorem Proving in Higher O...

引用

13th international conference on theorem Proving in Higher Order logics, TPHOLs 2000

ISBN: (纸本)9783540678632

the proceedings contain 33 papers. the special focus in this conference is on theorem Proving in Higher Order logics. the topics include: Fix-point equations for well-founded recursion in type theory;programming and computing in HOL;proof terms for simply typed higher order logic;routing information protocol in HOL/SPIN;recursive families of inductive types;aircraft trajectory modeling and alerting algorithm verification;intel formal verification experience on the Willamette development;proving ml type soundness within coq;on the mechanization of real analysis in Isabelle/HOL;equational reasoning via partial reflection;reachabihty programming in hol98 using BDDs;transcendental functions and continuity checking in PVS;verified optimizations for the intel IA-64 architecture;formal verification of ia-64 division algorithms;fast tactic-based theorem proving;implementing a program logic of objects in a higher-order logic theorem prover;a strong and mechanizable grand logic;inheritance in higher order logic: modeling and reasoning;total-correctness refinement for sequential reactive systems;divider circuit verification with model checking and theorem proving;specification and verification of a steam-boiler with signal-coq;functional procedures in higher-order logic;formalizing Stalmarck's algorithm in coq;a generic window inference system;weak alternating automata in Isabelle/HOL;graphical theories of interactive systems: can a proof assistant help?;dependently typed records for representing mathematical structure;towards a machine-checked java specification book;another look at nested recursion;automating the search for answers to open questions;conjectures concerning proof, design, and verification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the discovery of frequent patterns with logic and constraint programming

The discovery of frequent patterns with logic and constraint...

引用

13th WSEAS international conference on Mathematical Methods, Computational Techniques and Intelligent Systems, MAMECTIS'11, 10th WSEAS international conference on Non-Linear Analysis, Non-Linear Systems and Chaos, NOLASC'11, CONTROL'11, WAMUS'11

作者： Kerdprasop, Nittaya Kerdprasop, Kittisak Data Engineering Research Unit School of Computer Engineering Suranaree University of Technology 111 University Avenue Nakhon Ratchasima 30000 Thailand

ISBN: (纸本)9781618040114

the basic goal of data mining is to discover patterns occurring in the databases, such as associations, classification models, sequential patterns, and so on. In this paper we focus on the problem of frequent pattern discovery, which is the process of searching for patterns such as sets of features or items that appear in data frequently. Such frequent patterns can reveal associations, correlations, and many other interesting relationships hidden in a database. Most of frequent pattern mining systems in the market are too generic and become inefficient when set of patterns is large and the frequent patterns are very long. A new trend in data mining is a scalable method that uses constraints to guide the system in its search for interesting patterns. Our main research objective is the development of constraint-based mining methodology and this paper presents the preliminary results of our study and prototype development. We present the implementation of frequent pattern mining system based on declarative programming paradigm using logic programming and constraint logic programming. the comparative performance studies on speed and memory usage of logic versus constraint programming are also reported in the paper.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Model Based Task programming for Secure Multimodal Human-Robot Interaction 13

Model Based Task Programming for Secure Multimodal Human-Rob...

引用

13th international conference on Control Automation Robotics & Vision (ICARCV)

作者： Lin, Liyong Su, Rong Tju, Hendra Suratno Lee, Gerald Seet Gim Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore Nanyang Technol Univ Sch Mech & Aerosp Engn Singapore Singapore

ISBN: (纸本)9781479951994

this note presents a preliminary study on a high-level model based task programming framework for secure multimodal human-robot interaction in industrial context. the case study of robotic polishing tasks, in particular the task of polishing the whole surfaces of objects of interest, is considered. Our main focus is on system modeling and optimal synthesis of surface coverage trajectories in robotic polishing tasks. Two heuristics are proposed to solve the optimal synthesis problem approximately, based on different considerations and assumptions. We then briefly discuss about polishing tasks other than coverage problem that are specifiable in the language of linear temporal logic and state space reduction heuristics based on learning from expert operators. Finally, we introduce a design of the specification input device for the task specification module.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Predicting Students' Performance with SimStudent: Learning Cognitive Skills from Observation 13

引用

13th international conference on Artificial Intelligence in Education (AIED 2007)

作者： Matsuda, Noboru Cohen, William W. Sewall, Jonathan Lacerda, Gustavo Koedinger, Kenneth R. Carnegie Mellon Univ Human Comp Interact Inst Pittsburgh PA 15213 USA

ISBN: (纸本)9781586037642

SimStudent is a machine-learning agent that learns cognitive skills by demonstration. SimStudent was originally built as a building block for Cognitive Tutor Authoring Tools to help an author build a cognitive model without significant programming. In this paper, we evaluate a second use of SimStudent, viz., student modeling for Intelligent Tutoring Systems. the basic idea is to have SimStudent observe human students solving problems. It then creates a cognitive model that can replicate the students' performance. If the model is accurate, it would predict the human students' performance on novel problems. An evaluation study showed that when trained on 15 problems, SimStudent accurately predicted the human students' correct behavior on the novel problems more than 80% of the time. However, the current implementation of SimStudent does not accurately predict when the human students make errors.

关键词： Cognitive modeling programming by demonstration inductive logic programming Cognitive Tutor intelligent authoring

来源：评论

学校读者我要写书评

暂无评论

12th international conference on Verified Software, VSTTE 2020, and 13th international Workshop on Numerical Software Verification, NSV 2020

12th International Conference on Verified Software, VSTTE 20...

引用

12th international conference on Verified Software, VSTTE 2020, and 13th international Workshop on Numerical Software Verification, NSV 2020

ISBN: (纸本)9783030636173

the proceedings contain 14 papers. the special focus in this conference is on Verified Software. the topics include: An Efficient Floating-Point Bit-Blasting API for Verifying C Programs;rigorous Enclosure of Round-Off Errors in Floating-Point Computations;towards Numerical Assistants: Trust, Measurement, Community, and Generality for the Numerical Workbench;combining Zonotope Abstraction and Constraint programming for Synthesizing inductive Invariants;QPR Verify: A Static Analysis Tool for Embedded Software Based on Bounded Model Checking;Verified Translation Between Purely Functional and Imperative Domain Specific Languages in HELIX;automatic Detection and Repair of Transition- Based Leakage in Software Binaries;BanditFuzz: A Reinforcement-Learning Based Performance Fuzzer for SMT Solvers;synthesis of Solar Photovoltaic Systems: Optimal Sizing Comparison;verified Transformations and Hoare logic: Beautiful Proofs for Ugly Assembly Language;MCBAT: Model Counting for Constraints over Bounded Integer Arrays;Verification of an Optimized NTT Algorithm;vstte 2020 preface.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Representing defaults and negative information without negation-as-failure

引用

13th international conference on logic for programming, Artificial Intelligence, and Reasoning

作者： Fillottrani, Pablo R. Simari, Guillermo R. Univ Nacl Sur Dept Comp Sci & Engn Av Alem 1253 RA-8000 Bahia Blanca Buenos Aires Argentina

ISBN: (纸本)3540482814

In logic programs, negation-as-failure has been used both for representing negative information and for providing default non-monotonic inference. In this paper we argue that this twofold role is not only unnecessary for the expressiveness of the language, but it also plays against declarative programming, especially if further negation symbols such as strong negation are also available. We therefore propose a new logic programming approach in which negation and default inference are independent, orthogonal concepts. Semantical characterization of this approach is given in the style of answer sets, but other approaches are also possible. Finally, we compare them with the semantics for logic programs with two kinds of negation.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

AURA: A programming Language for Authorization and Audit

AURA: A Programming Language for Authorization and Audit

引用

13th ACM SIGPLAN international conference on Functional programming

作者： Jia, Limin Vaughan, Jeffrey A. Mazurak, Karl Zhao, Jianzhou Zarko, Luke Schorr, Joseph Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781595939197

this paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic constructs (e.g., principals and access control policies) in a uniform way. AURA is based on polymorphic DCC and uses dependent types to permit assertions that refer directly to AURA values while keeping computation out of the assertion level to ensure tractability. the main technical results of this paper include fully mechanically verified proofs of the decidability and soundness for AURA's type system, and a prototype typechecker and interpreter.

关键词： Access control Authorization logic Audit Type systems

来源：评论

学校读者我要写书评

暂无评论

A new model for scalable Θ-subsumption 26

A new model for scalable Θ-subsumption

引用

26th international conference on inductive logic programming (Short Papers), ILP 2016

作者： Leger, Hippolyte Bouthinon, Dominique Lebbah, Mustapha Azzag, Hanane Universite Paris 13 Sorbonne Paris Cite L.I.P.N UMR-CNRS 7030 VilletaneuseF-93430 France

the Θ-subsumption test is known to be a bottleneck in inductive logic programming. the state-of-the-art learning systems in this field are hardly scalable. So we introduce a new Θ-subsumption algorithm based on an Actor Model, with the aim of being able to decide subsumption on very large clauses. We use Akka, a powerful tool to build distributed actor systems based on the JVM and the Scala language.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：