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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是721-730 订阅

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

详细简洁

排序：

Incremental maintenance of overgrounded logic programs with tailored simplifications

Incremental maintenance of overgrounded logic programs with ...

引用

36th International Conference on Logic programming (ICLP)

作者： Ianni, Giovambattista Pacenza, Francesco Zangari, Jessica Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

The repeated execution of reasoning tasks is desirable in many applicative scenarios, such as stream reasoning and event processing. When using answer set programming in such contexts, one can avoid the iterative generation of ground programs thus achieving a significant payoff in terms of computing time. However, this may require some additional amount of memory and/or the manual addition of operational directives in the declarative knowledge base at hand. We introduce a new strategy for generating series of monotonically growing propositional programs. The proposedovergrounded programs with tailoring(OPTs) can be updated and reused in combination with consecutive inputs. With respect to earlier approaches, ourtailored simplificationtechnique reduces the size of instantiated programs. A maintained OPT slowly grows in size from an iteration to another while the update cost decreases, especially in later iterations. In this paper we formally introduce tailored embeddings, a family of equivalence-preserving ground programs which are at the theoretical basis of OPTs and we describe their properties. We then illustrate an OPT update algorithm and report about our implementation and its performance.

关键词： Knowledge Representation and Reasoning answer set programming Stream Reasoning Grounding Instantiation of Logic Programs Overgrounding

来源：评论

学校读者我要写书评

暂无评论

ARVis: Visualizing Relations between answer sets

ARVis: Visualizing Relations between Answer Sets

引用

12th International Conference on Logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Ambroz, Thomas Charwat, Guenther Jusits, Andreas Wallner, Johannes Peter Woltran, Stefan Vienna Univ Technol Inst Informat Syst Vienna Austria

ISBN: (纸本)9783642405648

answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and Artificial Intelligence. Hereby one represents the problem at hand in such a way that each model of the ASP program corresponds to one solution of the original problem. In recent years, several tools which support the user in developing ASP applications have been introduced. However, explicit treatment of one of the main aspects of ASP, multiple solutions, has received less attention within these tools. In this work, we present a novel system to visualize relations between answer sets of a given program. The core idea of the system is that the user specifies the concept of a relation by an ASP program itself. This yields a highly flexible system that suggests potential applications beyond development environments, e.g., applications in the field of abduction, which we will discuss in a case study.

关键词： answer set programming Systems Abduction

来源：评论

学校读者我要写书评

暂无评论

A Logic-Based Question answering System for Cultural Heritage 16th

A Logic-Based Question Answering System for Cultural Heritag...

引用

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

作者： Cuteri, Bernardo Reale, Kristian Ricca, Francesco Univ Calabria Dept Math & Comp Sci Arcavacata Di Rende Italy

ISBN: (纸本)9783030195700;9783030195694

Question answering (QA) systems attempt to find direct answers to user questions posed in natural language. This work presents a QA system for the closed domain of Cultural Heritage. Our solution gradually transforms input questions into queries that are executed on a CIDOC-compliant ontological knowledge base. Questions are processed by means of a rule-based syntactic classification module running an answer set programming system. The proposed solution is being integrated into a fully-fledged commercial system developed within the PIUCULTURA project, funded by the Italian Ministry for Economic Development.

关键词： Question answering answer set programming Cultural heritage

来源：评论

学校读者我要写书评

暂无评论

A Method for Generating CSS to Improve Web Accessibility for Old Users

A Method for Generating CSS to Improve Web Accessibility for...

引用

13th International Conference on Computers Helping People with Special Needs (ICCHP)

作者： Zakraoui, Jesia Zagler, Wolfgang Vienna Univ Technol A-1040 Vienna Austria

ISBN: (纸本)9783642315220

We propose a method to improveWeb Accessibility. First, we generate a list of Cascading Style Sheet CSS for Websites depending on user's needs and meaningful contextual information. Second, we rank this list in order to best fit with the current user. In order to provide means for that, formally connected knowledge in user interaction processes are used to support a reasoning unit, which is based on answer set programming (ASP). Finally, visual aspects of user interfaces such as sizes of user interface elements, colours, relative position of the elements or navigation devices are specified. In Web environments, user interface adaptation is needed to tailor user interfaces to older people's needs and impairments while preserving their independence.

关键词： Ontology answer set programming Default knowledge Web Accessibility Cascading style sheet Context User interaction.

来源：评论

学校读者我要写书评

暂无评论

Logical Modeling and Analysis of Regulatory Genetic Networks in a Non Monotonic Framework 1

引用

3rd International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO)

作者： Mobilia, Nicolas Rocca, Alexandre Chorlton, Samuel Fanchon, Eric Trilling, Laurent Univ Grenoble Lab TIMC IMAG Grenoble France McMaster Univ Dept Med Hamilton ON Canada

ISBN: (数字)9783319164830

ISBN: (纸本)9783319164830;9783319164823

We present a constraint based declarative approach for analyzing qualitatively genetic regulatory networks (GRNs) with the discrete formalism of R. Thomas. For this purpose, we use the logic programming technology ASP (answer set programming) whose related logic is non monotonic. Our aim is twofold. First, we give a formal modeling of both Thomas' GRNs and biological data like experimental behaviors and gene interactions and we evaluate the declarative approach on three real biological applications. Secondly, for taking into account both gene interaction properties which are only generally true and automatic inconsistency repairing, we introduce an optimized modeling which leads us to exhibit new logical expressions for the conjunction of defaults and to show that they can be applied safely to Thomas' GRNs.

关键词： computational systems biology gene networks discrete modeling AI-oriented declarative approach non monotonic logic answer set programming

来源：评论

学校读者我要写书评

暂无评论

Evaluating a Casual Procedural Generation Tool for Tabletop Role-Playing Game Maps

Evaluating a Casual Procedural Generation Tool for Tabletop ...

引用

2022 IEEE Symposium on Visual Languages and Human-Centric Computing

作者： Crain, Henry Carpenter, Dan Martens, Chris North Carolina State Univ Dept Comp Sci Raleigh NC 27695 USA

ISBN: (数字)9781665442145

ISBN: (纸本)9781665442152;9781665442145

Tile maps are useful for a wide variety of games, particularly tabletop role-playing games. However, existing tools for creating them usually either require the map to be created entirely by hand, or procedurally generate the entire map with only a few parameters being controlled by the user. In previous work, we presented a mixed-initiative tool for generating tile maps that gives the user precise control over the generated map while still allowing them to take advantage of procedural generation. In this work, we empirically evaluate this tool by asking five users to complete three thinkaloud tasks and a post-task survey. We found that users found the tool fun to use and that it made map design easier. We discuss takeaways and how this tool and similar tools can be made better.

关键词： answer set programming casual creator games mixed-initiative co-creativity procedural content generation user experience user study

来源：评论

学校读者我要写书评

暂无评论

A declarative approach for an adaptive framework for learning in online courses 43

A declarative approach for an adaptive framework for learnin...

引用

43rd IEEE-Computer-Society Annual International Computers, Software and Applications Conference (COMPSAC)

作者： Pandit, Dhananjay Bansal, Ajay Arizona State Univ Tempe AZ 85281 USA

ISBN: (纸本)9781728126074

Online courses have gained popularity and seen a surge in enrollment with a reported 58 million students. Adaptive learning is an educational method that is applicable to online courses. Computers adapt the presentation of educational material according to students' learning needs. One of the major challenges with existing systems is that learners are not able to keep up with the instructions in the course that leads to a very low course completion rate. Personalization of the course materials based on the needs of a student is of great value. We propose an adaptive framework for learning that groups students and charts a course plan with the end goal of helping the learner complete all topics in the course. The system also provides feedback about the learner's strong and weak topics with a view to help them learn better. We present a declarative approach that is quite different from existing approaches and provides the user flexibility to specify the constraints and actions as well as consequence of each action instead of having the user encode how to find the solution.

关键词： Adaptive Learning answer set programming Action Language LPMLN

来源：评论

学校读者我要写书评

暂无评论

A new semantics for logic programs capturing and extending the stable model semantics

A new semantics for logic programs capturing and extending t...

引用

IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Benhamou, Belaid Siegel, Pierre Aix Marseille Univ Ctr Math & Informat LSIS F-13453 Marseille 13 France

ISBN: (纸本)9780769549156;9781479902279

Many research works had been done in order to define a semantics for logic programs. Most of these semantics are iterated fixed point semantics. The main idea is the canonical model approach which is a declarative semantics for logic programs that can be defined by selecting for each program one of its canonical models. The notion of canonical models of a logic program is what it is called the stable models. The stable models of a logic program are the minimal Herbrand models of its "reduct" programs. The work that we describe in this paper is theoretical, we introduce a new semantics for logic programs that is different from the known fixed point semantics. In our approach, logic programs are expressed as CNF formulas (sets of clauses) of a propositional logic for which we define a notion of extension. We prove in this semantics, that each consistent CNF formula admits at least an extension and for each given stable model of a logic program there exists an extension of its corresponding CNF formula which logically entails it. On the other hand, we show that some of the extensions do not entail any stable model, in this case, we define a simple condition called a discrimination condition which allows to recognize such extensions. These extensions could be very important, but are not captured by the stable models semantics. Our approach, extends the stable model semantics in this sense. Following the new semantics, we give a full characterization of the stable models of a logic program by means of the extensions of its CNF encoding verifying the simple discrimination condition, and provide a procedure which can be used to compute such extensions from which we deduce the stable models and eventually the extrastable models of the given logic program.

关键词： Logic programming stable models answer set programming

来源：评论

学校读者我要写书评

暂无评论

Inferring Boolean Networks from Single-Cell Human Embryo Datasets 19th

Inferring Boolean Networks from Single-Cell Human Embryo Dat...

引用

19th International Symposium on Bioinformatics Research and Applications

作者： Bolteau, Mathieu Bourdon, Jeremie David, Laurent Guziolowski, Carito Nantes Univ CNRS Ecole Cent Nantes LS2NUMR 6004 F-44000 Nantes France Nantes Univ CHU Nantes INSERM CR2TI F-44000 Nantes France

ISBN: (纸本)9789819970735;9789819970742

This study aims to understand human embryonic development and cell fate determination, specifically in relation to trophectoderm (TE) maturation. We utilize single-cell transcriptomics (scRNAseq) data to develop a framework for inferring computational models that distinguish between two developmental stages. Our method selects pseudo-perturbations from scRNAseq data since actual perturbations are impractical due to ethical and legal constraints. These pseudo-perturbations consist of input-output discretized expressions, for a limited set of genes and cells. By combining these pseudo-perturbations with prior-regulatory networks, we can infer Boolean networks that accurately align with scRNAseq data for each developmental stage. Our publicly available method was tested with several benchmarks, proving the feasibility of our approach. Applied to the real dataset, we infer Boolean network families, corresponding to the medium and late TE developmental stages. Their structures reveal contrasting regulatory pathways, offering valuable biological insights and hypotheses within this domain.

关键词： Boolean networks answer set programming Human preimplantation development scRNAseq modeling

来源：评论

学校读者我要写书评

暂无评论

Incremental and Iterative Learning of answer set Programs from Mutually Distinct Examples

Incremental and Iterative Learning of Answer Set Programs fr...

引用

34th International Conference on Logic programming (ICLP)

作者： Mitra, Arindam Baral, Chitta Arizona State Univ Tempe AZ 85287 USA

Over the years the Artificial Intelligence (AI) community has produced several datasets which have given the machine learning algorithms the opportunity to learn various skills across various domains. However, a subclass of these machine learning algorithms that aimed at learning logic programs, namely the Inductive Logic programming algorithms, have often failed at the task due to the vastness of these datasets. This has impacted the usability of knowledge representation and reasoning techniques in the development of AI systems. In this research, we try to address this scalability issue for the algorithms that learn answer set programs. We present a sound and complete algorithm which takes the input in a slightly different manner and performs an efficient and more user controlled search for a solution. We show via experiments that our algorithm can learn from two popular datasets from machine learning community, namely bAbl (a question answering dataset) and MNIST (a dataset for handwritten digit recognition), whicYh to the best of our knowledge was not previously possible. The system is publicly available at https://***/KdWAcV.

关键词： Inductive Logic programming answer set programming Question answering Handwritten Digit Recognition Context Dependent Learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共88页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：