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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

332 篇 会议
23 篇 期刊文献
10 册 图书

馆藏范围

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

日期分布

学科分类号

286 篇 工学
- 273 篇 计算机科学与技术...
- 187 篇 软件工程
- 19 篇 控制科学与工程
- 16 篇 电气工程
- 15 篇 信息与通信工程
- 7 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 化学工程与技术
- 2 篇 光学工程
- 2 篇 仪器科学与技术
- 2 篇 土木工程
- 2 篇 农业工程
- 2 篇 生物工程
- 2 篇 安全科学与工程
90 篇 理学
- 74 篇 数学
- 8 篇 系统科学
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 统计学（可授理学、...
- 2 篇 化学
36 篇 管理学
- 27 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 6 篇 工商管理
7 篇 医学
- 7 篇 临床医学
- 6 篇 基础医学(可授医学...
- 5 篇 药学(可授医学、理...
3 篇 教育学
- 3 篇 教育学
2 篇 农学
- 2 篇 作物学
1 篇 经济学
1 篇 法学
1 篇 文学

主题

87 篇 logic programmin...
29 篇 knowledge repres...
18 篇 semantics
13 篇 programming
12 篇 computer circuit...
10 篇 computer program...
9 篇 object oriented ...
9 篇 artificial intel...
9 篇 ontology
8 篇 logic gates
8 篇 mathematical log...
8 篇 functional progr...
6 篇 programming tech...
6 篇 logics and meani...
6 篇 temporal logic
6 篇 logic design
5 篇 answer set progr...
4 篇 computer archite...
4 篇 logic
4 篇 inductive logic ...

机构

2 篇 genusion inc. am...
2 篇 computer science...
2 篇 univ adelaide sc...
2 篇 faculty of infor...
2 篇 department of co...
2 篇 dipartimento di ...
2 篇 univ minho ctr a...
2 篇 dlvsyst srl arca...
2 篇 listic universit...
2 篇 school of comput...
2 篇 vienna univ tech...
2 篇 school of softwa...
2 篇 open university ...
2 篇 centro algoritmi...
2 篇 facultad de mate...
2 篇 univ calabria de...
2 篇 etsii universida...
2 篇 university of wi...
2 篇 sri internationa...
2 篇 univ london impe...

作者

5 篇 vicente henrique
3 篇 dastani mehdi
3 篇 pereira luís mon...
3 篇 brain martin
3 篇 neves josé
3 篇 heymans stijn
3 篇 tompits hans
3 篇 de vos marina
2 篇 meseguer josé
2 篇 hommersom arjen
2 篇 durán f.
2 篇 porto antónio
2 篇 n. ajika
2 篇 leone nicola
2 篇 dell’acqua piera...
2 篇 de mel geeth
2 篇 madalina croitor...
2 篇 kelly peter m.
2 篇 dovier agostino
2 篇 hindriks koen v.

语言

354 篇 英文
11 篇 其他
1 篇 中文

检索条件"任意字段=3rd International Workshop on Logic Programming and Knowledge Representation"

共 365 条记录，以下是261-270 订阅

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

详细简洁

排序：

Handling relations over finite domains in the rule-based system ELAN

Handling relations over finite domains in the rule-based sys...

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Ringeissen, Christophe LORIA-INRIA 615 rue du Jardin Botanique F-54602 Villers-les-Nancy Cedex France

We present a methodology for handling efficiently relations over small finite domains in the rule-based programming language ELAN. Usually, a relation is specified as a first-order formula (a constraint) interpreted in a given algebraic structure. The concept of rewriting allows us to implement an algebraic structure in a very elegant way, by using rules for defining operators and predicates. Hence, we can directly obtain a rule-based executable specification computing all tuples of a relation, but in most cases, the related computation is completely inefficient. Indeed, the specification of a relation involves conditional rules, and a lot of rewriting steps fail after being tried. In this paper, we use a constraint solver in finite algebras to transform a naive rule-based ELAN specification of a relation into an efficient rule-based ELAN program with only unconditional rules. Thus, the constraint solver enables us to improve the rule-based computation of a relation. ©2000 Published by Elsevier Science B. V.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Toward the formal foundation of ant programming 3rd

Toward the formal foundation of ant programming

引用

3rd international workshop on Ant Algorithms, ANTS 2002

作者： Birattari, Mauro Di Caro, Gianni Dorigo, Marco IRIDIA Université Libre de Bruxelles CP 194/6 Av. Franklin D. Roosevelt 50 Brussels1050 Belgium

ISBN: (纸本)9783540457244

This paper develops the formal framework of ant programming with the goal of gaining a deeper understanding on ant colony optimization and, more in general, on the principles underlying the use of an iterated Monte Carlo approach for the multi-stage solution of combinatorial optimization problems. Ant programming searches for the optimal policy of a multi-stage decision problem to which the original combinatorial problem is reduced. In order to describe ant programming we adopt on the one hand concepts of optimal control, and on the other hand the ant metaphor suggested by ant colony optimization. In this context, a critical analysis is given of notions such as state, representation, and sequential decision process under incomplete information. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

Defeasible Reasoning with Prototype Descriptions: A New Preference Order 37

Defeasible Reasoning with Prototype Descriptions: A New Pref...

引用

37th international workshop on Description logics, DL 2024

作者： Sacco, Gabriele Bozzato, Loris Kutz, Oliver Fondazione Bruno Kessler Via Sommarive 18 Trento38123 Italy Free University of Bozen-Bolzano Piazza Domenicani 3 Bolzano39100 Italy DiSTA - Università dell’Insubria Via O. Rossi 9 Varese21100 Italy

The representation of defeasible information in Description logics is a well-known issue and many formal approaches have been proposed. However, in these proposals, little attention has been devoted to studying their capabilities in capturing the interpretation of typicality and exceptions from an ontological and cognitive point of view. In this regard, we are developing a model of defeasible knowledge for description logics based on combining ideas from prototype theory, weighted description logic (aka ‘tooth logic’), and earlier work on justifiable exceptions. This machinery is then used to determine exceptions in case of conflicting axioms. In this paper, we analyse this formalisation with respect to some interesting cases where the defeasible properties to which we may have exceptions are also present as features in prototype descriptions. The analysis will suggest that a new preference order, which considers what happens inside the models, may be best suited and we outline how this new preference order can be defined. © 2024 Copyright for this paper by its authors.

关键词： Many valued logics

来源：评论

学校读者我要写书评

暂无评论

QuickFOIL: Scalable inductive logic programming

QuickFOIL: Scalable inductive logic programming

引用

3rd workshop on Spatio-Temporal Database Management, STDBM 2006, Co-located with the 32nd international Conference on Very Large Data Bases, VLDB 2006

作者： Zeng, Qiang Patel, Jignesh M. Page, David University of Wisconsin-Madison United States

learning technique that learns first-order rules from relationalstructured data. However, to-date most ILP systems can only be applied to small datasets (tens of thousands of examples). A long-standing challenge in the field is to scale ILP methods to larger data sets. This paper presents a method called QuickFOIL that addresses this limitation. QuickFOIL employs a new scoring function and a novel pruning strategy that enables the algorithm to find highquality rules. QuickFOIL can also be implemented as an in-rdBMS algorithm. Such an implementation presents a host of query processing and optimization challenges that we address in this paper. Our empirical evaluation shows that QuickFOIL can scale to large datasets consisting of hundreds of millions tuples, and is often more than order of magnitude more efficient than other existing approaches. © 2014 VLDB Endowment 2150-8097/14/11.

关键词： Inductive logic programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

Interface-oriented middleware and distributed service inference

Interface-oriented middleware and distributed service infere...

引用

3rd workshop on Adaptive and Reflective Middleware, ARM '04

作者： Varney, L. Robert Parker, D. Stott Department of Computer Science University of California Los Angeles CA United States

ISBN: (纸本)1581139497

Distributed systems that dynamically adapt to changing environments should be developed based on incrementally defined, loosely coupled services. But current middleware platforms tend to encourage monolithic services that are tightly coupled with their environments. We suggest that the non-incremental nature of middleware services is due in part to the lack of support for implementation inheritance, and that tight coupling is due to insufficient support for interface abstraction. Interface-oriented programming (IOP) is an extension of object-oriented programming in which all program inter-dependencies, including inheritance dependencies, are expressed using interface abstractions. This encourages development of partial classes, and requires a new program linking mechanism called representation inference to integrate them. We propose that a distributed implementation of IOP including partial services and distributed service inference could address some of the limitations of middleware systems, providing new opportunities for performance reflection and transparent adaptation. Copyright 2004 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

SLWV - A theorem prover for logic programming 3rd

引用

3rd international workshop on Extensions of logic programming, ELP 1992

作者： Pereira, Luís Moniz Caires, Luis Alferes, José AI Centre Uninova and DCS U.Nova de Lisboa Monte da Caparica2825 Portugal

ISBN: (纸本)9783540564546

The purpose of this work is to define a theorem prover that retains the procedural aspects of logic programing. The proof system we propose (SLWV-resolution, for Selected Linear Without contrapositive clause Variants)) is defined for a set of clauses in the hnplicational form (keeping to the form of logic programs), not requiring contrapositives, and has an execution method that respects the execution order of literals in a clause, preserving the procedural flavor of logic programming. SLWV-resolution can be seen as a combination of SL-resolution and case-analysis, which admits a form of linear derivation. We show its soundness and completeness by establishing a one-toone mapping between SLWV and SL derivations which also clarifies the motivation and the *** work can be seen as an extension to logic programs that goes beyond normal programs, and thus beyond (positive) definite clause programming, by allowing also definite negative heads. Thus we admit program clauses with both positive and (classically) negated atoms conjoined in the body, and at. most one literal as its head (clauses with disjunctions of literals in the head are transformed into a single clause of that form). As this approach doe.s not require clause contrapositives and admits a leftmost selection function, the implementation can and does preserve the pragmatic procedural reading explicitly provided by the programmer. The implementation, not described here. relies on the source program being preprocessed into directly executable Prolog. Preprocessing keeps the overall program structure untouched, and thus a directly recognizable execution pattern that mimics Prolog is obtained: this is useful in debugging. Additionally, the preprocessing is such that Prolog programs run with negligible overhead. Various program examples and attending derivations are proffered. © Springer-Verlag Berlin Heidelberg 1993.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Computational logic — CL 2000 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： John Lloyd Veronica Dahl Ulrich Furbach Manfred Kerber Kung-Kiu Lau Catuscia Palamidessi Luís Moniz Pereira Yehoshua Sagiv Peter J. Stuckey

ISBN: (数字)9783540449577

ISBN: (纸本)9783540677970

These are the proceedings of the First international Conference on Compu- tional logic (CL 2000) which was held at Imperial College in London from 24th to 28th July, 2000. The theme of the conference covered all aspects of the theory, implementation, and application of computational logic, where computational logic is to be understood broadly as the use of logic in computer science. The conference was collocated with the following events: { 6th international Conference on Rules and Objects in Databases (DOOD 2000) { 10th international workshop on logic-based Program Synthesis and Tra- formation (LOPSTR 2000) { 10th international Conference on Inductive logic programming (ILP 2000). CL 2000 consisted of seven streams: { Program Development (LOPSTR 2000) { logic programming: Theory and Extensions { Constraints { Automated Deduction: Putting Theory into Practice { knowledge representation and Non-monotonic Reasoning { Database Systems (DOOD 2000) { logic programming: Implementations and Applications. The LOPSTR 2000 workshop constituted the program development stream and the DOOD 2000 conference constituted the database systems stream. Each stream had its own chair and program committee, which autonomously selected the papers in the area of the stream. Overall, 176 papers were submitted, of which 86 were selected to be presented at the conference and appear in these proceedings. The acceptance rate was uniform across the streams. In addition, LOPSTR 2000 accepted about 15 extended abstracts to be presented at the conference in the program development stream.

关键词： Artificial Intelligence Software Engineering/programming and Operating Systems Computer System Implementation Mathematical logic and Formal Languages logics and Meanings of Programs programming Techniques

来源：评论

学校读者我要写书评

暂无评论

Towards coq formalisation of {log} set constraints resolution 3

Towards coq formalisation of {log} set constraints resolutio...

引用

3rd international workshop on Sets and Tools, SETS 2018

作者： Dubois, Catherine Weppe, Sulyvan ENSIIE Lab. Samovar CNRS Évry France ENSIIE Évry France

The language {log} is a Constraint logic programming language that natively supports finite sets and constraints such as (non) equality and (non) membership. The set constraints resolution process is mathematically formalised by Dovier et al in [5] using rewriting rules. In this paper we present a formalisation in the Coq proof assistant of the term and constraint algebra, the rewriting rules and check all the examples given in the reference paper by applying the rewriting rules manually with the help of some tailored tactics. The main problem we encountered is the non-determinism captured by the rewriting rules, which prevents us from automating their application in Coq. However the rules for nonmembership and set checking are deterministic. So we propose a function that iteratively applies the latter rules. We prove its correctness with respect to the corresponding rewriting rules. This work is a first step of a larger project whose objective is to provide a formally verified resolution process for {log} set constraints resolution. © 2018 CEUR-WS. All rights reserved.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Type inference for unboxed types and first class mutability

Type inference for unboxed types and first class mutability

引用

3rd workshop on programming Languages and Operating Systems: Linguistic Support for Modern Operating Systems, PLOS 2006 - ASPLOS XII workshop

作者： Sridhar, Swaroop Shapiro, Jonathan S. Systems Research Laboratory Department of Computer Science Johns Hopkins University United States

ISBN: (纸本)1595935770

Systems programs rely on fine-grain control of data representation and use of state to achieve performance, conformance to hard-ware specification, and temporal predictability. The robustness and checkability of these programs could be greatly improved if modern type systems and programming language ideas, such as polymorphism and type inference, could be applied to these programs. BitC is a higher-order programming language in the tradition of ML and Haskell, extended to incorporate both state and the expression of unboxed and low-level datatypes. State and unboxed value types interact in subtle ways with polymorphic type-inference. Unless handled with care in the language design, interactions of these features can lead to unsoundness or results that are counter-intuitive to the programmer. Because instances of value types may have mutable components, a decision must be made concerning their compatibility at copy boundaries: should structurally equivalent types that differ only in their mutability be considered compatible. The choice impacts both the amount of polymorphism that the language can preserve and the burden of type annotation imposed on the programmer. This paper presents some of these challenges and our design for how to address these issues. Copyright 2006 ACM.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Scalability of OWL reasoning:: Role condensates

Scalability of OWL reasoning:: Role condensates

引用

OTM Confederated international Conference and workshop

作者： Wandelt, Sebastian Moeller, Ralf TU Hamburg Harburg Inst Software Syst Hamburg Germany

ISBN: (纸本)9783540768890

In the last years, there has been an increasing interest in the performance of reasoning on the Semantic Web in presence of large ABoxes. Traditional reasoners make heavily use of in-memory structures and are therefore not suitable to deal with large ABoxes directly. We propose an approach that, informally speaking, works on a composite representation of the role-part of a SHIQ knowledge base. With respect to conjunctive queries, this helps us to provide a kind of proxy that restricts the set of possible bindings for a variable in advance. Furthermore we can use this proxy to reject several queries with no answer substitution immediately. Most notably our approach is query independent.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：