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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,428 篇 会议
69 册 图书
55 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,260 篇 工学
- 1,245 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

387 篇 logic programmin...
141 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
48 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
34 篇 logics and meani...
28 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
21 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
15 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,540 篇 英文
8 篇 中文
4 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1552 条记录，以下是311-320 订阅

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

详细简洁

排序：

catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set programming 14th

<i>catnap</i>: Generating Test Suites of Constrained Combina...

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Banbara, Mutsunori Inoue, Katsumi Kaneyuki, Hiromasa Okimoto, Tenda Schaub, Torsten Soh, Takehide Tamura, Naoyuki Kobe Univ Nada Ku 1-1 Rokko Dai Kobe Hyogo 6578501 Japan NII Chiyoda Ku 2-1-2 Hitotsubashi Tokyo 1018430 Japan Univ Potsdam August Bebel Str 89 D-14482 Potsdam Germany

ISBN: (纸本)9783319616605;9783319616599

We develop an approach to test suite generation for Constrained Combinatorial Testing (CCT), one of the most widely studied combinatorial testing techniques, based on Answer Set programming (ASP). the resulting catnap system accepts a CCT instance in fact format and combines it with a first-order encoding for generating test suites, which can subsequently be solved by any off-the-shelf ASP systems. We evaluate the effectiveness of our approach by empirically contrasting it to the best known bounds obtained via dedicated implementations.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming with Graded Modality 14th

Answer Set Programming with Graded Modality

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Zhang, Zhizheng Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9783319616605;9783319616599

Answer set programming with graded modality (ASP(GM)) introduced in [6] provides an intuitive way for expressing modal concepts "at least as many as......" as well as "at most as many as......", and defaults. this paper studies the semantics of ASP(GM) and investigates its connection to the most recent language of epistemic specification (ASP(KM)) proposed in [3] and the answer set programming with epistemic negation (ASP(NOT)) presented in [5]. Particularly, we define a new approach to evaluating graded modalities in ASP(GM) such that ASP(GM) is compatible with ASP(KM) as well as ASP(NOT) at the semantic level.

关键词： Answer set Graded modality Introspection

来源：评论

学校读者我要写书评

暂无评论

moviola: Interpreting Dynamic logic Programs via Multi-shot Answer Set programming 14th

moviola: Interpreting Dynamic Logic Programs via Multi-shot ...

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Sabuncu, Orkunt Leite, Joao TED Univ Ankara Turkey Univ Nova Lisboa NOVA LINCS Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

the causal rejection-based update semantics assign meanings to a Dynamic logic Program (DLP), which is a sequence of logic programs each one updating the preceding ones. Although there are translations of DLPs under these update semantics to logic programs of Answer Set programming (ASP), they have not led to efficient and easy to use implementations. this is mainly because such translations aim offline solving in a sense that the resulting logic program is given to an answer set solver to compute models of the current DLP and for any future updates the whole process has to be repeated from scratch. We aim to remedy this situation by utilizing multi-shot ASP, composed of iterative answer set computations of a changing program without restarting from scratch at every step. To this end, we developed a system called moviola, utilizing the multi-shot answer set solver clingo. Using the system, a user can interactively write a DLP, update it, compute its models according to various semantics on the fly.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Epistemic Specifications with Probabilities 29

Epistemic Specifications with Probabilities

引用

29th Annual IEEE international conference on Tools with artificial intelligence (ICTAI)

作者： Zhang, Shutao Zhang, Zhizheng Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538638767

this paper develops a probabilistic-epistemic logic program language, PELP, by introducing probabilistic modal operators K-w and PL into LPMLN programs, where w is a sub-interval of [0, 1]. Intuitively, a probabilistic epistemic literal K(w)e denotes that e is known with a probability in w, and a probabilistic comparing literal PL(e(1), e(2)) denotes it is known that the probability of e(1) is less than the one of e(2). the semantics of the new language is based on the semantics of LPMLN and epistemic specifications. In this paper, we analyze the relationship between PELP and some other epistemic logic programming languages. We also propose an algorithm for solving PELP programs, and then investigate the application of PELP for modeling and solving the Monty Hall problem and a conformant planning problem with a threshold.

关键词： Epistemic logic Program Probabilistic logic Program Nonmontonic reasoning Probabilistic reasoning Conformant Probabilistic Planning

来源：评论

学校读者我要写书评

暂无评论

Contextual reasoning: Usually Birds Can Abductively Fly 14th

Contextual Reasoning: Usually Birds Can Abductively Fly

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Saldanha, Emmanuelle-Anna Dietz Hoelldobler, Steffen Pereira, Luis Moniz Tech Univ Dresden Int Ctr Computat Log D-01062 Dresden Germany North Caucasus Fed Univ Stavropol Russia Univ Nova Lisboa NOVA Lab Comp Sci & Informat Dept Informat Fac Ciencias & Tecnol P-2829516 Caparica Portugal

ISBN: (纸本)9783319616605;9783319616599

We present a new logic programming approach to contextual reasoning, based on the Weak Completion Semantics (WCS), the latter of which has been successfully applied in the past to adequately model various human reasoning tasks. One of the properties of WCS is the open world assumption with respect to undefined atoms. this is a characteristic that is different to other common logic programming semantics, a property that seems suitable when modeling human reasoning. Notwithstanding, we have noticed that the famous Tweety default reasoning example, originally introduced by Reiter, cannot be modeled straightforwardly under WCS. Hence, to address the issue and taking Pereira and Pinto's inspection points as inspiration, we develop a notion of contextual reasoning for which we introduce contextual logic programs. We reconsider the formal properties of WCS with respect to these and verify whether they still hold. Finally, we set forth contextual abduction and show that not only the original Tweety example can be nicely modeled within the new approach, but more sophisticated examples as well, where context plays an important role.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Answer Set Programs with Queries over Subprograms 14th

Answer Set Programs with Queries over Subprograms

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Redl, Christoph Tech Univ Wien Inst Informat Syst Favoritenstr 9-11 A-1040 Vienna Austria

ISBN: (纸本)9783319616605;9783319616599

Answer-Set programming (ASP) is a declarative programming paradigm. In this paper we discuss two related restrictions and present a novel modeling technique to overcome them: (1) Meta-reasoning about the collection of answer sets of a program is in general only possible by external postprocessing, but not within the program. this prohibits the direct continuation of reasoning based on the answer to the query over a (sub) program's answer sets. (2) the saturation programming technique exploits the minimality criterion for answer sets of a disjunctive ASP program to solve co-NP-hard problems, which typically involve checking if a property holds for all objects in a certain domain. However, the technique is advanced and not easily applicable by average ASP users;moreover, the use of default-negation within saturation encodings is limited. In this paper, we present an approach which allows for brave and cautious query answering over normal subprograms within a disjunctive program in order to address restriction (1). the query answer is represented by a dedicated atom within each answer set of the overall program, which paves the way also for a more intuitive alternative to saturation encodings and allows also using default-negation within such encodings, which addresses restriction (2).

关键词： Answer Set programming Nonmonotonic reasoning FLP semantics Meta programming Saturation

来源：评论

学校读者我要写书评

暂无评论

Adjudication of Coreference Annotations via Answer Set Optimization 14th

Adjudication of Coreference Annotations via Answer Set Optim...

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Schuller, Peter Marmara Univ Fac Engn Dept Comp Engn Istanbul Turkey

ISBN: (纸本)9783319616605;9783319616599

We describe the first automatic approach for merging coreference annotations obtained from multiple annotators into a single gold standard. Merging is subject to hard constraints (consistency) and optimization criteria (minimal divergence from annotators) and involves an equivalence relation over a large number of elements. We describe two representations of the problem in Answer Set programming and four objective functions suitable for the task. We provide two structurally different real-world benchmark datasets based on the METU-Sabanci Turkish Treebank, and we report our experiences in using the Gringo, Clasp, and Wasp tools for computing optimal adjudication results on these datasets.

关键词： Coreference resolution Adjudication Answer set programming

来源：评论

学校读者我要写书评

暂无评论

Nurse Scheduling via Answer Set programming 14th

Nurse Scheduling via Answer Set Programming

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Dodaro, Carmine Maratea, Marco Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9783319616605;9783319616599

the Nurse Scheduling problem (NSP) is a combinatorial problem that consists of assigning nurses to shifts according to given practical constraints. In previous years, several approaches have been proposed to solve different variants of the NSP. In this paper, an ASP encoding for one of these variants is presented, whose requirements have been provided by an Italian hospital. We also design a second encoding for the computation of "optimal" schedules. Finally, an experimental analysis has been conducted on real data provided by the Italian hospital using both encodings. Results are very positive: the state-of-the-art ASP system CLINGO is able to compute one year schedules in few minutes, and it scales well even when more than one hundred nurses are considered.

关键词： Answer Set programming Scheduling Nurse Scheduling Problem

来源：评论

学校读者我要写书评

暂无评论

plasp 3: Towards Effective ASP Planning 14th

<i>plasp</i> 3: Towards Effective ASP Planning

引用

14th international conference on logic programming and Nonmonotonic reasoning (LPNMR)

作者： Dimopoulos, Yannis Gebser, Martin Luehne, Patrick Romero, Javier Schaub, Torsten Univ Cyprus Nicosia Cyprus Univ Potsdam Potsdam Germany

ISBN: (纸本)9783319616605;9783319616599

We describe the new version of the PDDL-to-ASP translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by SAT planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multi-valued fluents in order to capture both PDDL as well as SAS planning formats. third, enabled by multi-shot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Towards the Distributed logic programming of Intelligent Visual Surveillance Applications 15th

Towards the Distributed Logic Programming of Intelligent Vis...

引用

15th Mexican international conference on artificial intelligence (MICAI)

作者： Morozov, Alexei A. Sushkova, Olga S. Polupanov, Alexander F. Kotelnikov Inst Radio Engn & Elect RAS Mokhovaya 11-7 Moscow 125009 Russia Moscow State Univ Psychol & Educ Sretenka 29 Moscow 107045 Russia

ISBN: (纸本)9783319624280;9783319624273

An extension of the Actor Prolog language with the ability of distributed logic programming is demonstrated. this language extension is developed for experimenting with distributed logic programming and declarative agent approach to intelligent visual surveillance. An approach to resolving the contradiction between the strong typing of Actor Prolog and the independence of software agents is proposed. Remote calls of Actor Prolog predicates are implemented using the object-oriented features of Actor Prolog, translation of Actor Prolog to Java, and the Java RMI protocol. An example of logic program communication based on the remote predicate calls is examined.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：