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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

511 篇 期刊文献
350 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

824 篇 工学
- 790 篇 计算机科学与技术...
- 400 篇 软件工程
- 57 篇 电气工程
- 24 篇 信息与通信工程
- 24 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
407 篇 理学
- 388 篇 数学
- 11 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 科学技术史(分学科...
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 系统科学
- 1 篇 地理学
27 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
14 篇 哲学
- 8 篇 哲学
10 篇 法学
- 9 篇 法学
- 1 篇 社会学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 农学
1 篇 经济学
- 1 篇 应用经济学

主题

872 篇 answer set progr...
78 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
32 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
24 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
19 篇 stable model sem...
17 篇 stream reasoning
16 篇 aggregates
16 篇 computational co...
15 篇 strong equivalen...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 machine learning

机构

35 篇 univ potsdam pot...
19 篇 univ calabria ar...
17 篇 univ calabria de...
15 篇 sabanci univ fac...
14 篇 univ genoa dibri...
14 篇 univ calabria de...
12 篇 univ a coruna la...
12 篇 univ genoa genoa
11 篇 univ politecn ma...
11 篇 texas tech univ ...
11 篇 vienna univ tech...
11 篇 vrije univ bruss...
11 篇 new mexico state...
10 篇 tu wien austria
10 篇 univ calabria de...
10 篇 vienna univ tech...
10 篇 univ klagenfurt ...
10 篇 univ texas austi...
8 篇 macquarie univ d...
8 篇 univ calabria co...

作者

49 篇 schaub torsten
44 篇 alviano mario
43 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
32 篇 eiter thomas
29 篇 maratea marco
28 篇 leone nicola
28 篇 gebser martin
27 篇 calimeri frances...
24 篇 fandinno jorge
23 篇 erdem esra
22 篇 ianni giovambatt...
20 篇 lifschitz vladim...
20 篇 gupta gopal
19 篇 zangari jessica
19 篇 perri simona
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 faber wolfgang

语言

849 篇 英文
18 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

检索条件"主题词=Answer Set Programming"

共 872 条记录，以下是691-700 订阅

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

详细简洁

排序：

Event-Based and Scenario-Based Causality for Computational Ethics 17

Event-Based and Scenario-Based Causality for Computational E...

引用

17th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS)

作者： Berreby, Fiona Bourgne, Gauvain Ganascia, Jean-Gabriel Sorbonne Univ CNRS UMR 7606 LIP6 Paris France

ISBN: (纸本)9781450356497

This paper makes use of high-level action languages to investigate aspects of causality that are central to ethical reasoning. We identify properties that causal relations assume and that determine how, as well as to what extent, we may ascribe ethical responsibility on their basis. The paper is structured in three parts. First, we present an extension of the Event Calculus that enables the agent to generate plans of actions, with the particularity that they integrate both actions and omissions. Second, we present an account of event-based causality that is grounded in the architecture of event preconditions and effects, and that distinguishes four types of causal relations contingent on the nature of the entities that compose them. Namely, it discriminates actions and omissions from automatic events, and produced outcomes from avoided ones. Third, we examine notions of scenario-based causality whose role it is to scrutinise and buttress the causal relations previously identified. Inquiring into the other possible versions of modelled scenarios, we account for simple counter-factual validity ("Had I not acted so, would this outcome still be true?"), criticality ("Could anything else have led to this outcome?"), extrinsic necessity ("Had I not produced it, was this outcome even avoidable?"), and elicited necessity ("Have I made this outcome unavoidable?"). The model is implemented in answer set programming.

关键词： Computational Ethics answer set programming Event Calculus Reasoning about Actions and Change Causality Counter-factuals

来源：评论

学校读者我要写书评

暂无评论

A Parallel ASP Instantiator Based on DLV

A Parallel ASP Instantiator Based on DLV

引用

Workshop on Declarative Aspects of Multicore programming 2010

作者： Perri, Simona Ricca, Francesco Sirianni, Marco Univ Calabria Dipartimento Matemat I-87030 Arcavacata Di Rende Italy

ISBN: (纸本)9781605588599

answer set programming (ASP) is a purely-declarative logic programming language allowing for disjunction and nonmonotonic negation. The evaluation of ASP programs is traditionally carried out in two steps. In the first step an input program 2 undergoes the so-called instantiation (or grounding) process, which produces a program P' semantically equivalent to 7, but not containing any variable;in turn, P' is evaluated by using a backtracking search algorithm in the second step. It is well-known that instantiation is important for the efficiency of the whole evaluation, might becomes a bottleneck in common situations, and is particularly crucial when huge input data has to be dealt with. In the last few years, several instantiators have been proposed but none of them is able to take advantage from the latest hardware offering SMP (Symmetric Multi Processing) also for entry-level systems and PCs. This paper presents a new parallel version of the instantiator of DLV which is able to exploit the processing power offered by multi-core/multi-processor SMP machines. In particular, the employed parallelization methods, load-balancing and granularity control heuristics, tailored for parallel ASP instantiation process are described. The results of an experimental analysis are also presented, which confirm that multi-core/multi-processor technology can be efficiently exploited for ASP instantiation.

关键词： answer set programming Instantiation Grounding Parallelism

来源：评论

学校读者我要写书评

暂无评论

The jobs puzzle: Taking on the challenge via controlled natural language processing

The jobs puzzle: Taking on the challenge via controlled natu...

引用

29th International Conference on Logic programming ICLP

作者： Schwitter, Rolf Macquarie Univ Dept Comp Sydney NSW 2109 Australia

In this paper we take on Stuart C. Shapiro's challenge of solving the Jobs Puzzle automatically and do this via controlled natural language processing. Instead of encoding the puzzle in a formal language that might be difficult to use and understand, we employ a controlled natural language as a high-level specification language that adheres closely to the original notation of the puzzle and allows us to reconstruct the puzzle in a machine-processable way and add missing and implicit information to the problem description. We show how the resulting specification can be translated into an answer set program and be processed by a state-of-the-art answer set solver to find the solutions to the puzzle.

关键词： Controlled natural language knowledge representation answer set programming

来源：评论

学校读者我要写书评

暂无评论

Logical Modelling of Inhibition and Competition in Biochemical Networks 8

Logical Modelling of Inhibition and Competition in Biochemic...

引用

8th International Conference on Complex, Intelligent and Software Intensive Systems (CISIS)

作者： Ray, Oliver Rozanski, Robert Univ Bristol Dept Comp Sci Bristol BS8 1TH Avon England Univ Manchester Sch Comp Sci Manchester M13 9PL Lancs England

ISBN: (纸本)9781479943258

This paper applies the logic-based formalism of answer set programming (ASP) to the modelling of competition, inhibition and cycles in biochemical networks. In particular, it introduces a generic framework that unifies the competitive and inhibitory mechanisms proposed in the literature along with their complementary approaches to reasoning about loops. We show how the nonmonotonic effects of competition and inhibition can be naturally encoded in the formalism of ASP and that the different ways of handling loops correspond to the computation of stable and supported models. We also show that inhibitory models are currently more general than competitive models and we argue that that both interpretations of loops are justified in some applications.

关键词： answer set programming biological networks competition inhibition Inhibition (Psychology) Competition Loops Biochemical network formalism Inhibition Modeling answer logical Reasoning

来源：评论

学校读者我要写书评

暂无评论

eclingo : A Solver for Epistemic Logic Programs

eclingo : A Solver for Epistemic Logic Programs

引用

36th International Conference on Logic programming (ICLP)

作者： Cabalar, Pedro Fandinno, Jorge Garea, Javier Romero, Javier Schaub, Torsten Univ A Coruna La Coruna Spain Univ Potsdam Potsdam Germany

We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the answer set programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.

关键词： answer set programming Epistemic Logic Programs Non-Monotonic Reasoning Conformant Planning

来源：评论

学校读者我要写书评

暂无评论

Reliability Analysis in Less than 200 Lines of Code 12

Reliability Analysis in Less than 200 Lines of Code

引用

12th IEEE Latin America Symposium on Circuits and System (LASCAS)

作者： Breitenreiter, Anselm Schrape, Oliver Andjelkovic, Marko Krstic, Milos IHP Leibniz Inst Innovat Mikroelekt Frankfurt Oder Germany Univ Potsdam Potsdam Germany

ISBN: (纸本)9781728176703

answer set programming (ASP) is pro- posed as a compact and versatile approach to circuit analysis. By the example of upsets in registers we demonstrate how to perform reliability analysis in less than 200 lines of code. By an efficient problem encoding we achieve an input data format similar to a Verilog netlist so that extensive preprocessing is avoided. No development of algorithms is required as the analysis relies on elaborate and highly optimized ASP solvers. Exemplary results for a wide range of circuits are presented and potential optimizations are pointed out.

关键词： Reliability analysis partial fault tolerance error propagation answer set programming radhard design single event upsets

来源：评论

学校读者我要写书评

暂无评论

A program-level approach to revising logic programs under the answer set semantics

A program-level approach to revising logic programs under th...

引用

26th International Conference on Logic programming (ICLP)

作者： Delgrande, James P. Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada

An approach to the revision of logic programs under the answer set semantics is presented. For programs P and Q, the goal is to determine the answer sets that correspond to the revision of P by Q, denoted P * Q. A fundamental principle of classical (AGM) revision, and the one that guides the approach here, is the success postulate. In AGM revision, this stipulates that alpha is an element of K * alpha. By analogy with the success postulate, for programs P and Q, this means that the answer sets of Q will in some sense be contained in those of P * Q. The essential idea is that for P * Q, a three-valued answer set for Q, consisting of positive and negative literals, is first determined. The positive literals constitute a regular answer set, while the negated literals make up a minimal set of naf literals required to produce the answer set from Q. These literals are propagated to the program P, along with those rules of Q that are not decided by these literals. The approach differs from work in update logic programs in two main respects. First, we ensure that the revising logic program has higher priority, and so we satisfy the success postulate;second, for the preference implicit in a revision P * Q, the program Q as a whole takes precedence over P, unlike update logic programs, since answer sets of Q are propagated to P. We show that a core group of the AGM postulates are satisfied, as are the postulates that have been proposed for update logic programs.

关键词： answer set programming belief change belief revision

来源：评论

学校读者我要写书评

暂无评论

ASP-Driven BDI-Planning Agents in Virtual 3D Environments 14th

ASP-Driven BDI-Planning Agents in Virtual 3D Environments

引用

14th German Conference on Multiagent System Technologies (MATES)

作者： Antakli, Andre Zinnikus, Ingo Klusch, Matthias German Res Ctr Artificial Intelligence DFKI Agents & Simulated Real Dept Saarland Univ Campus D-66123 Saarbrucken Germany

ISBN: (纸本)9783319458892;9783319458885

This paper introduces the agent platform HumanSim, a combination of the BDI-paradigm and answer set programming (ASP), to simulate entities in three-dimensional virtual environments. We show how ASP can be used to (i) annotate a virtual three-dimensional world and (ii) to model the goal selection behavior of a BDI agent. Using this approach it is possible to model the agent domain and its behavior - reactive or foresighted - with ASP. To demonstrate the practical use of HumanSim, we present a three-dimensional planning and simulation application, in which worker agents are driven by HumanSim in the shop floor domain. Furthermore, we show the results of an evaluation of HumanSim in the former mentioned simulation application.

关键词： BDI agents Intelligent virtual agents Virtual environments answer set programming IVA architecture

来源：评论

学校读者我要写书评

暂无评论

Towards closed world reasoning in dynamic open worlds

Towards closed world reasoning in dynamic open worlds

引用

26th International Conference on Logic programming (ICLP)

作者： Slota, Martin Leite, Joao Univ Nova Lisboa CENTRIA P-2829516 Caparica Portugal Univ Nova Lisboa Dept Informat P-2829516 Caparica Portugal

The need for integration of ontologies with nonmonotonic rules has been gaining importance in a number of areas, such as the Semantic Web. A number of researchers addressed this problem by proposing a unified semantics for hybrid knowledge bases composed of both an ontology (expressed in a fragment of first-order logic) and nonmonotonic rules. These semantics have matured over the years, but only provide solutions for the static case when knowledge does not need to evolve. In this paper we take a first step towards addressing the dynamics of hybrid knowledge bases. We focus on knowledge updates and, considering the state of the art of belief update, ontology update and rule update, we show that current solutions are only partial and difficult to combine. Then we extend the existing work on ABox updates with rules, provide a semantics for such evolving hybrid knowledge bases and study its basic properties. To the best of our knowledge, this is the first time that an update operator is proposed for hybrid knowledge bases.

关键词： belief change belief update hybrid knowledge bases ontologies rules description logics answer set programming semantic web

来源：评论

学校读者我要写书评

暂无评论

Towards ILP-Based LTLf Passive Learning 32nd

Towards ILP-Based LTLf Passive Learning

引用

32nd International Conference on Inductive Logic programming (ILP)

作者： Ielo, Antonio Law, Mark Fionda, Valeria Ricca, Francesco De Giacomo, Giuseppe Russo, Alessandra Univ Calabria Arcavacata Di Rende Italy ILASP Ltd Grantham England Univ Oxford Oxford England Imperial Coll London England

ISBN: (纸本)9783031492983;9783031492990

Inferring a LTLf formula from a set of example traces, also known as passive learning, is a challenging task for model-based techniques. Despite the combinatorial nature of the problem, current state-of-the-art solutions are based on exhaustive search. They use an example at the time to discard a single candidate formula at the time, instead of exploiting the full set of examples to prune the search space. This hinders their applicability when examples involve many atomic propositions or when the target formula is not small. This short paper proposes the first ILP-based approach for learning LTLf formula from a set of example traces, using a learning from answer sets system called ILASP. It compares it to both pure SAT-based techniques and the exhaustive search method. Preliminary experimental results show that our approach improves on previous SAT-based techniques and that has the potential to overcome the limitation of an exhaustive search by optimizing over the full set of examples. Further research directions for the ILP-based LTLf passive learning problem are also discussed.

关键词： answer set programming Linear temporal logic over finite traces Learning from answer sets

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：