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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

6,088 篇 会议
2,200 篇 期刊文献
99 册 图书
18 篇 学位论文
1 篇 科技报告

馆藏范围

8,402 篇 电子文献
6 种 纸本馆藏

日期分布

学科分类号

5,725 篇 工学
- 5,318 篇 计算机科学与技术...
- 3,509 篇 软件工程
- 566 篇 电气工程
- 304 篇 控制科学与工程
- 169 篇 信息与通信工程
- 84 篇 电子科学与技术（可...
- 59 篇 机械工程
- 39 篇 生物医学工程（可授...
- 39 篇 生物工程
- 36 篇 建筑学
- 29 篇 土木工程
- 26 篇 材料科学与工程（可...
- 25 篇 仪器科学与技术
1,422 篇 理学
- 1,258 篇 数学
- 118 篇 统计学（可授理学、...
- 75 篇 生物学
- 69 篇 系统科学
- 50 篇 物理学
- 26 篇 科学技术史(分学科...
594 篇 管理学
- 333 篇 图书情报与档案管...
- 294 篇 管理科学与工程(可...
- 118 篇 工商管理
64 篇 法学
- 39 篇 社会学
- 24 篇 法学
52 篇 哲学
- 36 篇 哲学
49 篇 教育学
- 44 篇 教育学
49 篇 医学
- 36 篇 基础医学(可授医学...
- 34 篇 临床医学
35 篇 文学
- 25 篇 外国语言文学
34 篇 农学
- 25 篇 作物学
25 篇 经济学
16 篇 艺术学
4 篇 历史学
2 篇 军事学

主题

8,406 篇 logic programmin...
603 篇 computer science
473 篇 computer languag...
339 篇 application soft...
306 篇 artificial intel...
244 篇 programming prof...
177 篇 computer archite...
173 篇 programmable log...
173 篇 hardware
168 篇 control systems
153 篇 computational mo...
153 篇 logic design
151 篇 prototypes
149 篇 concurrent compu...
148 篇 laboratories
144 篇 object oriented ...
144 篇 software enginee...
136 篇 functional progr...
130 篇 costs
129 篇 semantics

机构

33 篇 university of po...
31 篇 univ minho ctr a...
28 篇 tu wien austria
27 篇 new mexico state...
24 篇 univ pisa dipart...
23 篇 katholieke univ ...
22 篇 vienna univ tech...
19 篇 university of ca...
18 篇 univ kentucky de...
17 篇 univ potsdam pot...
17 篇 katholieke univ ...
15 篇 univ evora escol...
14 篇 suny stony brook...
14 篇 univ manchester ...
13 篇 texas tech univ ...
13 篇 university of co...
13 篇 univ minho dept ...
12 篇 univ maryland de...
12 篇 school of comput...
12 篇 univ london impe...

作者

82 篇 schaub torsten
57 篇 ricca francesco
54 篇 vicente henrique
51 篇 gebser martin
50 篇 eiter thomas
50 篇 neves jose
49 篇 woltran stefan
43 篇 faber wolfgang
39 篇 leone nicola
38 篇 son tran cao
37 篇 pontelli enrico
37 篇 cabalar pedro
31 篇 lifschitz vladim...
30 篇 gupta gopal
29 篇 denecker marc
28 篇 sakama chiaki
28 篇 maratea marco
26 篇 proietti maurizi...
26 篇 lierler yuliya
26 篇 inoue katsumi

语言

8,020 篇 英文
334 篇 其他
33 篇 中文
7 篇 日文
4 篇 俄文
2 篇 德文
2 篇 法文
2 篇 葡萄牙文
1 篇 斯洛伐克文
1 篇 土耳其文

检索条件"主题词=Logic programming"

共 8406 条记录，以下是711-720 订阅

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

详细简洁

排序：

Temporal modalities in answer set programming 27

Temporal modalities in answer set programming

引用

27th International Symposium on Temporal Representation and Reasoning, TIME 2020

作者： Cabalar, Pedro University of Corunna Spain

ISBN: (纸本)9783959771672

Based on the answer set (or stable model) semantics for logic programs, Answer Set programming (ASP) has become one of the most successful paradigms for practical Knowledge Representation and problem solving. Although ASP is naturally equipped for solving static combinatorial problems up to NP complexity (or ΣP2 in the disjunctive case) its application to temporal scenarios has been frequent since its very beginning, partly due to its early use for reasoning about actions and change. Temporal problems normally suppose an extra challenge for ASP for several reasons. On the one hand, they normally raise the complexity (in the case of classical planning, for instance, it becomes PSPACE-complete), although this is usually accounted for by making repeated calls to an ASP solver. On the other hand, temporal scenarios also pose a representational challenge, since the basic ASP language does not support temporal expressions. To fill this representational gap, a temporal extension of ASP called Temporal Equilibrium logic (TEL) was proposed in and extensively studied later. This formalism constitutes a modal, linear-time extension of Equilibrium logic which, in its turn, is a complete logical characterisation of (standard) ASP based on the intermediate logic of Here-and-There (HT). As a result, TEL is an expressive non-monotonic modal logic that shares the syntax of Linear-Time Temporal logic (LTL) but interprets temporal formulas under a non-monotonic semantics that properly extends stable models. © Pedro Cabalar;licensed under Creative Commons License CC-BY 27th International Symposium on Temporal Representation and Reasoning (TIME 2020).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A Computational Approach for Predicting Individuals' Response Patterns in Human Syllogistic Reasoning 42

A Computational Approach for Predicting Individuals' Respons...

引用

42nd Annual Meeting of the Cognitive Science Society: Developing a Mind: Learning in Humans, Animals, and Machines, CogSci 2020

作者： Dietz Saldanha, Emmanuelle-Anna Schambach, Robert International Center for Computational Logic TU Dresden Germany

One challenge within cognitive psychology on human reasoning is modeling a wide range of tasks within a certain theory. Recently, a meta-study on human syllogistic reasoning has shown that none of the established theories seemed to adequately match the human data. Possible reasons for this sobering result could be that (i) these theories do not account for differences among reasoners and (ii) they presuppose the same assumptions throughout all 64 syllogistic reasoning tasks. In this paper, we will address both aspects by proposing clustering by principle patterns for syllogistic reasoning based on cognitive principles, which have their roots in the literature of cognitive science and philosophy of language. These principles determine how the tasks are formally represented within the weak completion semantics, a logic programming approach that has already been successfully applied for modeling various human reasoning episodes. We will develop a generic cognitive characterization of (i) the reasoners and (ii) the tasks by integrating the results of a machine learning algorithm with underlying cognitive principles. These principles provide a cognitively plausible characterization of the response patterns that cover the population of reasoners. Clustering by principle patterns achieves the highest prediction accuracy compared to the available benchmark models, and gives insights to the differences among (i) the reasoners and among (ii) the explaining principles throughout the tasks. © 2020 The Author(s)

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Competition report: CHC-COMP-20 8

Competition report: CHC-COMP-20

引用

8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020

作者： Rümmer, Philipp Uppsala University Sweden

CHC-COMP-201 is the third competition of solvers for Constrained Horn Clauses. In this year, 9 solvers participated at the competition, and were evaluated in four separate tracks on problems in linear integer arithmetic, linear real arithmetic, and arrays. The competition was run in the first week of May 2020 using the StarExec computing cluster. This report gives an overview of the competition design, explains the organisation of the competition, and presents the competition results. © 2020 Open Publishing Association. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

GPU-Based Parallelism for ASP-Solving 22nd

GPU-Based Parallelism for ASP-Solving

引用

22nd International Conference on Applications of Declarative programming and Knowledge Management, INAP 2019, the 33rd Workshop on logic programming, WLP 2019, and the 27th Workshop on Functional and Constraint logic programming, WFLP 2019

作者： Dovier, Agostino Formisano, Andrea Vella, Flavio Dipartimento di Scienze Matematiche Informatiche e Fisiche Università di Udine Udine Italy Dipartimento di Matematica e Informatica Università di Perugia Perugia Italy Facoltà di Scienze e Tecnologie Informatiche Libera Università di Bolzano Bolzano Italy

ISBN: (纸本)9783030467135

Answer Set programming (ASP) has become the paradigm of choice in the field of logic programming and non-monotonic reasoning. With the design of new and efficient solvers, ASP has been successfully adopted in a wide range of application domains. Recently, with the advent of GPU Computing, which allowed the use of modern parallel Graphical Processing Units (GPUs) for general-purpose computing, new opportunities for accelerating ASP computation has arisen. In this paper, we describe a new approach for solving ASP that exploits the parallelism provided by GPUs. The design of a GPU-based solver poses various challenges due to the peculiarities of GPU in terms of both programmability and architecture capabilities with respect to the intrinsic nature of the satisfiability problems, which exposes poor parallelism. © 2020, Springer Nature Switzerland AG.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Dischargeable Obligations in the ScIFF Framework

Dischargeable Obligations in the ScIFF Framework

引用

作者： Alberti, Marco Gavanelli, Marco Lamma, Evelina Riguzzi, Fabrizio Satoh, Ken Zese, Riccardo Dipartimento di Matematica e Informatica University of Ferrara Via Saragat 1 FerraraI-44122 Italy Principles of Informatics Research Division National Institute of Informatics Chiyoda-ku 2-1-2 Hitotsubashi Tokyo101-8430 Japan

Abductive logic programming (ALP) has been proven very effective for formalizing societies of agents, commitments and norms, in particular by mapping the most common deontic operators (obligation, prohibition, permission) to abductive expectations. In our previous works, we have shown that ALP is a suitable framework for representing norms. Normative reasoning and query answering were accommodated by the same abductive proof procedure, named SCIFF. In this work, we introduce a defeasible flavour in this framework, in order to possibly discharge obligations in some scenarios. Abductive expectations can also be qualified as dischargeable, in the new, extended syntax. Both declarative and operational semantics are improved accordingly, and proof of soundness is given under syntax allowedness conditions Moreover, the dischargement itself might be proved invalid, or incoherent with the rules, due to new knowledge provided later on. In such a case, a discharged expectation might be reinstated and hold again after some evidence is given. We extend the notion of dischargement to take into consideration also the reinstatement of expectations. The expressiveness and power of the extended framework, named SCIFF, is shown by modeling and reasoning upon a fragment of the Japanese Civil Code. In particular, we consider a case study concerning manifestations of intention and their rescission (Section II of the Japanese Civil Code). © 2020 - IOS Press and the authors. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Constraint solving over multiple similarity relations 5

Constraint solving over multiple similarity relations

引用

5th International Conference on Formal Structures for Computation and Deduction, FSCD 2020

作者： Dundua, Besik Kutsia, Temur Marin, Mircea Pau, Cleopatra FBT International Black Sea University Tbilisi Georgia VIAM Ivane Javakhishvili Tbilisi State University Georgia Johannes Kepler University Research Institute for Symbolic Computation Linz Austria West University of Timişoara Romania

ISBN: (纸本)9783959771559

Similarity relations are reflexive, symmetric, and transitive fuzzy relations. They help to make approximate inferences, replacing the notion of equality. Similarity-based unification has been quite intensively investigated, as a core computational method for approximate reasoning and declarative programming. In this paper we consider solving constraints over several similarity relations, instead of a single one. Multiple similarities pose challenges to constraint solving, since we can not rely on the transitivity property anymore. Existing methods for unification with fuzzy proximity relations (reflexive, symmetric, non-transitive relations) do not provide a solution that would adequately reflect particularities of dealing with multiple similarities. To address this problem, we develop a constraint solving algorithm for multiple similarity relations, prove its termination, soundness, and completeness properties, and discuss applications. © Besik Dundua, Temur Kutsia, Mircea Marin, and Cleopatra Pau;licensed under Creative Commons License CC-BY 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020).

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Symmetry-breaking answer set solving 3

Symmetry-breaking answer set solving

引用

3rd Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010 - Collocated with the International Conference on logic programming, ICLP 2010

作者： Drescher, Christian Tifrea, Oana Walsh, Toby Vienna University of Technology Austria Free University of Bozen-Bolzano Italy NICTA and University of New South Wales Australia

In the context of Answer Set programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digraph such that permutational symmetries can be constructed from graph automorphisms. Symmetries are then broken by introducing symmetry-breaking constraints. For this purpose, we formulate a preprocessor that integrates a graph automorphism system. Experiments demonstrate its computational impact. © 2020 Workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2010. All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

The extended theory of trees and algebraic (Co)datatypes 8

The extended theory of trees and algebraic (Co)datatypes

引用

8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020

作者： Zaiser, Fabian Luke Ong, C.-H. University of Oxford

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Frühwirth, we consider an extension of this theory with an additional predicate for finiteness of trees, which is useful for expressing properties about (not just datatypes but also) codatatypes. Based on their work, we present a simplification procedure that determines whether any given (not necessarily closed) formula is satisfiable, returning a simplified formula which enables one to read off all possible models. Our extension makes the algorithm usable for algebraic (co)datatypes, which was impossible in their original work due to restrictive assumptions. We also provide a prototype implementation of our simplification procedure and evaluate it on instances from the SMT-LIB. © F. Zaiser & C.-H. L. Ong This work is licensed under the Creative Commons Attribution License.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

SyTeCi: Automating contextual equivalence for higher-order programs with references

SyTeCi: Automating contextual equivalence for higher-order p...

引用

Proceedings of the ACM on programming Languages

作者： Jaber, Guilhem Université de Nantes LS2N CNRS Inria France

We propose a framework to study contextual equivalence of programs written in a call-by-value functional language with local integer references. It reduces the problem of contextual equivalence to the problem of non-reachability in a transition system of memory configurations. This reduction is complete for recursion-free programs. Restricting to programs that do not allocate references inside the body of functions, we encode this non-reachability problem as a set of constrained Horn clause that can then be checked for satisfiability automatically. Restricting furthermore to a language with finite data-types, we also get a new decidability result for contextual equivalence at any type. © 2020 Copyright held by the owner/author(s).

关键词： Integer programming logic programming Semantics Contextual equivalence Functional languages Game semantics Higher order Higher order programs Memory configuration Reachability problem Transition system

来源：评论

学校读者我要写书评

暂无评论

Transformational verification of quicksort 8

Transformational verification of quicksort

引用

8th International Workshop on Verification and Program Transformation, VPT 2020 and 7th Workshop on Horn Clauses for Verification and Synthesis, HCVS 2020

作者： de Angelis, Emanuele Fioravanti, Fabio Proietti, Maurizio CNR IASI Via dei Taurini 19 Roma00185 Italy DEC University "G. d'Annunzio" of Chieti-Pescara Viale Pindaro 42 Pescara65127 Italy

Many transformation techniques developed for constraint logic programs, also known as constrained Horn clauses (CHCs), have found new useful applications in the field of program verification. In this paper, we work out a nontrivial case study through the transformation-based verification approach. We consider the familiar Quicksort program for sorting lists, written in a functional programming language, and we verify the pre/postconditions that specify the intended correctness properties of the functions defined in the program. We verify these properties by: (1) translating them into CHCs, (2) transforming the CHCs by removing all list occurrences, and (3) checking the satisfiability of the transformed CHCs by using the Eldarica solver over booleans and integers. The transformation mentioned at Point (2) requires an extension of the algorithms for the elimination of inductively defined data structures presented in previous work, because during one stage of the transformation we use as lemmas some properties that have been proved at previous stages. © E. De Angelis, F. Fioravanti & M. Proietti This work is licensed under the Creative Commons Attribution License.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 68 69 70 71 72 73 74 75 76 77 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：