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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

1,548 篇 电子文献
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...
10 篇 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,537 篇 英文
8 篇 中文
4 篇 其他

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

共 1549 条记录，以下是201-210 订阅

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

详细简洁

排序：

Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent logics 36

Sequent-Type Calculi for Systems of Nonmonotonic Paraconsist...

引用

36th international conference on logic programming (ICLP)

作者： Geibinger, Tobias Tompits, Hans Tech Univ Wien Inst Log & Computat Databases & Artificial Intelligence Grp Favoritenstr 9-11 A-1040 Vienna Austria Tech Univ Wien Inst Log & Computat Knowledge Based Syst Grp Favoritenstr 9-11 A-1040 Vienna Austria

Paraconsistent logics constitute an important class of formalisms dealing with non-trivial reasoning from inconsistent premisses. In this paper, we introduce uniform axiomatisations for a family of nonmonotonic paraconsistent logics based on minimal inconsistency in terms of sequent-type proof systems. the latter are prominent and widely-used forms of calculi well-suited for analysing proof search. In particular, we provide sequent-type calculi for Priest's three-valued minimally inconsistent logic of paradox, and for four-valued paraconsistent inference relations due to Arieli and Avron. Our calculi follow the sequent method first introduced in the context of nonmonotonic reasoning by Bonatti and Olivetti, whose distinguishing feature is the use of a so-called rejection calculus for axiomatising invalid formulas. In fact, we present a general method to obtain sequent systems for any many-valued logic based on minimal inconsistency, yielding the calculi for the logics of Priest and of Arieli and Avron as special instances.

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

A Sequent-Type Calculus for three-Valued Default logic, Or: Tweety Meets Quartum Non Datur 15th

A Sequent-Type Calculus for Three-Valued Default Logic, Or: ...

引用

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

作者： Pkhakadze, Sopo Tompits, Hans Tech Univ Wien Inst Logic & Computat Knowledge Based Syst Grp E192 03 Favoritenstr 9-11 A-1040 Vienna Austria

ISBN: (纸本)9783030205287;9783030205270

Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In this paper, we introduce a sequent-type calculus for a variant of default logic employing Lukasiewicz's three-valued logic as the underlying base logic. this version of default logic has been introduced by Radzikowska addressing some representational shortcomings of standard default logic. More specifically, our calculus axiomatises brave reasoning for this version of default logic, following the sequent method first introduced in the context of nonmonotonic reasoning by Bonatti, which employs a complementary calculus for axiomatising invalid formulas, taking care of expressing the consistency condition of defaults.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

reasoning about Measures of Unmeasurable Sets 17

Reasoning about Measures of Unmeasurable Sets

引用

17th international conference on Principles of Knowledge Representation and reasoning (KR and R)

作者： Console, Marco Hofer, Matthias Libkin, Leonid Univ Edinburgh Edinburgh Midlothian Scotland ENS Paris PSL Paris France Neo4j San Mateo CA USA

ISBN: (纸本)9780999241172

In a variety of reasoning tasks, one estimates the likelihood of events by means of volumes of sets they define. Such sets need to be measurable, which is usually achieved by putting bounds, sometimes ad hoc, on them. We address the question how unbounded or unmeasurable sets can be measured nonetheless. Intuitively, we want to know how likely a randomly chosen point is to be in a given set, even in the absence of a uniform distribution over the entire space. To address this, we follow a recently proposed approach of taking intersection of a set with balls of increasing radius, and defining the measure by means of the asymptotic behavior of the proportion of such balls taken by the set. We show that this approach works for every set definable in first-order logic with the usual arithmetic over the reals (addition, multiplication, exponentiation, etc.), and every uniform measure over the space, of which the usual Lebesgue measure (area, volume, etc.) is an example. In fact we establish a correspondence between the good asymptotic behavior and the finiteness of the VC dimension of definable families of sets. Towards computing the measure thus defined, we show how to avoid the asymptotics and characterize it via a specific subset of the unit sphere. Using definability of this set, and known techniques for sampling from the unit sphere, we give two algorithms for estimating our measure of unbounded unmeasurable sets, with deterministic and probabilistic guarantees, the latter being more efficient. Finally we show that a discrete analog of this measure exists and is similarly well-behaved.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Free theorems Simply, via Dinaturality 22nd

Free Theorems Simply, via Dinaturality

引用

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

作者： Voigtländer, Janis University of Duisburg-Essen Duisburg Germany

ISBN: (纸本)9783030467135

Free theorems are a popular tool in reasoning about parametrically polymorphic code. they are also of instructive use in teaching. their derivation, though, can be tedious, as it involves unfolding a lot of definitions, then hoping to be able to simplify the resulting logical formula to something nice and short. Even in a mechanised generator it is not easy to get the right heuristics in place to achieve good outcomes. Dinaturality is a categorical abstraction that captures many instances of free theorems. Arguably, its origins are more conceptually involved to explain, though, and generating useful statements from it also has its pitfalls. We present a simple approach for obtaining dinaturality-related free theorems from the standard formulation of relational parametricity in a rather direct way. It is conceptually appealing and easy to control and implement, as the provided Haskell code shows. © 2020, Springer Nature Switzerland AG.

关键词： artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Temporal logic Monitoring Rewards via Transducers 17

Temporal Logic Monitoring Rewards via Transducers

引用

17th international conference on Principles of Knowledge Representation and reasoning (KR and R)

作者： De Giacomo, Giuseppe Favorito, Marco Iocchi, Luca Patrizi, Fabio Ronca, Alessandro Univ Roma La Sapienza DIAG Rome Italy

ISBN: (纸本)9780999241172

In Markov Decision Processes (MDPs), rewards are assigned according to a function of the last state and action. this is often limiting, when the considered domain is not naturally Markovian, but becomes so after careful engineering of an extended state space. the extended states record information from the past that is sufficient to assign rewards by looking just at the last state and action. Non-Markovian Reward Decision Processes (NMRDPs) extend MDPs by allowing for non-Markovian rewards, which depend on the history of states and actions. Non-Markovian rewards can be specified in temporal logics on finite traces such as LTLf/LDLf, with the great advantage of a higher abstraction and succinctness;they can then be automatically compiled into an MDP with an extended state space. We contribute to the techniques to handle temporal rewards and to the solutions to engineer them. We first present an approach to compiling temporal rewards which merges the formula automata into a single transducer, sometimes saving up to an exponential number of states. We then define monitoring rewards, which add a further level of abstraction to temporal rewards by adopting the four-valued conditions of runtime monitoring;we argue that our compilation technique allows for an efficient handling of monitoring rewards. Finally, we discuss applications to reinforcement learning.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Disjunctive Programs in WASP 15th

Evaluation of Disjunctive Programs in WASP

引用

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

作者： Alviano, Mario Amendola, Giovanni Dodaro, Carmine Leone, Nicola Maratea, Marco Ricca, Francesco Univ Calabria DEMACS Arcavacata Di Rende Italy Univ Genoa DIBRIS Genoa Italy

ISBN: (纸本)9783030205287;9783030205270

Answer Set programming (ASP) is a well-established declarative programming language based on logic. the success of ASP is mainly due to the availability of efficient ASP solvers, therefore their development is still an important research topic. In this paper we report the recent improvements of the well-known ASP solver WASP. the new version of WASP includes several improvements of the main solving strategies and advanced reasoning techniques for computing paracoherent answer sets. Indeed, WASP is the first ASP solver handling paracoherent reasoning under two mainstream semantics, namely semi-stable and semiequilibrium. However, semi-equilibrium semantics may require the introduction of several disjunctive rules, which are usually considered as a source of inefficiency for modern solvers. Such a drawback is addressed in WASP by implementing ad-hoc techniques to efficiently handle disjunctive logic programs. these techniques are presented and evaluated in this paper.

关键词： Answer set programming Answer set computation Disjunctive logic programs

来源：评论

学校读者我要写书评

暂无评论

OVERLAY 2019 - Proceedings of the 1st Workshop on artificial intelligence and Formal Verification, logic, Automata, and Synthesis, co-located with the 18th international conference of the Italian Association for artificial intelligence, AI*IA 2019

OVERLAY 2019 - Proceedings of the 1st Workshop on Artificial...

引用

1st Workshop on artificial intelligence and Formal Verification, logic, Automata, and Synthesis, OVERLAY 2019

the proceedings contain 17 papers. the topics discussed include: model checking BDI logics over finite-state worlds;in silico clinical trials through AI and statistical model checking;automated verification of noisy nonlinear cyber-physical systems with Ariadne;towards the automated verification of publish/subscribe networks;verification with answer set programming, reasoning about actions and change, constraints and ontologies;pushing runtime verification to the limit: may process semantics be with us;robustness verification of decision tree ensembles;pairing monitoring with machine learning for smart system verification and predictive maintenance;and a prototype for the robust execution of flexible plans.

关键词：

来源：评论

学校读者我要写书评

暂无评论

the Return of xorro 15th

The Return of xorro

引用

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

作者： Everardo, Flavio Janhunen, Tomi Kaminski, Roland Schaub, Torsten Aalto Univ Espoo Finland Tampere Univ Tampere Finland Univ Potsdam Potsdam Germany Simon Fraser Univ Burnaby BC Canada Griffith Univ Brisbane Qld Australia

ISBN: (纸本)9783030205287;9783030205270

Although parity constraints are at the heart of many relevant reasoning modes like sampling or model counting, little attention has so far been paid to their integration into ASP systems. We address this shortcoming and investigate a variety of alternative approaches to implementing parity constraints, ranging from rather basic ASP encodings to more sophisticated theory propagators (featuring Gauss-Jordan elimination). All of them are implemented in the xorro system by building on the theory reasoning capabilities of the ASP system dingo. Our comparative empirical study investigates the impact of the number and size of parity constraints on performance and indicates the merits of the respective implementation techniques. Finally, we benefit from parity constraints to equip xorro with means to sample answer sets, paving the way for new applications of ASP.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

On the splitting property for epistemic logic programs (extended abstract) 29

On the splitting property for epistemic logic programs (exte...

引用

29th international Joint conference on artificial intelligence, IJCAI 2020

作者： Cabalar, Pedro Fandinno, Jorge del Cerro, Luis Fariñas University of Corunna Spain University of Potsdam Germany IRIT University of Toulouse CNRS France

ISBN: (纸本)9780999241165

Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective literal is true in all or some stable models. However, its associated semantics has proved to be non-trivial, since the truth of subjective literals may interfere with the set of stable models it is supposed to query. As a consequence, no clear agreement has been reached and different semantic proposals have been made in the literature. In this paper, we review an extension of the well-known splitting property for logic programs to the epistemic case. this epistemic splitting property is defined as a general condition that can be checked on any arbitrary epistemic semantics. Its satisfaction has desirable consequences both in the representation of conformant planning problems and in the encoding of the so-called subjective constraints. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Argumentation-Based Explanations for Answer Sets Using ADF 15th

Argumentation-Based Explanations for Answer Sets Using ADF

引用

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

作者： Rolf, Lena Kern-Isberner, Gabriele Brewka, Gerhard TU Dortmund Dortmund Germany Univ Leipzig Leipzig Germany

ISBN: (纸本)9783030205287;9783030205270

this paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). the graphs show how a literal can be derived from the program, and they evaluate in an argumentative way why necessary assumptions about literals not contained in an answer set hold. With the set of all asl-explanation graphs for a literal and an answer set, it is possible to explain and justify thoroughly why the literal is or is not contained in that answer set. Additionally, we provide a criterion to improve the clarity of explanations by pruning nodes without loss of information and selecting most significant asl-explanation graphs.

关键词： Answer set programming Abstract dialectical frameworks Argumentation Explanation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共155页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：