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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

187 篇 会议
8 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

136 篇 工学
- 130 篇 计算机科学与技术...
- 89 篇 软件工程
- 17 篇 信息与通信工程
- 15 篇 控制科学与工程
- 9 篇 电气工程
- 4 篇 生物医学工程（可授...
- 3 篇 交通运输工程
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 2 篇 生物工程
- 1 篇 机械工程
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 轻工技术与工程
- 1 篇 农业工程
- 1 篇 安全科学与工程
26 篇 理学
- 22 篇 数学
- 9 篇 统计学（可授理学、...
- 4 篇 系统科学
- 2 篇 生物学
- 1 篇 物理学
- 1 篇 化学
13 篇 管理学
- 7 篇 图书情报与档案管...
- 5 篇 管理科学与工程(可...
- 5 篇 工商管理
8 篇 医学
- 8 篇 临床医学
- 3 篇 基础医学(可授医学...
- 3 篇 药学(可授医学、理...
4 篇 教育学
- 4 篇 教育学
1 篇 法学
- 1 篇 法学
1 篇 农学

主题

25 篇 conferences
22 篇 logic programmin...
17 篇 programming
14 篇 semantics
8 篇 software enginee...
8 篇 linear programmi...
7 篇 fuzzy logic
7 篇 artificial intel...
6 篇 logic gates
6 篇 probabilistic lo...
5 篇 deep learning
5 篇 parallel program...
5 篇 training
5 篇 knowledge repres...
4 篇 tools
4 篇 information syst...
4 篇 computer communi...
4 篇 pervasive comput...
4 篇 data mining
4 篇 visualization

机构

6 篇 university of te...
6 篇 university of po...
3 篇 university of mi...
3 篇 cetinia universi...
3 篇 potassco solutio...
2 篇 national institu...
2 篇 tsinghua univ de...
2 篇 kyushu sangyo un...
2 篇 universidad rey ...
2 篇 monash universit...
2 篇 university of pe...
2 篇 the university o...
2 篇 tallinn universi...
2 篇 polytechnic univ...
2 篇 university of ca...
2 篇 university of ba...
2 篇 covenant univers...
2 篇 ludwig-maximilia...
2 篇 shenzhen univ co...
1 篇 petrobras sa rio...

作者

11 篇 gupta gopal
6 篇 arias joaquín
5 篇 riguzzi fabrizio
5 篇 weitkämper felix
5 篇 azzolini damiano
5 篇 salazar elmer
4 篇 rückschloß kilia...
4 篇 basu kinjal
4 篇 li fang
4 篇 varanasi sarat c...
3 篇 schaub torsten
3 篇 costantini stefa...
3 篇 lamma evelina
3 篇 hall brendan
3 篇 satoh ken
3 篇 pisano giuseppe
3 篇 zhang zhizheng
3 篇 cabalar pedro
3 篇 sartor galileo
2 篇 bernady o. apduh...

语言

196 篇 英文

检索条件"任意字段=2021 International Conference on Logic Programming Workshops, ICLP Workshops 2021"

共 196 条记录，以下是21-30 订阅

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

详细简洁

排序：

Beyond logic programming for Legal Reasoning 39

Beyond Logic Programming for Legal Reasoning

引用

39th international conference on logic programming workshops, iclp workshops 2023

作者： Nguyen, Ha Thanh Toni, Francesca Stathis, Kostas Satoh, Ken 2-1-2 Hitotsubashi Chiyoda City Tokyo Japan Imperial College London Exhibition Rd South Kensington LondonSW7 2BX United Kingdom Royal Holloway University of London Egham Hill EghamTW20 0EX United Kingdom

logic programming has long being advocated for legal reasoning, and several approaches have been put forward relying upon explicit representation of the law in logic programming terms. In this position paper we focus on the PROLEG logic-programming-based framework for formalizing and reasoning with Japanese presupposed ultimate fact theory. Specifically, we examine challenges and opportunities in leveraging deep learning techniques for improving legal reasoning using PROLEG, identifying four distinct options ranging from enhancing fact extraction using deep learning to end-to-end solutions for reasoning with textual legal descriptions. We assess advantages and limitations of each option, considering their technical feasibility, interpretability, and alignment with the needs of legal practitioners and decision-makers. We believe that our analysis can serve as a guideline for developers aiming to build effective decision-support systems for the legal domain, while fostering a deeper understanding of challenges and potential advancements by neuro-symbolic approaches in legal applications. 2023 Copyright for this paper by its authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Data Flow programming Language DFC2 23

Design and Implementation of Data Flow Programming Language ...

引用

52nd international conference on Parallel Processing (ICPP)

作者： Luo, Qiuming Liu, Senhong He, Weikai Du, Zheng Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen Guangdong Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9798400708428

This article presents the design and development of a dataflow programming language called DFC2 (DataFlow C, version 2) based on the dataflow programming model. The DFC2 compiler is responsible for converting the DFC2 language into C++ language, which is then compiled into an executable file by the C++ compiler. DFC2 is designed to be user-friendly and easy to use by adhering to the traditional imperative programming language model. It also allows for the reuse of existing C language code to reduce development costs. DFC2 distinguishes between graph functions, which are automatically parallelized, and func functions, which are not, giving users greater control over the level of parallelism. Users can describe dataflow graphs at both the inter-function and intra-function levels. This article also implements an optimization framework for the DFC2 compiler and analyzes the optimization results. It demonstrates that with the introduction of conditional constant propagation and dead code elimination, it is possible to reduce execution time by up to 30% in the best-case scenario and an average of approximately 6%.

关键词： programming model Dataflow execution model Dataflow programming language DFC2 language

来源：评论

学校读者我要写书评

暂无评论

A Query Evaluation Method for ASP with Abduction 38

A Query Evaluation Method for ASP with Abduction

引用

38th international conference on logic programming workshops, iclp workshops 2022

作者： Satoh, Ken National Institute of Informatics Tokyo Japan

In this paper, we present a goal-directed proof procedure for ASP with abduction. Our proposed procedure in this paper is correct for any consistent abductive framework proposed in [Kakas90a]. In other words, if the procedure succeeds, there is a set of hypotheses which satisfies a query, and if the procedure finitely fails, there is no such set. If we do not consider abducibles, this procedure is a goal-directed proof procedure for ASP as well. © 2022 Copyright for this paper by its authors.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Correct Causal Inference in Probabilistic logic programming 38

Correct Causal Inference in Probabilistic Logic Programming

引用

38th international conference on logic programming workshops, iclp workshops 2022

作者： Rückschloß, Kilian Weitkämper, Felix Ludwig-Maximilians-Universität München Institut für Informatik Lehr- und Forschungseinheit für Programmier- und Modellierungssprachen Oettingenstraße 67 MünchenD-80538 Germany

In the current work we investigate the relationship between the classical distribution semantics and causal semantics for probabilistic logic programming. We first give an infinite family of programs yielding the same distribution. Therefore, we deduce that unlike in classical causal structure discovery, in the relational case it is not possible to build a finite search space of causal explanations for an observed distribution. Finally, this article develops a procedure to verify the causal content of a probabilistic logic program, whose structure is obtained from observations. © 2022 Copyright for this paper by its authors.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

DFCPP Runtime Library for Dataflow programming 23

DFCPP Runtime Library for Dataflow Programming

引用

52nd international conference on Parallel Processing (ICPP)

作者： Luo, Qiuming Huang, Jinke Li, Jinrong Du, Zheng Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen Peoples R China Tsinghua Univ Dept Comp Sci & Technol Beijing Peoples R China

ISBN: (纸本)9798400708428

The Dataflow for C++(DFCPP) designed and implemented in this paper is a parallel programming library for dataflow computing on a general control flow hardware platform. Compared with existing dataflow programming libraries, DFCPP has an easy-to-use user interface and richer expression ability and can express different kinds of dataflow tasks. DFCPP designs a memory manager and task scheduler for the NUMA (Non-Uniform Memory Access) architecture and has filled the gap of existing dataflow runtime libraries in this field. The memory manager can allocate memory space on specific NUMA nodes according to the needs of tasks. As for the task scheduler, on the one hand, it places jobs at the location of their input data based on the idea, "The data is where it is;Move a thread to the data it needs most." On the other hand, the task scheduler uses an improved task-stealing algorithm to steal the most suitable task. Combined with the memory manager and task scheduler, DFCPP can decrease the times of remote NUMA node access, thereby improving execution efficiency.

关键词： Dataflow Parallel Computing Runtime Library

来源：评论

学校读者我要写书评

暂无评论

Semantics for Hybrid Probabilistic logic Programs with Function Symbols: Technical Summary 38

Semantics for Hybrid Probabilistic Logic Programs with Funct...

引用

38th international conference on logic programming workshops, iclp workshops 2022

作者： Azzolini, Damiano Riguzzi, Fabrizio Lamma, Evelina Dipartimento di Scienze dell’Ambiente e della Prevenzione University of Ferrara Via Borsari 46 Ferrara44121 Italy Dipartimento di Matematica e Informatica University of Ferrara Via Machiavelli 30 Ferrara44121 Italy Dipartimento di Ingegneria University of Ferrara Via Saragat 1 Ferrara44122 Italy

Hybrid probabilistic logic programs extends probabilistic logic programs by adding the possibility to manage continuous random variables. Despite the maturity of the field, a semantics that unifies discrete and continuous random variables and function symbols was still missing. In this paper, we summarize the main concepts behind a new proposed semantics for hybrid probabilistic logic programs with function symbols. © 2022 Copyright for this paper by its authors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Explanation Graphs for Stable Models of Labelled logic Programs 39

Explanation Graphs for Stable Models of Labelled Logic Progr...

引用

39th international conference on logic programming workshops, iclp workshops 2023

作者： Cabalar, Pedro Muñiz, Brais University of Coruña Spain

In this paper, we introduce the notion of an explanation graph for any model of a logic program. For each true atom in the model, the graph contains a proof that uses program rules represented by rule labels. A model may have zero, one or several explanation graphs: when it has at least one, it is called a justified model. We prove that all stable models are justified whereas, in general, the opposite does not hold, at least for disjunctive programs. With the purpose of just keeping the information that is considered to be salient, we discuss several operations on explanation graphs. These include the removal of incoming or outgoing edges of a node, but also what we define as node forgetting, that is, removing a node while keeping the connectivity of the rest of the graph. Then, we explain how these theoretical concepts constitute the foundation of xclingo 2.0, a tool for explainable Answer Set programming (ASP) that uses, in its turn, an ASP encoding to generate explanations. The tool translates the original program into a meta-program that constitutes the core of xclingo 2.0. We explain this encoding and prove its soundness and completeness with respect to explanation graphs. Through a practical example, we illustrate the general use of the tool and its input language based on annotations. Finally, we show how critical these annotations can be for designing meaningful, summarised, natural language explanations. 2022 Copyright for this paper by its authors.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Graph based answer set programming solver systems

Graph based answer set programming solver systems

引用

2021 international conference on logic programming workshops, iclp workshops 2021

作者： Li, Fang Salazar, Elmer Gupta, Gopal University of Texas at Dallas Richardson United States

来源：评论

学校读者我要写书评

暂无评论

Comparing programming Language Models for Design Pattern Recognition 21

Comparing Programming Language Models for Design Pattern Rec...

引用

21st international conference on Software Architecture (ICSA)

作者： Pandey, Sushant Kumar Staron, Miroslaw Horkoff, Jennifer Ochodek, Miroslaw Durisic, Darko Chalmers Univ Gothenburg Dept CSE Gothenburg Sweden Poznan Univ Tech Dept Software Engn Poznan Poland Volvo Cars Res & Dev Gothenburg Sweden

ISBN: (纸本)9798350366266;9798350366259

Design patterns (DPs) facilitate effective software architecture and design and must be maintained and enforced in existing complex software products, for example, automotive software. Implementing DPs in source code facilitates the development of high-quality software products with less effort. However, recognizing DPs in program code is challenging, and this makes it difficult to keep architectural evolution under control in large software products over time. As DPs are abstract solutions, the programs used to recognize them in source code have significant limitations. In this paper, we employ four programming language models based on Bidirectional Encoder Representations from Transformers (BERT) to study to which extent these models can recognize an exemplar DP, in this case, Singleton. We compare four language representation models - OpenAI CodeX, Facebook AI TransCoder, ACoRA/BERT, and CCFlex/bag-of-words, and compare the models' rankings to a simple base metric. We found a discrepancy between models in identifying Singletons and found that the models are inconsistently sensitive to name and semantic changes. Specifically, CodeX recognizes the existence of Singletons better than other models, while only ACoRA shows some signs of recognizing DP semantics.

关键词： programming language models design patterns recognition Deep learning NLP

来源：评论

学校读者我要写书评

暂无评论

Automating Defeasible Reasoning in Law with Answer Set programming 38

Automating Defeasible Reasoning in Law with Answer Set Progr...

引用

38th international conference on logic programming workshops, iclp workshops 2022

作者： Khang, Lim How Mahajan, Avishkar Strecker, Martin Wong, Meng Weng Singapore Management University Singapore

The paper studies defeasible reasoning in rule-based systems, in particular about legal norms and contracts. We identify rule modifiers that specify how rules interact and how they can be overridden. We then define rule transformations that eliminate these modifiers, leading in the end to a translation of rules to formulas. For reasoning with and about rules, we contrast two approaches, one in a classical logic with SMT solvers, which is only briefly sketched, and one using non-monotonic logic with Answer Set programming solvers, described in more detail. © 2022 Copyright for this paper by its authors.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共20页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：