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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

511 篇 期刊文献
352 篇 会议
11 篇 学位论文

馆藏范围

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

日期分布

学科分类号

826 篇 工学
- 792 篇 计算机科学与技术...
- 401 篇 软件工程
- 59 篇 电气工程
- 26 篇 信息与通信工程
- 25 篇 控制科学与工程
- 7 篇 机械工程
- 6 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 化学工程与技术
- 2 篇 仪器科学与技术
- 2 篇 航空宇航科学与技...
409 篇 理学
- 390 篇 数学
- 11 篇 生物学
- 9 篇 统计学（可授理学、...
- 5 篇 科学技术史(分学科...
- 2 篇 物理学
- 2 篇 地球物理学
- 2 篇 系统科学
- 1 篇 地理学
27 篇 管理学
- 23 篇 管理科学与工程(可...
- 2 篇 公共管理
- 2 篇 图书情报与档案管...
14 篇 哲学
- 8 篇 哲学
10 篇 法学
- 9 篇 法学
- 1 篇 社会学
7 篇 医学
- 3 篇 基础医学(可授医学...
- 2 篇 临床医学
5 篇 教育学
- 4 篇 教育学
- 2 篇 心理学(可授教育学...
4 篇 农学
1 篇 经济学
- 1 篇 应用经济学

主题

874 篇 answer set progr...
78 篇 logic programmin...
68 篇 knowledge repres...
36 篇 knowledge repres...
32 篇 nonmonotonic rea...
28 篇 artificial intel...
26 篇 equilibrium logi...
25 篇 inductive logic ...
23 篇 non-monotonic re...
21 篇 stable models
19 篇 stable model sem...
17 篇 stream reasoning
16 篇 aggregates
16 篇 computational co...
15 篇 strong equivalen...
12 篇 theory
11 篇 description logi...
11 篇 forgetting
11 篇 semantic web
11 篇 machine learning

机构

35 篇 univ potsdam pot...
19 篇 univ calabria ar...
17 篇 univ calabria de...
15 篇 sabanci univ fac...
14 篇 univ genoa dibri...
14 篇 univ calabria de...
12 篇 univ a coruna la...
12 篇 univ genoa genoa
11 篇 univ politecn ma...
11 篇 texas tech univ ...
11 篇 vienna univ tech...
11 篇 vrije univ bruss...
11 篇 new mexico state...
10 篇 tu wien austria
10 篇 univ calabria de...
10 篇 vienna univ tech...
10 篇 univ klagenfurt ...
10 篇 univ texas austi...
8 篇 macquarie univ d...
8 篇 univ calabria co...

作者

49 篇 schaub torsten
44 篇 alviano mario
44 篇 ricca francesco
36 篇 dodaro carmine
35 篇 cabalar pedro
32 篇 eiter thomas
29 篇 maratea marco
28 篇 leone nicola
28 篇 gebser martin
27 篇 calimeri frances...
24 篇 fandinno jorge
23 篇 erdem esra
22 篇 ianni giovambatt...
20 篇 lifschitz vladim...
20 篇 gupta gopal
19 篇 zangari jessica
19 篇 perri simona
18 篇 balduccini marce...
18 篇 lierler yuliya
18 篇 faber wolfgang

语言

849 篇 英文
20 篇 其他
2 篇 土耳其文
2 篇 中文
1 篇 斯洛伐克文

检索条件"主题词=Answer Set Programming"

共 874 条记录，以下是331-340 订阅

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

详细简洁

排序：

Modular Nonmonotonic Logic programming Revisited

Modular Nonmonotonic Logic Programming Revisited

引用

25th International Conference on Logic programming (ICLP)

作者： Dao-Tran, Minh Eiter, Thomas Fink, Michael Krennwallner, Thomas Vienna Univ Technol Inst Informat Syst A-1040 Vienna Austria

ISBN: (纸本)9783642028458

Recently, enabling modularity aspects in answer set programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, we focus on modular nonmonotonic logic programs (MLP) under the answer set semantics, whose modules may have contextually dependent input provided by other modules. Moreover, (Mutually) recursive module calls are allowed. We define a model-theoretic semantics for this extended setting, show that many desired properties of ordinary logic programming generalize to our modular ASP, and determine the computational complexity of the new formalism. We investigate the relationship of modular programs to disjunctive logic programs with well-defined input/output interface (DLP-functions) and show that they can be embedded into MLPs.

关键词： Knowledge Representation answer set programming Modular Logic programming

来源：评论

学校读者我要写书评

暂无评论

From Probabilistic programming to Complexity-Based programming

From Probabilistic Programming to Complexity-Based Programmi...

引用

26th European Conference on Artificial Intelligence (ECAI)

作者： Sileno, Giovanni Dessalles, Jean-Louis Univ Amsterdam Amsterdam Netherlands Inst Polytech Paris Telecom Paris Paris France

ISBN: (纸本)9783031504846;9783031504853

The paper presents the main characteristics and a preliminary implementation of a novel computational framework named COMPLOG. Inspired by probabilistic programming systems like ProbLog, CompLog builds upon the inferential mechanisms proposed by Simplicity Theory, relying on the computation of two Kolmogorov complexities (here implemented as min-path searches via ASP programs) rather than probabilistic inference. The proposed system enables users to compute ex-post and ex-ante measures of unexpectedness of a certain situation, mapping respectively to posterior and prior subjective probabilities. The computation is based on the specification of world and mental models by means of causal and descriptive relations between predicates weighted by complexity. The paper illustrates a few examples of application: generating relevant descriptions, and providing alternative approaches to disjunction and to negation.

关键词： Complexity-based programming Simplicity Theory Causal models Descriptive models Probability Relevant descriptions Negation Kolmogorov complexity answer set programming

来源：评论

学校读者我要写书评

暂无评论

Giving Hints For Logic programming Examples Without Revealing Solutions 24

Giving Hints For Logic Programming Examples Without Revealin...

引用

24th Signal Processing and Communication Application Conference (SIU)

作者： Avci, Gokhan Mehuljic, Mustafa Schuller, Peter Marmara Univ Bilgisayar Muhendisligi Bolumu Istanbul Turkey

ISBN: (纸本)9781509016792

We introduce a framework for supporting learning to program in the paradigm of answer set programming (ASP), which is a declarative logic programming formalism. Based on the idea of teaching by asking the student to complete small example ASP programs, we introduce a three-stage method for giving hints to the student without revealing the correct solution of an example. We categorize mistakes into (i) syntactic mistakes, (ii) unexpected but syntactically correct input, and (iii) semantic mistakes, describe mathematical definitions of these mistakes, and show how to compute hints from these definitions.

关键词： logic programming answer set programming computer aided learning

来源：评论

学校读者我要写书评

暂无评论

Declarative programming Approach for Fake Review Detection 15

Declarative Programming Approach for Fake Review Detection

引用

15th International Workshop on Semantic and Social Media Adaptation and Personalization (SMAP)

作者： Jnoub, Nour Klas, Wolfgang Univ Vienna Res Grp Multimedia Informat Syst Vienna Austria

ISBN: (数字)9781728159195

ISBN: (纸本)9781728159195

Online reviews play an essential role in our daily life. Thus, approaches for detecting fake reviews are of high demand. This paper presents an approach to detect fake reviews incorporating the behavior of authors of reviews combined with properties derived from the content of their reviews. We aim to design a white-box approach which is becoming a major requirement nowadays in the industry. This is due to the fact that there are increasing social concerns about decisions made based on personal information. In other words, we seek to design a white-box model that can let users understand what is going on regarding their personal data. In contrast to blackbox models, such as deep-learning that are hard to be explained in general. Consequently, we propose a rule-based fake review detection system using answer set programming (ASP) which is a powerful tool to declare malicious behavior patterns specified via a variety of constraints. This way we can create powerful models that combine, e.g., information about the number of reviews, the number of dislikes, the analysis of the points in time reviews have been written, qualitative properties of the content based on similarity measures and derived classification of reviews and products. Such models encode the problem phrased "which reviews are to be considered genuine, fake, or need to be investigated further on" and can be used to compute an optimal solution by applying ASP techniques.

关键词： Online Fake Review Detection answer set programming Declarative programming

来源：评论

学校读者我要写书评

暂无评论

Geography Gaokao-Oriented Knowledge Acquisition for Comparative Sentences Based on Logic programming 6th

Geography Gaokao-Oriented Knowledge Acquisition for Comparat...

引用

6th CCF International Conference on Natural Language Processing and Chinese Computing (NLPCC)

作者： Li, Xuelian Liu, Qian Zhu, Man Xu, Feifei Yu, Yunxiu Zhang, Shang Ni, Zhaoxi Gao, Zhiqiang Southeast Univ Key Lab Comp Network & Informat Integrat Minist Educ Nanjing Jiangsu Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China Nanjing Univ Posts & Telecommun Sch Comp Sci & Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9783319736181;9783319736174

Multiple-choice questions of comparing one entity with another in a university's entrance examination like Gaokao in China are very common but require high knowledge skill. As a preliminary attempt to address this problem, we build a geography Gaokao-oriented knowledge acquisition system for comparative sentences based on logic programming to help solve real geography examinations. Our work consists of two consecutive tasks: identify comparative sentences from geographical texts and extract comparative elements from the identified comparative sentences. Specifically, for the former task, logic programming is employed to filter out non-comparative sentences, and for the latter task, the information of dependency grammar and heuristic position is adopted to represent the relations among comparative elements. The experimental results show that our system achieves outstanding performance for practical use.

关键词： Knowledge acquisition Comparative sentences Logic programming answer set programming

来源：评论

学校读者我要写书评

暂无评论

Logic programming approaches for routing fault-free and maximally parallel wavelength-routed optical networks-on-chip (Application paper)

Logic programming approaches for routing fault-free and maxi...

引用

33rd International Conference on Logic programming colocated with the 23rd International Conference on Principles and Practice of Constraint programming / 20th International Conference on Theory and Applications of Satisfiability Testing

作者： Gavanelli, Marco Nonato, Maddalena Peano, Andrea Bertozzi, Davide Ferrara Univ Dept Engn Ferrara Italy QuanTek Bologna Italy

One promising trend in digital system integration consists of boosting on-chip communication performance by means of silicon photonics, thus materializing the so-called Optical Networkson- Chip. Among them, wavelength routing can be used to route a signal to destination by univocally associating a routing path to the wavelength of the optical carrier. Such wavelengths should be chosen so to minimize interferences among optical channels and to avoid routing faults. As a result, physical parameter selection of such networks requires the solution of complex constrained optimization problems. In previous work, published in the proceedings of the International Conference on Computer-Aided Design, we proposed and solved the problem of computing the maximum parallelism obtainable in the communication between any two endpoints while avoiding misrouting of optical signals. The underlying technology, only quickly mentioned in that paper, is answer set programming. In this work, we detail the answer set programming approach we used to solve such problem. Another important design issue is to select the wavelengths of optical carriers such that they are spread across the available spectrum, in order to reduce the likelihood that, due to imperfections in the manufacturing process, unintended routing faults arise. We show how to address such problem in Constraint Logic programming on Finite Domains.

关键词： answer set programming Logic programming applications Optical networks-on-chip Constrained optimization Constraint logic programming on finite domains

来源：评论

学校读者我要写书评

暂无评论

Algebraic Connection Between Logic programming and Machine Learning (Extended Abstract) 17th

Algebraic Connection Between Logic Programming and Machine L...

引用

17th International Symposium on Functional and Logic programming (FLOPS)

作者： Inoue, Katsumi Natl Inst Informat 2-1-2 HitotsubashiChiyoda Ku Tokyo 1018430 Japan

ISBN: (纸本)9789819722990;9789819723003

There have been attempts to connect machine learning and symbolic reasoning, providing interfaces between them. This work focuses on our original approach to integrate machine learning and symbolic reasoning, in the context of algebraic approaches to logic programming. We here realize logical reasoning using algebraic methods, in which algebraic data structures such as matrices and tensors are used to represent logical formulas. These reasoning methods are robust against noise, while allowing for high parallelism and scalable computation. Algebraic logic programming has been applied to fixponit computation, abduction, answer set programming and inductive logic programming.

关键词： Logic programming Machine Learning Linear Algebra answer set programming Abduction Inductive Logic programming Neurosymbolic AI

来源：评论

学校读者我要写书评

暂无评论

A Logic programming Approach to Aspect Extraction in Opinion Mining

A Logic Programming Approach to Aspect Extraction in Opinion...

引用

12th IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology (WI-IAT)

作者： Liu, Qian Gao, Zhiqiang Liu, Bing Zhang, Yuanlin Southeast Univ Sch Comp Sci & Engn Nanjing 210096 Jiangsu Peoples R China Southeast Univ Minist Educ Key Lab Comp Network & Informat Integrat Nanjing 210096 Jiangsu Peoples R China Univ Illinois Dept Comp Sci Chicago IL 60607 USA Texas Tech Univ Dept Comp Sci Lubbock TX 79409 USA

ISBN: (纸本)9781479929023

Aspect extraction aims to extract fine-grained opinion targets from opinion texts. Recent work has shown that the syntactical approach performs well. In this paper, we show that Logic programming, particularly answer set programming (ASP), can be used to elegantly and efficiently implement the key components of syntax based aspect extraction. Specifically, the well known double propagation (DP) method is implemented using 8 ASP rules that naturally model all key ideas in the DP method. Our experiment on a widely used data set also shows that the ASP implementation is much faster than a Java-based implementation. Syntactical approach has its limitation too. To further improve the performance of syntactical approach, we identify a set of general words from WordNet that have little chance to be an aspect and prune them when extracting aspects. The concept of general words and their pruning are concisely captured by 10 new ASP rules, and a natural extension of the 8 rules for the original DP method. Experimental results show a major improvement in precision with almost no drop in recall compared with those reported in the existing work on a typical benchmark data set. Logic programming provides a convenient and effective tool to encode and thus test knowledge needed to improve the aspect extraction methods so that the researchers can focus on the identification and discovery of new knowledge to improve aspect extraction.

关键词： aspect extraction logic programming answer set programming opinion mining dependency relation

来源：评论

学校读者我要写书评

暂无评论

A Tool for Probabilistic Reasoning Based on Logic programming and First-Order Theories Under Stable Model Semantics 1

引用

15th European Conference on Logics in Artificial Intelligence (JELIA)

作者： Nickles, Matthias INSIGHT Ctr Data Analyt Galway Ireland Natl Univ Ireland Discipline Informat Technol Galway Ireland

ISBN: (数字)9783319487588

ISBN: (纸本)9783319487588;9783319487571

This System Description paper describes the software framework PrASP ("Probabilistic answer set programming"). PrASP is both an uncertainty reasoning and machine learning software and a probabilistic logic programming language based on answer set programming (ASP). Besides serving as a research software platform for non-monotonic ( inductive) probabilistic logic programming, our framework mainly targets applications in the area of uncertainty stream reasoning. PrASP programs can consist of ASP (AnsProlog) as well as First-Order Logic formulas (with stable model semantics), annotated with conditional or unconditional probabilities or probability intervals. A number of alternative inference algorithms allow to attune the system to different task characteristics (e.g., whether or not independence assumptions can be made).

关键词： Artificial intelligence answer set programming Probabilistic logic programming Statistical-relational learning SAT

来源：评论

学校读者我要写书评

暂无评论

Modular Logic programming: Full Compositionality and Conflict Handling for Practical Reasoning

Modular Logic Programming: Full Compositionality and Conflic...

引用

作者： Joao Manuel Gomes Moura NOVA University of Lisbon

学位级别：博士

With the recent development of a new ubiquitous nature of data and the profusity of available knowledge, there is nowadays the need to reason from multiple sources of often incomplete and uncertain knowledge. Our goal was to provide a way to combine declarative knowledge bases – represented as logic programming modules under the answer set semantics – as well as the individual results one already inferred from them, without having to recalculate the results for their composition and without having to explicitly know the original logic programming encodings that produced such results. This posed us many challenges such as how to deal with fundamental problems of modular frameworks for logic programming, namely how to define a general compositional semantics that allows us to compose unrestricted modules. Building upon existing logic programming approaches, we devised a framework capable of composing generic logic programming modules while preserving the crucial property of compositionality, which informally means that the combination of models of individual modules are the models of the union of modules. We are also still able to reason in the presence of knowledge containing incoherencies, which is informally characterised by a logic program that does not have an answer set due to cyclic dependencies of an atom from its default negation. In this thesis we also discuss how the same approach can be extended to deal with probabilistic knowledge in a modular and compositional way. We depart from the Modular Logic programming approach in Oikarinen & Janhunen (2008); Janhunen et al. (2009) which achieved a restricted form of com- positionality of answer set programming modules. We aim at generalising this framework of modular logic programming and start by lifting restrictive conditions that were originally imposed, and use alternative ways of combining these (so called by us) Generalised Modular Logic Programs. We then deal with conﬂicts arising in generalised modular lo

关键词： Logic programming answer set programming Paracoherence Paraconsistency Modular Logic programming Probabilistic Logic programming Bayesian Networks Access Control Policies

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：