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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

161 篇 会议
16 册 图书
6 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

133 篇 工学
- 127 篇 计算机科学与技术...
- 59 篇 软件工程
- 14 篇 电气工程
- 13 篇 控制科学与工程
- 6 篇 机械工程
- 5 篇 信息与通信工程
- 4 篇 建筑学
- 2 篇 交通运输工程
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 环境科学与工程（可...
- 1 篇 安全科学与工程
23 篇 理学
- 18 篇 数学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
- 1 篇 统计学（可授理学、...
9 篇 管理学
- 8 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
2 篇 艺术学
- 2 篇 设计学（可授艺术学...
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 教育学

主题

56 篇 logic programmin...
14 篇 mathematical log...
12 篇 logics and meani...
10 篇 artificial intel...
9 篇 programming lang...
8 篇 software enginee...
7 篇 computer circuit...
7 篇 formal logic
6 篇 semantics
5 篇 temporal logic
4 篇 optimization
4 篇 programming tech...
4 篇 algorithm analys...
4 篇 knowledge repres...
3 篇 fuzzy logic
3 篇 programmable log...
3 篇 higher-order log...
3 篇 programming
3 篇 symbolic and alg...
3 篇 computer communi...

机构

3 篇 new mexico state...
2 篇 tu wien austria
2 篇 tech univ munich...
2 篇 eth dept comp sc...
2 篇 institute of log...
2 篇 katholieke univ ...
2 篇 univ massachuset...
2 篇 imdea software i...
2 篇 michigan state u...
2 篇 univ hawaii dept...
2 篇 suny stony brook...
2 篇 temple univ dept...
1 篇 univ calabria de...
1 篇 national institu...
1 篇 escola politécni...
1 篇 laboratoire pps ...
1 篇 new mexico state...
1 篇 university of te...
1 篇 univ aizu grad s...
1 篇 department of in...

作者

3 篇 eiter thomas
2 篇 pontelli e
2 篇 giovannetti tani...
2 篇 leone nicola
2 篇 avrunin gs
2 篇 sakama chiaki
2 篇 yamaguchi takehi...
2 篇 mehta f
2 篇 fink m
2 篇 woltran stefan
2 篇 martono niken pr...
2 篇 eiter t
2 篇 serebrenik a
2 篇 sciavicco guido
2 篇 ohwada hayato
2 篇 faber wolfgang
2 篇 abe keisuke
2 篇 nipkow t
2 篇 dillon lk
2 篇 inoue katsumi

语言

182 篇 英文
1 篇 中文

检索条件"任意字段=19th International Conference on Logic Programming, ICLP 2003"

共 183 条记录，以下是91-100 订阅

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

详细简洁

排序：

Don't Fear Optimality: Sampling for Probabilistic-logic Sequence Models

Don't Fear Optimality: Sampling for Probabilistic-Logic Sequ...

引用

19th international conference on Inductive logic programming

作者： thon, Ingo Katholieke Univ Leuven Louvain Belgium

ISBN: (纸本)9783642138393

One of the current challenges in artificial intelligence is modeling dynamic environments that change due to the actions or activities undertaken by people or agents. the task of inferring hidden states, e.g. the activities or intentions of people, based on observations is called filtering. Standard probabilistic models such as Dynamic Bayesian Networks are able to solve this task efficiently using approximative methods such as particle filters. However, these models do not support logical or relational representations. the key contribution of this paper is the upgrade of a particle filter algorithm for use with a probabilistic logical representation through the definition of a proposal distribution. the performance of the algorithm depends largely on how well this distribution fits the target distribution. We adopt the idea of logical compilation into Binary Decision Diagrams for sampling. this allows us to use the optimal proposal distribution which is normally prohibitively slow.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

Distributed control flow with classical modal logic

Distributed control flow with classical modal logic

引用

19th international Workshop on Computer Science logic, CSL 2005 and 14th Annual conference of the EACSL

作者： Murphy VII, Tom Crary, Karl Harper, Robert Carnegie Mellon University United States

In previous work we presented a foundational calculus for spatially distributed computing based on intuitionistic modal logic. With the modalities and we were able to capture two key invariants: the mobility of portable code and the locality of fixed resources. this work investigates issues in distributed control flow through a similar propositions-as-types interpretation of classical modal logic. the resulting programming language is enhanced with the notion of a network-wide continuation, through which we can give computational interpretation of classical theorems (such as A = ¬¬A). Such continuations are also useful primitives for building higher-level constructs of distributed computing. the resulting system is elegant, logically faithful, and computationally reasonable. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Debugging logic programs under the answer set semantics

Debugging logic programs under the answer set semantics

引用

3rd international Workshop on Answer Set programming: Advances in theory and Implementation, ASP 2005, Co-located Event with the 19th international Joint conference on Artificial Intelligence, IJCAI 2005

作者： Brain, Martin De Vos, Marina Department of Computer Science University of Bath Bath United Kingdom

this paper discusses the background, algorithms and implementation techniques to support programmers in 'debugging' logic programs under the answer set semantics. We first investigate what constitutes an error in such programs and which classes of errors exist. this is used to motivate techniques and algorithms that respectively eliminate certain classes of errors and explain how an error occurred and why it occurred. Finally, details of the IDEAS (Interactive Development and Evaluation tool for Answer Set Semantics) system are given, a prototype version of which implements all of the techniques described.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

the complexity of clausal fragments of LTL

The complexity of clausal fragments of LTL

引用

19th international conference on logic for programming, Artificial Intelligence, and Reasoning, LPAR 2013

作者： Artale, Alessandro Kontchakov, Roman Ryzhikov, Vladislav Zakharyaschev, Michael KRDB Research Centre Free University of Bozen-Bolzano I-39100 Bolzano Italy Department of Computer Science and Information Systems Birkbeck University of London London WC1E 7HX United Kingdom

We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (,

ISBN: (纸本)9783642452208

We introduce and investigate a number of fragments of propositional temporal logic LTL over the flow of time (,

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Diagnosis and Repair for Synthesis from Signal Temporal logic Specifications 19

Diagnosis and Repair for Synthesis from Signal Temporal Logi...

引用

19th international conference on Hybrid Systems - Computation and Control (HSCC)

作者： Ghosh, Shromona Sadigh, Dorsa Nuzzo, Pierluigi Raman, Vasumathi Donze, Alexandre Sangiovanni-Vincentelli, Alberto Sastry, S. Shankar Seshia, Sanjit A. Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA United Technol Res Ctr Berkeley CA USA

ISBN: (纸本)9781450339551

We address the problem of diagnosing and repairing specifications for hybrid systems, formalized in signal temporal logic (STL). Our focus is on automatic synthesis of controllers from specifications using model predictive control. We build on recent approaches that reduce the controller synthesis problem to solving one or more mixed integer linear programs (MILPs), where infeasibility of an MILP usually indicates unrealizability of the controller synthesis problem. Given an infeasible STL synthesis problem, we present algorithms that provide feedback on the reasons for unrealizability, and suggestions for making it realizable. Our algorithms are sound and complete relative to the synthesis algorithm, i.e., they provide a diagnosis that makes the synthesis problem infeasible, and always terminate with a non-trivial specification that is feasible using the chosen synthesis method, when such a solution exists. We demonstrate the effectiveness of our approach on controller synthesis for various cyber-physical systems, including an autonomous driving application and an aircraft electric power system.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

A tabling implementation based on variables with multiple bindings

A tabling implementation based on variables with multiple bi...

引用

25th international conference on logic programming, iclp 2009

作者： Chico De Guzmán, Pablo Carro, Manuel Hermenegildo, Manuel School of Computer Science Univ. Politécnica de Madrid Spain IMDEA Software Spain

ISBN: (纸本)3642028454

Suspension-based tabling systems have to save and restore computation states belonging to OR branches. Stack freezing combined with (forward) trailing is among the better-known implementation approaches for this purpose. Resuming a goal using this technique reinstalls the bindings for all the variables in the environment where the goal was suspended. In this paper we explore an alternative approach where variables can keep track of several bindings, associated with suspensions. Resuming a goal boils down to determining which suspension has to be resumed, in order to select, when dereferencing, the bindings which were active at the moment of suspending. We present the ideas behind this approach, highlight several advantages over other suspension-based implementations, and perform an experimental evaluation. We also recall the similarity between OR-parallelism and suspension-based implementations of tabling, and discuss similarities with the Version Vectors Method, among others. © 2009 Springer Berlin Heidelberg.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Local and symbolic bisimulation using tabled constraint logic programming 17

引用

17th international conference on logic programming, iclp 2001

作者： Basu, Samik Mukund, Madhavan Ramakrishnan, C.R. Ramakrishnan, I.V. Verma, Rakesh Department of Computer Science State University of New York at Stony Brook Stony BrookNY United States Chennai Mathematical Institute Chennai India Department of Computer Science University of Houston TX United States

ISBN: (纸本)9783540429357

Bisimulation is a fundamental notion that characterizes behavioral equivalence of concurrent systems. In this paper, we study the problem of encoding efficient bisimulation checkers for finite- as well as infinite-state systems as logic programs. We begin with a straightforward and short (less than 10 lines) encoding of finite-state bisimulation checker as a tabled logic program. In a goal-directedsystem like XSB, this encoding yields a local bisimulation checker: one where state space exploration is done only until a dissimilarity is revealed. More importantly, the logic programming formulation of local bisimulation can be extended to do symbolic bisimulation for checking the equivalence of infinite-state concurrent systems represented by symbolic transition systems. We show how the two variants of symbolic bisimulation (late and early equivalences) can be formulated as a tabled constraint logic program in a way that precisely brings out their differences. Finally, we show that our symbolic bisimulation checker actually outperforms non-symbolic checkers even for relatively small finite-state systems. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

An experimental study of search strategies and heuristics in answer set programming

An experimental study of search strategies and heuristics in...

引用

作者： Giunchiglia, Enrico Maratea, Marco STAR-Lab. DIST University of Genova viale Francesco Causa 13 16145 Genova Italy

Answer Set programming (ASP) and propositional satisfiability (SAT) are closely related. In some recent work we have shown that, on a wide set of logic programs called "tight", the main search procedures used by ASP and SAT systems are equivalent, i.e., that they explore search trees with the same branching nodes. In this paper, we focus on the experimental evaluation of different search strategies, heuristics and their combinations that have been shown to be effective in the SAT community, in ASP systems. Our results show that, despite the strong link between ASP and SAT, it is not always the case that search strategies, heuristics and/or their combinations that currently dominate in SAT are also bound to dominate in ASP. We provide a detailed experimental evaluation for this phenomenon and we shed light on future development of efficient Answer Set solvers.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Every formula-based logic program has a least infinite-valued model 1

引用

19th international conference on Applications of Declarative programming and Knowledge Management, INAP 2011 and 25th Workshop on logic programming, WLP 2011

作者： Lüdecke, Rainer Wilhelm-Schickard-Institut Universität Tübingen Sand 13 Tübingen72076 Germany

ISBN: (数字)9783642415241

ISBN: (纸本)9783642415234

Every definite logic program has as its meaning a least Herbrand model with respect to the program-independent ordering ⊆. In the case of normal logic programs there do not exist least models in general. However, according to a recent approach by Rondogiannis and Wadge, who consider infinite-valued models, every normal logic program does have a least model with respect to a program-independent ordering. We show that this approach can be extended to formula-based logic programs (i.e., finite sets of rules of the form A ← where A is an atom and an arbitrary first-order formula). We construct for a given program P an interpretation MP and show that it is the least of all models of P. © Springer-Verlag Berlin Heidelberg 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Assessing Drivers’ Situation Awareness in Semi-Autonomous Vehicles 39

Assessing Drivers’ Situation Awareness in Semi-Autonomous V...

引用

39th international conference on logic programming, iclp 2023

作者： Suchan, Jakob Osterloh, Jan-Patrick Institute for Systems Engineering for Future Mobility Oldenburg Germany

Semi-autonomous driving, as it is already available today and will eventually become even more accessible, implies the need for driver and automation system to reliably work together in order to ensure safe driving. A particular challenge in this endeavour are situations in which the vehicle’s automation is no longer able to drive and is thus requesting the human to take over. In these situations the driver has to quickly build awareness for the traffic situation to be able to take over control and safely drive the car. Within this context we present a software and hardware framework to asses how aware the driver is about the situation and to provide human-centred assistance to help in building situation awareness. the framework is developed as a modular system within the Robot Operating System (ROS) with modules for sensing the environment and the driver state, modelling the driver’s situation awareness, and for guiding the driver’s attention using specialized Human Machine Interfaces (HMIs). A particular focus of this paper is on an Answer Set programming (ASP) based approach for modelling and reasoning about the driver’s interpretation and projection of the scene. this is based on scene data, as well as eye-tracking data reflecting the scene elements observed by the driver. We present the overall application and discuss the role of semantic reasoning and modelling cognitive functions based on logic programming in such applications. Furthermore we present the ASP approach for interpretation and projection of the driver’s situation awareness and its integration within the overall system in the context of a real-world use-case in simulated as well as in real driving. © Jakob Suchan and Jan-Patrick Osterloh.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：