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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Implementing a notion of modules in the logic programming language λProlog 3rd

引用

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

作者： Kwon, Keehang Nadathur, Gopalan Wilson, Debra Sue Department of Computer Science Duke University NC27707 United States

ISBN: (纸本)9783540564546

Issues concerning the implementation of a notion of modules in the higher-order logic programming language λProlog are examined. A program in this language is a composite of type declarations and procedure definitions. The module construct that is considered permits large collections of such declarations and definitions to be decomposed into smaller units. Mechanisms are provided for controlling the interaction of these units and for restricting the visibility of names used within any unit. The typical interaction between modules has both a static and a dynamic nature. The parsing of expressions in a module might require declarations in a module that it interacts with, and this information must be available during compilation. Procedure definitions within a module might utilize procedures presented in other modules and support must be provided for making the appropriate invocation during execution. Our concern here is largely with the dynamic aspects of module interaction. We describe a method for compiling each module into an independent fragment of code. Static interactions prevent the compilation of interacting modules from being completely decoupled. However, using the idea of an interface definition presented here, a fair degree of independence can be achieved even at this level. The dynamic semantics of the module construct involve enhancing existing program contexts with the procedures defined in particular modules. A method is presented for achieving this effect through a linking process applied to the compiled code generated for each module. A direct implementation of the dynamic semantics leads to considerable redundancy in search. We present a way in which this redundancy can be controlled, prove the correctness of our approach and describe run-time structures for incorporating this idea into the overall implementation. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

Towards Maude 2.0

Towards Maude 2.0

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Clave, M. Durán, F. Eker, S. Lincoln, P. Martí-Oliet, N. Meseguer, J. Quesada, J.F. Departamento de Filosofia Universidad de Navarra Spain ETSII Universidad de Malaga Spain SRI International Menlo Park CA United States Facultad de Matemáticas Universidad Complutense Madrid Spain Centra de Informática Cientifica de Andalucía Sevilla Spain

Maude 2.0 is the new version of the Maude rewriting logic language currently under development. Maude 2.0's three main goals are: (i) greater generality and expressiveness;(ii) efficient support for a wider range of programming applications;and (iii) usability as a key component for developing internet programming and mobile computing systems. To meet these goals, a number of new features have been added. The membership equational logic of functional modules and the rewriting logic of system modules are now supported in their greatest possible generality, and the operational semantics of object-oriented modules guarantees object and message fairness. Module operations in Full Maude are also more general thanks to parameterized theories and views. Efficient support for a wider range of programming applications is provided both by the Maude compiler - which can reach up to 15 million rewrites per second on a 667MHz Xeon - and by a library of new built-in modules. Besides new built-in functional modules, a key new feature is built-in object-oriented modules that provide flexible interaction with external objects such as file systems, window systems, and internet sockets. In particular, built-in internet sockets will provide excellent support for a new declarative style of internet programming in Maude, and will be used as a key building block to implement the Mobile Maude language. ©2000 Published by Elsevier Science B. V.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

3rd international workshop on Computer Aided Verification, CAV 1991

引用

3rd international workshop on Computer Aided Verification, CAV 1991

ISBN: (纸本)9783540551799

The proceedings contain 44 papers. The special focus in this conference is on Computer Aided Verification. The topics include: Taming infinite state spaces;branching bisimilarity is decidable for context-free processes;computing distinguishing formulas for branching bisimulation;compositional checking of satisfaction;an action based framework for verifying logical and behavioural properties of concurrent systems;a linear-time model-checking algorithm for the alternation-free modal mu-calculus;automatic temporal verification of buffer systems;mechanically checked proofs of kernel specifications;a top down approach to the formal specification of SCI cache coherence;integer programming in the analysis of concurrent systems;the lotos model of a fault protected system and its verification using a petri net based approach;error diagnosis in finite communicating systems;temporal precondition verification of design transformations;a process algebra manipulator;the concurrency workbench with priorities;a proof assistant for PSF;avoiding state explosion by composition of minimal covering graphs;bounded-memory algorithms for verification on-the-fly;generating BDDs for symbolic model checking in CCS;vectorized symbolic model checking of computation tree logic for sequential machine verification;functional extension of symbolic model checking;an automated proof technique for finite-state machine equivalence;from data structure to process structure;checking for language inclusion using simulation preorders;a semantic driven method to check the fineteness of CCS processes and using the HOL prove assistant for proving the correctness of term rewriting rules reducing terms of sequential behaviour.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reachability Problems 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Olivier Bournez Igor Potapov

ISBN: (数字)9783642044205

ISBN: (纸本)9783642044199

This book constitutes the research papers presented at the 3rd international workshop, RP 2009 held in Palaiseau, France, September 23-25, 2009. The 20 full papers of this workshop reflect reachability problems that appear in algebraic structures, computational models, hybrid systems and verification. Reachability is a fundamental problem in the context of many models and abstractions which are describing various computational processes. Topics of interest include reachability problems in infinite state systems, rewriting systems, dynamical and hybrid systems, reachability problems in logic and verification, reachability analysis in different computational models, counter, timed, cellular, communicating automata, Petri-Nets, computational aspects of algebraic structures and predictability in iterative maps and new computational paradigms.

关键词： Mathematics of Computing Theory of Computation programming Techniques Algorithm Analysis and Problem Complexity logics and Meanings of Programs Computation by Abstract Devices

来源：评论

学校读者我要写书评

暂无评论

A methodology towards automatic implementation of N-body algorithms

A methodology towards automatic implementation of <i>N</i>-b...

引用

3rd PanAmerican workshop on Applied and Computational Mathematics

作者： Pauca, VP Rodriguez, AF Sun, X Trivedi, KS Duke Univ Dept Comp Sci Durham NC 27708 USA Duke Univ Dept Elect & Comp Engn Durham NC 27708 USA IBM Corp ITSO Cary NC 27513 USA

We propose a methodology aimed at automating the software development of fast discrete transforms for N-body problems. The methodology starts with a representation of the transform matrix in compact form. Then, two translation phases are applied. One translates matrix notation to an intermediate form. The other translates the intermediate form to compilable code for a target computing environment. The generated target code employs a library of pre-defined and optimized routines. We apply our methodology systematically to implement the three-dimensional fast multipole method. We demonstrate the efficiency of our code in a molecular dynamics simulation. (C) 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.

关键词： approximation methods discrete transforms programming software

来源：评论

学校读者我要写书评

暂无评论

Termination and normalisation under strategy proofs in ELAN

Termination and normalisation under strategy proofs in ELAN

引用

The 3rd international workshop on Rewriting logic and its Applications

作者： Kirchner, Hélène Gnaedig, Isabelle LORIA-CNRS and INRIA-Lorraine BP 239 54506 Vandceuvre-les-Nancy Cedex France

In this paper, we review several methods for proving termination of rewrite programs or answer questions about normal forms. We concentrate on the methods that have been designed in ELAN and which are useful for studying termination and normal forms of ELAN programs. We address several problems: general termination of a rewrite program, innermost termination on sets of ground terms, computation or approximation of the set of normal forms, modular termination of the union of rewrite systems, estimation of the number of normal forms for a non-deterministic rewrite program with strategies. For each point we briefly present one method, explain its scope and give references to other methods concerning the same problem, before describing the implementation in ELAN. We conclude with some open questions. ©2000 Published by Elsevier Science B. V.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Providing Dynamic Instructional Adaptation in programming Learning

Providing Dynamic Instructional Adaptation in Programming Le...

引用

3rd international workshop on Hybrid Artificial Intelligence Systems

作者： Jurado, Francisco Santos, Olga C. Redodo, Miguel A. Boticario, Jesus G. Ortega, Manuel Univ Castilla La Mancha Comp Sci & Engn Fac Paseo Univ 4 E-13071 Ciudad Real Spain Univ Nacl Educ Distancia Sch Comp Sci aDeNu Res Grp E-28040 Madrid Spain

ISBN: (纸本)9783540876557

This paper describes an approach to create an Intelligent Tutoring System that provides dynamic personalization and learning activities sequencing adaptation by combining eLearning standards and Artificial Intelligent techniques. The work takes advantage of the functionalities provided by an open source Learning Management System, dotLRN, which supports eLearning standards such as IMS-LD, and generates personalized sequences of learning activities. Moreover, the user model draws on standards such as IMS-LIP and IMS-AccLIP and the personalized learning path provided to the user is enriched with feedback coming from various Agents. In turn, the agents apply Fuzzy logic to evaluate the students' assignments and to update the user model with their preferences by means of machine learning techniques.

关键词： Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Teaching Control Engineering Concepts using Open Source tools on a Raspberry Pi board

Teaching Control Engineering Concepts using Open Source tool...

引用

3rd IFAC workshop on Internet Based Control Education (IBCE 2015)

作者： Hoyo, Angeles Luis Guzman, Jose Carlos Moreno, Jose Berenguel, Manuel Univ Almeria Dept Informat Almeria 04120 Spain

This paper presents the idea about how to combine a set of software and hardware resources available in literature to be used as support to control engineering education. The available tools allow to mix topics related to programming, communications, operating systems, and control theory. The well-known Raspberry Pi board is used as platform to exploit the di_erent proposed concepts. SciPy, Matplotlib, and NumPy libraries, which are Python-based open-source libraries for scienti_c computing and graphical representation, are used to perform Matlab-like simulations and to implement classical control loops. On the other hand, virtual processes developed in Easy Java Simulations are adapted to be controlled through the network from a controller implemented on the Raspberry Pi with Python. This option is very useful from a teaching point of view since time-based, networked-based, or event-based control approaches can be easily introduced on this proposed architecture. Furthermore, once students know how to implement control loops on the Raspberry Pi using Python, external real processes can be easily controlled by using the GPIO interface available in the this electronic board. Then, a project based on these tools and ideas is motivated and presented in this paper to control a two-tank level process (C) Copyright IFAC 2015. (C) 2015, IFAC international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： programming control Communications Raspberry Pi Python

来源：评论

学校读者我要写书评

暂无评论

A Novel EGs-Based Framework for Systematic Propositional-Formula Simplification 33rd

A Novel EGs-Based Framework for Systematic Propositional-For...

引用

33rd international Symposium on logic-Based Program Synthesis and Transformation (LOPSTR)

作者： de Mas, Jordina Frances Bowles, Juliana Univ St Andrews Sch Comp Sci St Andrews KY16 9SX Fife Scotland Software Competence Ctr Hagenberg SCCH A-4232 Hagenberg In Muhlkreis Austria

ISBN: (纸本)9783031457838;9783031457845

This paper presents a novel simplification calculus for propositional logic derived from Peirce’s Existential Graphs’ rules of inference and implication graphs. Our rules can be applied to arbitrary propositional logic formulae (not only in CNF), are equivalence-preserving, guarantee a monotonically decreasing number of clauses and literals, and maximise the preservation of structural problem information. Our techniques can also be seen as higher-level SAT preprocessing, and we show how one of our rules (TWSR) generalises and streamlines most of the known equivalence-preserving SAT preprocessing methods. We further show how this rule can be extended with a novel n-ary implication graph to capture all known equivalence-preserving preprocessing procedures. Finally, we discuss the complexity and implementation of our framework as a solver-agnostic algorithm to simplify Boolean satisfiability problems and arbitrary propositional formula. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2023.

关键词： Simplification Existential graphs Equivalence-preserving preprocessing Propositional satisfiability Diagrammatic reasoning knowledge representation Implication graphs Hypergraphs

来源：评论

学校读者我要写书评

暂无评论

Conditional narrowing with constructive negation 3rd

引用

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

作者： Ramírez, María José Falaschi, Moreno Departamento de Sistemas Informáticos y Computación Universidad Politécnica de Valencia Camino de Vera s/n Apdo. 22012 Valencia46020 Spain Dipartimento di Informatica Università di Pisa Corso Italia 40 Pisa56125 Italy

ISBN: (纸本)9783540564546

In this paper we present a narrower for conditional equational theories whose clauses allow disequations in their bodies (normal theories). Our approach deals with disequations in a constructive manner and thus allows non ground negative queries. We give a formal operational semantics for normal theories and define the notion of completion and stratification of a normal theory. We show that there exists one minimal model for the completion of a stratified normal theory. Then we prove the correctness of the operational semantics with respect to the completion of a stratified normal theory. © Springer-Verlag Berlin Heidelberg 1993.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共37页 << < 28 29 30 31 32 33 34 35 36 37 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：