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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

59 篇 会议
3 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 35 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
20 篇 理学
- 17 篇 数学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 化学

主题

19 篇 logic programmin...
5 篇 semantics
4 篇 computer circuit...
3 篇 well-founded sem...
3 篇 temporal logic
2 篇 linear logic
2 篇 fixpoint semanti...
2 篇 time granularity
2 篇 bottom-up evalua...
2 篇 static analysis
2 篇 computers
2 篇 automata theory
2 篇 non-monotonic re...
1 篇 intrusion detect...
1 篇 calml3 gene
1 篇 constraint logic...
1 篇 lattices
1 篇 formal logic
1 篇 prolog (programm...
1 篇 higher-order log...

机构

2 篇 univ koblenz dep...
2 篇 department of co...
2 篇 artificial intel...
2 篇 univ udine dept ...
2 篇 univ g dannunzio...
2 篇 institut für inf...
2 篇 univ genoa dipar...
2 篇 irst itc i-38050...
1 篇 facoltà di scien...
1 篇 univ ghent dept ...
1 篇 information engi...
1 篇 stanford univers...
1 篇 dept. computer s...
1 篇 liens ecole norm...
1 篇 28660-boadilla d...
1 篇 university of te...
1 篇 department of co...
1 篇 knowledge based ...
1 篇 cognitive engine...
1 篇 dipartimento di ...

作者

3 篇 you jia-huai
2 篇 stolzenburg f
2 篇 konczak kathrin
2 篇 martelli m
2 篇 schaub torsten
2 篇 montanari a
2 篇 franceschet m
2 篇 bozzano m
2 篇 gelfond michael
2 篇 brogi a
2 篇 delzanno g
2 篇 linke thomas
2 篇 dix j
2 篇 konolige kurt
1 篇 mileo alessandra
1 篇 risch v.
1 篇 shen yi-dong
1 篇 mancarella p
1 篇 wakayama toshiro
1 篇 alvaro peter

语言

61 篇 英文
1 篇 其他

检索条件"任意字段=2nd International Workshop on Non-Monotonic Extensions of Logic Programming"

共 62 条记录，以下是1-10 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

A hybrid approach to inference in probabilistic non-monotonic logic programming 2

A hybrid approach to inference in probabilistic non-monotoni...

引用

2nd international workshop on Probabilistic logic programming, PLP 2015 - co-located with 31st international Conference on logic programming, ICLP 2015

作者： Nickles, Matthias Mileo, Alessandra Insight Centre for Data Analytics National University of Ireland Galway Ireland

We present a probabilistic inductive logic programming framework which integrates non-monotonic reasoning, probabilistic inference and parameter learning. In contrast to traditional approaches to probabilistic Answer Set programming (ASP), our framework imposes only comparatively little restrictions on probabilistic logic programs - in particular, it allows for ASP as well as FOL syntax, and for precise as well as imprecise (interval valued) probabilities. User-configurable sampling and inference algorithms, which can be combined in a pipeline-like fashion, provide for general as well as specialized, more scalable approaches to uncertainty reasoning, allowing for adaptability with regard to different reasoning and learning tasks.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

CEUR workshop Proceedings

CEUR Workshop Proceedings

引用

2nd international workshop on Probabilistic logic programming, PLP 2015 - co-located with 31st international Conference on logic programming, ICLP 2015

The proceedings contain 7 papers. The topics discussed include: advances in integrating statistical inference;towards a general framework for actual causation using cp-logic;most probable explanation for MetaProbLog and its application in heart sound segmentation;constraint-based inference in probabilistic logic programs;a hybrid approach to inference in probabilistic non-monotonic logic programming;the distribution semantics is well-defined for all normal programs;probabilistic abductive logic programming using dirichlet priors;and anytime inference in probabilistic logic programs with Tp-compilation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards a general framework for actual causation using CP-logic 2

Towards a general framework for actual causation using CP-lo...

引用

2nd international workshop on Probabilistic logic programming, PLP 2015 - co-located with 31st international Conference on logic programming, ICLP 2015

作者： Beckers, Sander Vennekens, Joost Dept. Computer Science Campus De Nayer KU Leuven University of Leuven Belgium

Since Pearl's seminal work on providing a formal language for causality, the subject has garnered a lot of interest among philosophers and researchers in artificial intelligence alike. One of the most debated topics in this context is the notion of actual causation, which concerns itself with specific - as opposed to general - causal claims. The search for a proper formal definition of actual causation has evolved into a controversial debate, that is pervaded with ambiguities and confusion. The goal of our research is twofold. First, we wish to provide a clear way to compare competing definitions. Second, we want to improve upon these definitions so they can be applied to a more diverse range of instances, including non-deterministic ones. To achieve these goals we provide a general, abstract definition of actual causation, formulated in the context of the expressive language of CP-logic (Causal Probabilistic logic). We will then show that three recent definitions by Ned Hall (originally formulated for structural models) and a definition of our own (formulated for CP-logic directly) can be viewed and directly compared as instantiations of this abstract definition, which also allows them to deal with a broader range of examples.

关键词： Probabilistic logics

来源：评论

学校读者我要写书评

暂无评论

Efficient pseudorecursive evaluation schemes for non-adaptive sparse grids 1

引用

2nd workshop on Sparse Grids and Applications, SGA 2012

作者： Buse, Gerrit Pflüger, Dirk Jacob, Riko TU München München Germany Institute for Parallel and Distributed Systems Universität Stuttgart Stuttgart Germany ETH Zurich Zurich Switzerland

ISBN: (数字)9783319045375

ISBN: (纸本)9783319045368

In this work we propose novel algorithms for storing and evaluating sparse grid functions, operating on regular (not spatially adaptive), yet potentially dimensionally adaptive grid types. Besides regular sparse grids our approach includes truncated grids, both with and without boundary grid points. Similar to the implicit data structures proposed in Feuersänger (Dünngitterverfahren für hochdimensionale elliptische partielle Differntialgleichungen. Diploma Thesis, Institut für Numerische Simulation, Universität Bonn, 2005) and Murarasu et al. (Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel programming. Cambridge University Press, New York, 2011, pp. 25–34) we also define a bijective mapping from the multi-dimensional space of grid points to a contiguous index, such that the grid data can be stored in a simple array without overhead. Our approach is especially well-suited to exploit all levels of current commodity hardware, including cache-levels and vector extensions. Furthermore, this kind of data structure is extremely attractive for today’s real-time applications, as it gives direct access to the hierarchical structure of the grids, while outperforming other common sparse grid structures (hash maps, etc.) which do not match with modern compute platforms that well. For dimensionality d ≤10 we achieve good speedups on a 12 core Intel Westmere-EP NUMA platform compared to the results presented in Murarasu et al. (Proceedings of the international Conference on Computational Science—ICCS 2012. Procedia Computer Science, 2012). As we show, this also holds for the results obtained on Nvidia Fermi GPUs, for which we observe speedups over our own CPU implementation of up to 4.5 when dealing with moderate dimensionality. In high-dimensional settings, in the order of tens to hundreds of dimensions, our sparse grid evaluation kernels on the CPU outperform any other known implementation. © Springer international Publishing Switzerland 2014.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

programming Language Semantics with Isabelle/HOL

Programming Language Semantics with Isabelle/HOL

引用

workshop-School on Theoretical Computer Science (WEIT)

作者： Martini, Alfio Pontificia Univ Catolica Rio Grande do Sul Fac Informat Porto Alegre RS Brazil

ISBN: (纸本)9781479930579

Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order logic. In programming language theory, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages. In this paper we develop a relational denotational semantics for a small imperative programming language and implement it as a theory in Isabelle/HOL. We give special attention to the specification of monotonic fixpoint functionals for loops and provide non-trivial proofs of interesting lemmas and properties with the structured proof language Isar.

关键词： proof assistants higher-order logic formal semantics Isabelle/HOL

来源：评论

学校读者我要写书评

暂无评论

programming Language Semantics with Isabelle/HOL

Programming Language Semantics with Isabelle/HOL

引用

workshop-School on Theoretical Computer Science (WEIT)

作者： Alfio Martini Faculty of Informatics PUCRS Porto Alegre Brazil

Isabelle is a generic meta-logical framework for implementing logical formalisms, and Isabelle/HOL is the specialization of Isabelle for HOL, which stands for Higher Order logic. In programming language theory, formal semantics is the field concerned with the rigorous mathematical study of the meaning of programming languages. In this paper we develop a relational denotational semantics for a small imperative programming language and implement it as a theory in Isabelle/HOL. We give special attention to the specification of monotonic fix point functional for loops and provide non-trivial proofs of interesting lemmas and properties with the structured proof language Isar.

关键词： Semantics Syntactics Equations Computer languages Lattices Computers Abstracts

来源：评论

学校读者我要写书评

暂无评论

Modelling intentional reasoning with defeasible and temporal logic

Modelling intentional reasoning with defeasible and temporal...

引用

Joint 5th international workshop on logics, Agents, and Mobility, LAM 2012, the 1st international workshop on Petri Net-Based Security, WooPS 2012 and the 2nd international workshop on Petri Nets Compositions, CompoNet 2012

作者： Castro-Manzano, José Martín Escuela de Filosofía Universidad Popular Autónoma del Estado de Puebla 21 sur 1103 Barrio de Santiago Puebla 72410 Mexico Instituto de Investigaciones Filosó Universidad Nacional Autónoma de México Circuito Mario de la Cueva s/n Ciudad Universitaria México D.F. 04510 Mexico

We follow the hypothesis that intentional reasoning is a form of logical reasoning sui generis by its double nature: temporal and defeasible. Then we briefly describe a formal framework that deals with these topics and we study the metalogical properties of its notion of inference. The idea is that intentional reasoning can be represented in a well-behaved defeasible logic and has the right to be called logical reasoning since it behaves, mutatis mutandis, as a logic, strictly speaking, as a non-monotonic logic.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Confluence analysis for distributed programs: A model-theoretic approach

Confluence analysis for distributed programs: A model-theore...

引用

2nd international workshop on Datalog in Academia and Industry, Datalog 2.0

作者： Marczak, William R. Alvaro, Peter Conway, Neil Hellerstein, Joseph M. Maier, David University of California Berkeley CA United States Portland State University United States

ISBN: (纸本)9783642329241

Building on recent interest in distributed logic programming, we take a model-theoretic approach to analyzing confluence of asynchronous distributed programs. We begin with a model-theoretic semantics for Dedalus and introduce the ultimate model, which captures non-deterministic eventual outcomes of distributed programs. After showing the question of confluence undecidable for Dedalus, we identify restricted sub-languages that guarantee confluence while providing adequate expressivity. We observe that the semipositive restriction Dedalus+ guarantees confluence while capturing PTIME, but show that its restriction of negation makes certain simple and practical programs difficult to write. To remedy this, we introduce DedalusS , a restriction of Dedalus that allows a kind of stratified negation, but retains the confluence of Dedalus+ and similarly captures PTIME. © 2012 Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A logic of fixpoint definitions 2

A logic of fixpoint definitions

引用

2nd workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2009, collocated with the 25th international Conference on logic programming, ICLP 2009

作者： Hou, Ping Denecker, Marc Department of Computer Science Katholieke Universiteit Leuven Belgium

We introduce the fixpoint definitions, which is a reformulation of fixpoint logic constructs. We define the logic FO(FD), an extension of first order logic with fixpoint definitions. We illustrate the relation between fixpoint definitions and non-monotone inductive definitions in FO(ID), which is developed as an integration of ASP and classical logic. We investigate the satisfiability problem, SAT(FD), of the propositional fragment of FO(FD). We also demonstrate how to extend existing SAT solvers to become SAT(FD) solvers. © 2009 Institute of Electrical and Electronics Engineers Inc. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：