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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

492 篇 会议
29 篇 期刊文献
24 册 图书

馆藏范围

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

日期分布

学科分类号

382 篇 工学
- 347 篇 计算机科学与技术...
- 220 篇 软件工程
- 60 篇 控制科学与工程
- 40 篇 电气工程
- 22 篇 信息与通信工程
- 11 篇 电子科学与技术（可...
- 9 篇 机械工程
- 9 篇 建筑学
- 8 篇 力学（可授工学、理...
- 8 篇 土木工程
- 8 篇 生物医学工程（可授...
- 7 篇 材料科学与工程（可...
- 7 篇 交通运输工程
- 5 篇 仪器科学与技术
- 5 篇 生物工程
- 4 篇 化学工程与技术
113 篇 理学
- 93 篇 数学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 10 篇 物理学
- 10 篇 生物学
29 篇 管理学
- 17 篇 管理科学与工程(可...
- 12 篇 图书情报与档案管...
- 8 篇 工商管理
12 篇 医学
- 10 篇 基础医学(可授医学...
- 10 篇 临床医学
- 7 篇 药学(可授医学、理...
4 篇 经济学
- 4 篇 应用经济学
4 篇 法学
- 4 篇 社会学
4 篇 教育学
- 4 篇 教育学
2 篇 农学

主题

88 篇 logic programmin...
24 篇 computer circuit...
20 篇 fuzzy logic
16 篇 semantics
15 篇 programming
15 篇 mathematical log...
15 篇 logics and meani...
14 篇 artificial intel...
13 篇 programming lang...
12 篇 linear programmi...
12 篇 programming tech...
11 篇 formal logic
11 篇 software enginee...
10 篇 logic gates
10 篇 logic
9 篇 genetic programm...
9 篇 algebra
9 篇 functional progr...
8 篇 web services
7 篇 programmable log...

机构

3 篇 cwi p.o. box 940...
2 篇 sri int menlo pk...
2 篇 huelva universit...
2 篇 department of co...
2 篇 trinity coll dub...
2 篇 ctr wiskunde & i...
2 篇 computer science...
2 篇 hanoi univ techn...
2 篇 department of me...
2 篇 università di pi...
2 篇 applied mathemat...
2 篇 fujitsu laborato...
2 篇 dept. of informa...
2 篇 industrial depar...
2 篇 department of ma...
2 篇 department of el...
2 篇 univ munich inst...
2 篇 faculty of elect...
2 篇 univ kent canter...
2 篇 vienna univ tech...

作者

3 篇 osorio m
2 篇 riedl l
2 篇 ortiz m
2 篇 yu yong
2 篇 kurz a
2 篇 casadei roberto
2 篇 kahl wolfram
2 篇 schobbens pierre...
2 篇 hennicker r
2 篇 ray oliver
2 篇 le van hung
2 篇 kifer michael
2 篇 bidoit m
2 篇 lin ying
2 篇 zhao na
2 篇 moto-oka t.
2 篇 stehr mark-olive...
2 篇 zhang xuan
2 篇 pianini danilo
2 篇 jaffar joxan

语言

537 篇 英文
7 篇 其他
1 篇 中文

检索条件"任意字段=4th International Conference on Algebraic and Logic Programming"

共 545 条记录，以下是421-430 订阅

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

详细简洁

排序：

REFINING KNOWLEDGE FROM UNCERTAIN RELATIONS - A FUZZY DATA BROWSER BASED ON FUZZY OBJECT-ORIENTED programming IN FRIL

REFINING KNOWLEDGE FROM UNCERTAIN RELATIONS - A FUZZY DATA B...

引用

4th IEEE international conference on Fuzzy Systems/2nd international Fuzzy Engineering Symposium (FUZZY-IEEE/IFES 95)

作者： BALDWIN, JF MARTIN, TP DEPT ENGN MATH ADV COMP RES CTR BRISTOL BS8 1TR ENGLAND

ISBN: (纸本)0780324617

the emerging technologies of soft computing promise to solve many real-world problems which are difficult to tackle using conventional approaches. Fril combines soft computing and logic programming into an AI language with powerful and flexible features for handling uncertainty. In this paper we outline a Fril implementation of the fuzzy data browser, which can generate rules describing the relationships underlying large tables of data. these rules can be used to summarise data for humans, predict missing values, search for anomalous values, etc. A fuzzy object-oriented architecture is described, which permits objects to be members (to a degree) of several classes, and to combine inherited values from those classes using fuzzy techniques.

关键词： Fuzzy sets

来源：评论

学校读者我要写书评

暂无评论

the sure programming framework 4th

引用

4th international conference on algebraic Methodology and Software Technology, AMAST 1995

作者： Jayararaan, Bharat Moon, Kyonghee Department of Computer Science State University of New York at Buffalo BuffaloNY14260 United States

ISBN: (纸本)3540600434

We illustrate the use of a declarative programming paradigm based upon three kinds of program clauses: equational, subset, and general relational clauses. the implemented language is called SURE, which is an acronym for Subsets, Relations, and Equations. (To wit, SuRE is the affirmative answer to the question: Can programming be declarative and practical?) Subset clauses have many uses in the logic programming context: they serve as a declarative alternative to Prolog's mode declarations as well as those uses of assert and retract that correspond to implementations of memo-tables or collection of results from alternative search paths, as in the setof construct. By re-formulating a relation as a set-valued function, one not only specifies mode information declaratively, but also gains the flexibility of operating on the resulting set incrementally (by a membership goal) or collectively (by an equational goal). In the latter case, one further has the flexibility of working lazily or eagerly. We show that lazy enumeration of solutions is the key to declaratively pruning the search space in generate-and-test problems. Subset clauses and, more generally, partial-order clauses are also useful in the deductive database context, especially for defining setof operations, transitive closures and monotonic aggregation-the concepts of subset, aggregation and monotonicity are more naturally expressed in terms of functions than predicates. A central feature in the implementation of SuRE programs is that of a monotonic memo-table, i.e., a memo-table whose entries can monotonically grow or shrink in an appropriate partial order. the implementation of SuRE was developed as an extension of the well-known Warren Abstract Machine (WAM) for Prolog. Even though SuRE differs substantially from Prolog, few additional instructions, registers, and storage structures are needed and these blend in well with the overall design of the WAM. © Springer-Verlag Berlin Heidelberg 1995.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

FUZZY PROLOG BASED ON LUKASIEWICZ IMPLICATION AND BOUNDED PRODUCT

FUZZY PROLOG BASED ON LUKASIEWICZ IMPLICATION AND BOUNDED PR...

引用

4th IEEE international conference on Fuzzy Systems/2nd international Fuzzy Engineering Symposium (FUZZY-IEEE/IFES 95)

作者： YASUI, H HAMADA, Y MUKAIDONO, M MEIJI UNIV DEPT COMP SCITAKA KUKAWASAKIKANAGAWA 222JAPAN

ISBN: (纸本)0780324625

A lot of Prologs applied fuzzy theory, so called Fuzzy Prolog, have been studied since Zadeh has proposed fuzzy theory. Although various approaches of Fuzzy Prolog were proposed until now, there was no common interpretation for fuzzifying Prolog. In [8], from the user's side we considered what Fuzzy Prolog have to be able to do and proposed some approaches for fuzzifying Prolog which satisfy user's postulates. LbFP is Fuzzy Prolog which is based on these proposals and adopts Lukasiewicz's for implication operation and bounded product for combination operation. In this paper, at first we introduce what Fuzzy Prolog have to be able to do by using some examples. Next we explain some definitions and theorems for fuzzy logic programming which adopts Lukasiewicz's for implication operation and bounded product for combination operation. Finally, we show the implementation of LbFP.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Deductive and object data languages: A quest for integration 4th

Deductive and object data languages: A quest for integration

引用

4th international conference on Deductive and Object-Oriented Databases, DOOD 1995

作者： Kifer, Michael Department of Computer Science University at Stony Brook Stony BrookNY11794 United States

ISBN: (纸本)9783540606086

According to rumors, the early hybrids of object-oriented and deductive languages were mutants that escaped from secret Government AI labs. Whether this is true or not, the fact is that by mid-80’s, database and logic programming communities began to take notice. the temptation was hard to resist: the object-oriented paradigm provides a better way of manipulating structured objects, while logic and deduction offer the power and flexibility of ad hoc querying and reasoning. thus, hybrid languages have the potential for becoming an ideal turf for cultivating the next generation of information systems. the approaches to integration of the two paradigms range from logic-based languages with unified declarative semantics, to message-passing prologs, to Prolog/C++ cocktails. In the past eight years, my colleagues and I have been developing a unified object-based logic intended to capture most of the essentials of the object-oriented paradigm. the overall plot here is that once the fundamentals are in place, the actual hybrid programming languages can be carved out of the logic the same way as deductive data languages have been carved out of the classical logic. there are two distinct aspects in object-orientation: structural (the statics) and procedural (the dynamics). the static aspect was somewhat easier to capture in logic and after taking a few wrong turns F-logic was developed [17]. Taming the dynamics was harder, because there was no widely accepted solution to the problem of state changes even for traditional deductive languages. Our recent work on Transaction logic [8, 7] appears to provide an adequate framework for specifying the dynamics in classical deductive languages. this paper first reviews some core aspects of F-logic and Transaction logic, and then shows how the two can be combined in a natural way to yield a unified foundation for future work on deductive object-oriented languages both in theory and practice. At the end, we discuss areas that still remai

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Completeness results for two-sorted metric temporal logics 4th

引用

4th international conference on algebraic Methodology and Software Technology, AMAST 1995

作者： Montanari, Angelo De Rijke, Maarten Dipartimento di Matematica e Informatica Università di Udine Via delle Scienze 206 Udine33100 Italy Department of Software Engineering CWI P.O. Box 94079 Amsterdam Netherlands

ISBN: (纸本)3540600434

Temporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. One shortcoming of (standard) temporal logic is that it is inadequate for real-time applications, because it only deals with qualitative timing properties. this is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expressed by making use of a parameterized operator of relative temporal realization. We view metric temporal logics as two-sorted formalisms having formulae ranging over time instants and parameters ranging over an (ordered) abelian group of temporal displacements. In this paper we deal with completeness results for basic systems of metric temporal logic -- such issues have largely been ignored in the literature. We first provide an axiomatization of the pure metric fragment of the logic, and prove its soundness and completeness. then, we show how to obtain the metric temporal logic of linear orders by adding an ordering over displacements. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

A logic for variable aliasing in logic programs 4th

引用

4th international conference on algebraic and logic programming, ALP 1994

作者： Marchiori, Elena CWI P.O. Box 94079 Amsterdam1090 GB Netherlands

ISBN: (纸本)9783540584315

this paper introduces a logic for a class of properties - in particular variable aliasing - used in static analysis of logic programs. the logic is shown to be sound, complete and decidable. Moreover, it is illustrated how this logic can be applied to automatize some parts of the reasoning when proving the partial correctness of a logic program. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

logic programs as term rewriting systems 4th

引用

4th international conference on algebraic and logic programming, ALP 1994

作者： Marchiori, Massimo Department of Pure and Applied Mathematics University of Padova Via Belzoni 7 Padova35131 Italy

ISBN: (纸本)9783540584315

this paper studies the relationship between logic programs and term rewriting systems (TRSs). A compositional transform is defined which given a logic program computes a TRS. For a relevant class of logic programs, called Simply Well Moded (SWM), there is a one-to-one correspondence between computed answer substitutions of the logic program and normal forms of the corresponding TRS. Moreover the transform preserves termination, i.e., a logic program terminates of the corresponding TRS terminates. this transform is refined in such a way that the above results hold for a relevant class of unification free programs containing SWM, the class of Flatly Well Moded (FWM) programs. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Preserving universal termination through unfold/fold 4th

引用

4th international conference on algebraic and logic programming, ALP 1994

作者： Bossi, Annalisa Cocco, Nicoletta Dipartimento di Matematica Pura ed Applicata Università di Padova Via Belzoni 7 Padova35131 Italy Dipartimento di Informatica Università di Venezia-Ca’ Foscari Via Torino 155 Mestre-Venezia Italy

ISBN: (纸本)9783540584315

We study how to preserve universal termination besides computed answer substitutions while transforming definite programs. We consider the unfold operation both alone and combined with the introduction of a new definition and fold operations. We prove that unfold always preserves universal termination. Moreover we define a restricted version of the Tamaki-Sato’s transformation sequence and show that it preserves universal termination as well. © Springer-Verlag Berlin Heidelberg 1994.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Concurrent logic programming as uniform linear proofs 4th

引用

4th international conference on algebraic and logic programming, ALP 1994

作者： Volpe, Paolo Dipartimento di Informatica Università di Pisa Corso Italia 40 Pisa56125 Italy

ISBN: (纸本)9783540584315

We describe LC, a formalism based on the proof theory of linear logic, whose aim is to specify concurrent computations and whose language restriction (as compared to other linear logic language) provides a simpler operational model that can lead to a more practical language core. the LC fragment is proveded to be an abstract logic programming language, that is any sequent can be derived by uniform proofs. the resulting class of computations can be viewed in terms of multiset rewriting and is reminiscent of the computations arising in the Chemical Abstract Machine and in the Gamma model. the fragment makes it possible to give a logic foundation to existing extensions of Horn clause logic, such as Generalized Clauses, whose declarative semantics was based on an ad hoc construction. Programs and goals in LC can declaratively be characterized by a suitable instance of the phase semantics of linear logic. A canonical phase model is associated to every LC program. Such a model gives a full characterization of the program computations and can be obtained through a fixpoint construction. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

4th international Workshop on Extensions of logic programming, ELP 1993

4th International Workshop on Extensions of Logic Programmin...

引用

4th international Workshop on Extensions of logic programming, ELP 1993

ISBN: (纸本)9783540580256

the proceedings contain 22 papers. the special focus in this conference is on Extensions of logic programming. the topics include: Design for AKL with intelligent pruning;birkhoff's HSP-theorem for cumulative logic programs;finite domains and exclusions as first-class citizens;some experimental results in implementing a logic language with multi-head clauses on a transputer architecture;a language with finite sets embedded in the CLP-scheme;finitary partial inductive definitions as a general logic;programming methodologies in GCLA;computing cost estimates for proof strategies;logic programming with multiple context management schemes;non-procedural logic programming;axioms in definitional calculi;regular search spaces as a foundation of logic programming;answer sets and nonmonotonic s4;cut formulae and logic programming;higher-order aspects of logic programming;representation and inference with consistent temporal propositions;definitional reflection and the completion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共55页 << < 39 40 41 42 43 44 45 46 47 48 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：