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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

358 篇 会议
20 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

257 篇 工学
- 238 篇 计算机科学与技术...
- 134 篇 软件工程
- 24 篇 控制科学与工程
- 15 篇 电气工程
- 11 篇 信息与通信工程
- 3 篇 仪器科学与技术
- 3 篇 电子科学与技术（可...
- 3 篇 石油与天然气工程
- 3 篇 农业工程
- 2 篇 材料科学与工程（可...
- 2 篇 土木工程
- 2 篇 生物医学工程（可授...
53 篇 理学
- 49 篇 数学
- 4 篇 生物学
- 4 篇 系统科学
- 2 篇 物理学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
22 篇 管理学
- 14 篇 管理科学与工程(可...
- 10 篇 图书情报与档案管...
- 6 篇 工商管理
6 篇 医学
- 5 篇 基础医学(可授医学...
- 4 篇 临床医学
- 2 篇 公共卫生与预防医...
4 篇 教育学
- 4 篇 教育学
- 1 篇 心理学(可授教育学...
4 篇 农学
- 4 篇 作物学
2 篇 文学
- 1 篇 中国语言文学
1 篇 哲学
- 1 篇 哲学
1 篇 法学
- 1 篇 社会学

主题

75 篇 logic programmin...
19 篇 fuzzy logic
18 篇 programming
18 篇 logic gates
16 篇 artificial intel...
15 篇 mathematical log...
14 篇 inductive logic ...
12 篇 logics and meani...
11 篇 software enginee...
11 篇 logic
11 篇 programming tech...
9 篇 computer science
8 篇 integer programm...
8 篇 semantics
7 篇 computer circuit...
7 篇 linear programmi...
7 篇 answer set progr...
7 篇 dynamic programm...
6 篇 languages
6 篇 computer archite...

机构

3 篇 univ potsdam pot...
3 篇 univ calabria di...
2 篇 brandeis univ wa...
2 篇 simon fraser uni...
2 篇 katholieke univ ...
2 篇 univ copenhagen ...
2 篇 katholieke univ ...
2 篇 ku leuven depart...
2 篇 department infor...
2 篇 vienna technol u...
2 篇 univ castilla la...
2 篇 carnegie mellon ...
2 篇 univ aarhus daim...
2 篇 at&t bell lab mu...
2 篇 natl univ irelan...
2 篇 natl inst inform...
2 篇 univ castilla la...
2 篇 univ nova lisboa...
2 篇 australian natl ...
2 篇 department of el...

作者

5 篇 gebser martin
5 篇 schaub torsten
4 篇 inoue katsumi
3 篇 nickles matthias
3 篇 fink michael
3 篇 schuller peter
2 篇 mileo alessandra
2 篇 mairson harry g.
2 篇 goncalves ricard...
2 篇 kung-kiu lau
2 篇 soria jose
2 篇 de raedt luc
2 篇 boustia narhimen...
2 篇 j.r. romero
2 篇 a. vallecillo
2 篇 woltran stefan
2 篇 lifschitz vladim...
2 篇 ferilli stefano
2 篇 sighireanu mihae...
2 篇 p. flener

语言

380 篇 英文
3 篇 其他
1 篇 西班牙文
1 篇 中文

检索条件"任意字段=12th International Conference on Inductive Logic Programming"

共 385 条记录，以下是181-190 订阅

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

详细简洁

排序：

AGM-Style Belief Revision of logic Programs under Answer Set Semantics

AGM-Style Belief Revision of Logic Programs under Answer Set...

引用

12th international conference on logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Delgrande, James Peppas, Pavlos Woltran, Stefan Simon Fraser Univ Sch Comp Sci Burnaby BC V5A 1S6 Canada Univ Patras Dept Business Adm Patras 26500 Greece Vienna Univ Technol Inst Informationssyst A-1040 Vienna Austria

ISBN: (纸本)9783642405648

In the past few years, several approaches for revision (and update) of logic programs have been studied. None of these however matched the generality and elegance of the original AGM approach to revision in classical logic. One particular obstacle is the underlying nonmonotonicity of the semantics of logic programs. Recently however, specific revision operators based on the monotonic concept of SE-models (which underlies the answer-set semantics of logic programs) have been proposed. Basing revision of logic programs on sets of SE-models has the drawback that arbitrary sets of SE-models may not necessarily be expressed via a logic program. this situation is similar to the emerging topic of revision in fragments of classical logic. In this paper we show how nonetheless classical AGM-style revision can be extended to various classes of logic programs using the concept of SE-models. that is, we rephrase the AGM postulates in terms of logic programs, provide a semantic construction for revision operators, and then in a representation result show that these approaches coincide. this work is interesting because, on the one hand it shows how the AGM approach can be extended to a seemingly nonmonotonic framework, while on the other hand the formal characterization may provide guiding principles for the development of specific revision operators.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

AOP based language extension for web development

AOP based language extension for web development

引用

12th IASTED international conference on Software Engineering, SE 2013

作者： Fukuda, Hiroaki Enginnering Information Science and Engineering Shibaura Institite of Technology 3-7-5 Toyosu Koto Tokyo 135-8548 Japan

ISBN: (纸本)9780889869431

Unlike traditional web applications, current web applications called RIAs become powerful and useful by combining several technologies including markup languages, client-side script languages and web services. therefore, it becomes more complicated to develop these applications and a number of stakeholders including designers and developers are required. It is reasonable to divide an application into several concerns (i.e., modules) to make the development effective, however, pieces of code to combine each concern prevent it. For example, designers design user interfaces with markup languages, e.g., HTML and developers implement application logic with script languages. then developers will often need to add code (e.g., event handlers) to connect the user interface and the logic so that this will become a single application. In this paper, we propose a client-side script language extension inspired by Aspect-Oriented programming, which is well-known concept to realize improved separation of concerns. this language extension mainly focuses on the complete separation between markup languages, which represent user interfaces, and script languages, which represent client-side logic. In addition, we provide a prototype implementation of an weaver, which combines modules before the execution.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Possibilistic minimal models for possibilistic normal programs

Possibilistic minimal models for possibilistic normal progra...

引用

12th Mexican international conference on Artificial Intelligence, MICAI 2013

作者： Salazar, Rubén Octavio Vélez Ramírez, José Arrazola Ruiz, Ivań Martínez Benémerita Universidad Autónoma de Puebla Mexico

ISBN: (纸本)9783642451133

In this paper we present possibilistic minimal models for possibilistic normal programs, we relate them to the possibilistic Cω logic, PCωL, and to minimal models of normal logic programs. Possibilistic stable models for possibilistic normal programs have been presented previously, but we present a more general type. We also characterize the provability of possibilistic atoms from possibilistic normal programs in terms of PCωL. © Springer-Verlag 2013.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Some properties of logic N-GLukG

Some properties of logic N-GLukG

引用

12th Mexican international conference on Artificial Intelligence, MICAI 2013

作者： Osorio, Mauricio Carballido, José Luis Zepeda, Claudia Universidad de Las Américas Sta. Catarina Mártir Cholula Puebla Mexico Benemérita Universidad Autónoma de Puebla Facultad de Ciencias de la Computación Puebla Mexico

ISBN: (纸本)9783642451133

We present an extension of GLukG, a logic that was introduced in [8] as a three-valued logic under the name of G3′. GLukG is a paraconsistent logic defined in terms of 15 axioms, which serves as the formalism to define the p-stable semantics of logic programming. We introduce a new axiomatic system, N-GLukG, a paraconsistent logic that possesses strong negation. We use the 5-valued logic N5′, which is a conservative extension of GLukG, to help us to prove that N-GLukG is an extension of GLukG. N-GLukG can be used as the formalism to define the p-stable semantics as well as the stable semantics. © Springer-Verlag 2013.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Proximity-Based Method for Discovery of Generalized Knowledge and Its Incorporation to the Bousi∼Prolog System

A Proximity-Based Method for Discovery of Generalized Knowle...

引用

12th international Work-conference on Artificial Neural Networks (IWANN)

作者： Julian-Iranzo, Pascual Rubio-Manzano, Clemente Univ Castilla La Mancha Dept Informat Technol & Syst E-13071 Ciudad Real Spain Univ Bio Bio Dept Informat Syst Concepcion Chile

ISBN: (纸本)9783642386817

In this work, a proximity-based generic method for discovery of generalized knowledge is presented and implemented in the framework of a fuzzy logic programming language with a weak unification procedure that uses proximity relations to model uncertainty. this method makes use of the concept of lambda-block characterizing the notion of equivalence when working with proximity relations. When the universe of discourse is composed of concepts which are related by proximity, the sets of lambda-blocks extracted from that proximity relation can be seen as hierarchical sets of concepts grouped by abstraction level. then, each group (forming a lambda-block) can be labeled, with user help, by way of a more general descriptor in order to simulate a generalization process based on proximity. thanks to this process, the system can learn concepts that were unknown initially and reply queries that it was not able to answer. the novelty of this work is that it is the first time a method, with analogous features to the one aforementioned, has been implemented inside a fuzzy logic programming framework. In order to check the feasibility of the method we have developed a software tool which have been integrated into the Bousk similar to Prolog system.

关键词： Fuzzy logic programming Proximity/Similarity Relations Discovery of Generalized Knowledge

来源：评论

学校读者我要写书评

暂无评论

the Fourth Answer Set programming Competition: Preliminary Report

The Fourth Answer Set Programming Competition: Preliminary R...

引用

12th international conference on logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Alviano, Mario Calimeri, Francesco Charwat, Guenther Dao-Tran, Minh Dodaro, Carmine Ianni, Giovambattista Krennwallner, thomas Kronegger, Martin Oetsch, Johannes Pfandler, Andreas Puehrer, Joerg Redl, Christoph Ricca, Francesco Schneider, Patrik Schwengerer, Martin Spendier, Lara Katharina Wallner, Johannes Peter Xiao, Guohui Univ Calabria Dipartimento Matemat & Informat I-87030 Commenda Di Rende Italy Vienna Technol Univ Inst Informat Syst Vienna Austria Vienna Technol Univ Inst Comp Languages Vienna Austria

ISBN: (纸本)9783642405648

Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. the fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. the Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm;and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Annotating "Fuzzy Chance Degrees" When Debugging XPath Queries

Annotating "Fuzzy Chance Degrees" When Debugging XPath Queri...

引用

12th international Work-conference on Artificial Neural Networks (IWANN)

作者： Almendros-Jimenez, Jesus M. Luna Tedesqui, Alejandro Moreno, Gines Univ Almeria Dep Informat Almeria Spain Univ Castilla La Mancha Dept Comp Syst E-13071 Ciudad Real Spain

ISBN: (纸本)9783642386817

In this paper we present a method for debugging XPath queries which has been implemented with the fuzzy logic language MALP by using the FLOPER tool developed in our group. We describe how XPath expressions can be manipulated for obtaining a set of alternative queries matching a given XML document. For each new proposed query, we give a "chance degree" that represents an estimation on its deviation w.r.t. the initial expression. Our work is focused on providing to the programmers a repertoire of paths which can be used to retrieve answers.

关键词： XPath Fuzzy (Multi-adjoint) logic programming Debugging

来源：评论

学校读者我要写书评

暂无评论

Extending the Metabolic Network of Ectocarpus Siliculosus Using Answer Set programming

Extending the Metabolic Network of <i>Ectocarpus Siliculosus...

引用

12th international conference on logic programming and Nonmonotonic Reasoning (LPNMR)

作者： Collet, Guillaume Eveillard, Damien Gebser, Martin Prigent, Sylvain Schaub, Torsten Siegel, Anne thiele, Sven CNRS UMR IRISA 6074 Campus Beaulieu F-35042 Rennes France Univ Nantes UMR 6241 LINA E-44300 Nantes France Univ Potsdam Inst Informat D-14482 Potsdam Germany INRIA Ctr Rennes Bretagne Atlantique E-35042 Rennes France INRIA CIRIC Santiago Chile

ISBN: (纸本)9783642405648

Metabolic network reconstruction is of great biological relevance because it offers a way to investigate the metabolic behavior of organisms. However, reconstruction remains a difficult task at both the biological and computational level. Building on previous work establishing an ASP-based approach to this problem, we present a report from the field resulting in the discovery of new biological knowledge. In fact, for the first time ever, we automatically reconstructed a metabolic network for a macroalgae. We accomplished this by taking advantage of ASP's combined optimization and enumeration capacities. Both computational tasks build on an improved ASP problem representation, incorporating the concept of reversible reactions. Interestingly, optimization greatly benefits from the usage of unsatisfiable cores available in the ASP solver unclasp. Applied to Ectocarpus siliculosus, only the combination of unclasp and clasp allowed us to obtain a metabolic network able to produce all recoverable metabolites among the experimentally measured ones. Moreover, 70% of the identified reactions are supported by an homologous enzyme in Ectocarpus siliculosus, confirming the quality of the reconstructed network from a biological viewpoint.

关键词： Metabolism

来源：评论

学校读者我要写书评

暂无评论

Cplus 2ASP: Computing action language C+ in answer set programming

Cplus 2ASP: Computing action language C+ in answer set progr...

引用

12th international conference on logic programming and Nonmonotonic Reasoning, LPNMR 2013

作者： Babb, Joseph Lee, Joohyung School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ United States

ISBN: (纸本)9783642405631

We present Version 2 of system Cplus2ASP, which implements the definite fragment of action language C+. Its input language is fully compatible with the language of the Causal Calculator Version 2, but the new system is significantly faster thanks to modern answer set solving techniques. the translation implemented in the system is a composition of several recent theoretical results. the system orchestrates a tool chain, consisting of f2lp, clingo, iclingo, and as2transition. Under the incremental execution mode, the system translates a C+ description into the input language of iclingo, exploiting its incremental grounding mechanism. the correctness of this execution is justified by the module theorem extended to programs with nested expressions. In addition, the input language of the system has many useful features, such as external atoms by means of Lua calls and the user interactive mode. the system supports extensible multi-modal translations for other action languages, such as B and BC, as well. © 2013 Springer-Verlag.

关键词： Computation theory

来源：评论

学校读者我要写书评

暂无评论

An Unfolding-Based Preprocess for Reinforcing thresholds in Fuzzy Tabulation

An Unfolding-Based Preprocess for Reinforcing Thresholds in ...

引用

12th international Work-conference on Artificial Neural Networks (IWANN)

作者： Julian-Iranzo, Pascual Medina-Moreno, Jesus Morcillo, Pedro J. Moreno, Gines Ojeda-Aciego, Manuel Univ Castilla La Mancha Dept Informat Technol & Syst E-13071 Ciudad Real Spain Univ Castilla La Mancha Dept Comp Syst E-13071 Ciudad Real Spain Univ Malaga Dept Math Appl E-29071 Malaga Spain

ISBN: (纸本)9783642386787

We have recently proposed a technique for generating thresholds (filters) useful for avoiding useless computations when executing fuzzy logic programs in a tabulated way. the method was conceived as a static preprocess practicable on program rules before being executed with our fuzzy thresholded tabulation principle, thus increasing the opportunities of prematurely disregarding those computation steps which are redundant (tabulation) or directly lead to non-significant solutions (thresholding). In this paper we reinforce the power of such static preprocess-which does not require the consumption of extra computational resources at execution time-by re-formulating it in terms of the fuzzy unfolding technique initially designed in our group for transforming and optimizing fuzzy logic programs.

关键词： Fuzzy logic programming Tabulation thresholding Unfolding

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：