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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

53 篇 会议
9 篇 期刊文献
4 册 图书

馆藏范围

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

日期分布

学科分类号

45 篇 工学
- 43 篇 计算机科学与技术...
- 25 篇 软件工程
- 4 篇 控制科学与工程
- 2 篇 力学（可授工学、理...
- 2 篇 电气工程
- 2 篇 信息与通信工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
- 1 篇 环境科学与工程（可...
- 1 篇 生物医学工程（可授...
20 篇 理学
- 18 篇 数学
- 4 篇 统计学（可授理学、...
- 3 篇 生物学
- 2 篇 物理学
- 1 篇 化学
- 1 篇 系统科学
2 篇 管理学
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理
- 1 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

9 篇 logic programmin...
6 篇 computer circuit...
5 篇 semantics
4 篇 formal logic
4 篇 algebra
3 篇 specifications
3 篇 mathematical log...
3 篇 logics and meani...
2 篇 simulation
2 篇 markov decision ...
2 篇 testing preorder
2 篇 symbolic and alg...
2 篇 software enginee...
2 篇 logic
2 篇 compositionality
2 篇 modal logic
2 篇 programming lang...
2 篇 semiotics
1 篇 hybrid system
1 篇 program calculat...

机构

3 篇 cwi p.o. box 940...
2 篇 trinity coll dub...
2 篇 shanghai jiao to...
1 篇 univ pisa dipart...
1 篇 univ koblenz dep...
1 篇 dept. of patholo...
1 篇 informatics inst...
1 篇 univ utrecht dep...
1 篇 institute of mat...
1 篇 univ texas dept ...
1 篇 dipartimento di ...
1 篇 univ penn dept c...
1 篇 mcmaster univ de...
1 篇 universidade abe...
1 篇 department of co...
1 篇 logic and formal...
1 篇 dipartimento di ...
1 篇 computer science...
1 篇 institut für rec...
1 篇 university of pi...

作者

2 篇 kahl wolfram
2 篇 deng yuxin
2 篇 niemela i
2 篇 teusink f
2 篇 hennessy matthew
1 篇 kozen dexter
1 篇 apt krzysztof r.
1 篇 soh takehide
1 篇 aravindan c
1 篇 bruynooghe mauri...
1 篇 parisi-presicce ...
1 篇 vidal g
1 篇 van oostrom vinc...
1 篇 ball sheldon s.
1 篇 jayararaan bhara...
1 篇 ray oliver
1 篇 kennaway richard
1 篇 gui yx
1 篇 bergstra jan a.
1 篇 diaconescu răzva...

语言

63 篇 英文
3 篇 其他

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

共 66 条记录，以下是51-60 订阅

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

详细简洁

排序：

4th international Symposium on Static Analysis, SAS 1997

引用

4th international Symposium on Static Analysis, SAS 1997

ISBN: (纸本)9783540634683

the proceedings contain 33 papers. the special focus in this conference is on Static Analysis. the topics include: On sparse evaluation representations;the effects of the precision of pointer analysis;fast and effective procedure inlining;set-sharing is redundant for pair-sharing;an algebraic approach to sharing analysis of logic programs;logical optimality of groundness analysis;towards a cost-effective estimation of uncaught exceptions in SML programs;program analysis using mixed term and set constraints;set-based analysis for logic programming and tree automata;denotational abstract interpretation of functional logic programs;termination analysis for mercury;type-based analysis of communication for concurrent programming languages;true concurrency via abstract interpretation;static analysis of interaction nets for distributed implementations;type-directed flow analysis for typed intermediate languages;exact flow analysis;satisfying subtype inequalities in polynomial space;effective specialization of realistic programs via use sensitivity;coalescing conditional branches into efficient indirect jumps;automatic termination analysis for partial functions using polynomial orderings;automatically proving termination of programs in a non-strict higher-order functional language;semantic analyzer of modula-programs;abstract interpretation for improving wam code;attribute grammars and functional programming deforestation;data dependences as abstract interpretations;abstract interpretation based static analysis parameterized by semantics and practical compile-time analysis.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An introduction to category-based equational logic 4th

引用

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

作者： Goguen, Joseph A. Diaconescu, Răzvan Programming Research Group Oxford University Computing Lab OxfordOX1 3QD United Kingdom Institute of Mathematics of the Romanian Academy PO Box 1-764 Bucharest70700 Romania

ISBN: (纸本)3540600434

this paper surveys category-based equational logic, which generalises both the theoretical and computational aspects of equational logic and its model theory (general algebra) far beyond terms, so as to include: Horn clause logic, with and without equality;all variants of order and many sorted equational logic, including working modulo a set of axioms;constraint logic programming over arbitrary user-defined data types;and any combination of the above. this unifies several important computational paradigms, and opens the door to still further generalisations. Results include completeness of deduction, a Herbrand theorem, completeness of paramodulation, generic modularisation techniques, and a model theoretic semantics for extensible constraint logic programing. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

4th international conference on Database theory, ICDT 1992

引用

4th international conference on Database theory, ICDT 1992

ISBN: (纸本)9783540560395

the proceedings contain 29 papers. the special focus in this conference is on Database theory. the topics include: Combinatorial and algebraic results for database relations;semantics of disjunctive deductive databases;on the composition and decomposition of attributes and tuples;approximate dependency inference from relations;views and decompositions of databases from a categorical perspective;computing with infinitary logic;query languages with counters;naturally embedded query languages;optimizing incremental computation of datalog programs with non-deterministic semantics;context-specific synchronization for atomic data types;hybrid atomicity for nested transactions;model and verification of a data manager based on ARIES;minimizing indefinite information in disjunctive deductive databases;well founded semantics and stable semantics of semi-strict programs;on finding extensions of default theories;incremental evaluation of datalog queries;decidability and undecidability of equivalence for linear datalog, with applications to normal-form optimizations;a paradox in database theory;a hierarchy of faithful set creation in pure OODB's;identification, genericity and consistency in object-oriented databases;subsumption for complex object data models;semantic information connected with data;declarative foundations of secure deductive databases;on materializing views and on-line queries;maintaining dictionaries: space-saving modifications of b-trees and set-term matching in logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

algebraic and Numeric Biology 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Katsuhisa Horimoto Masahiko Nakatsui Nikolaj Popov

ISBN: (数字)9783642280672

ISBN: (纸本)9783642280665

this book constitutes the refereed proceedings of the 4th international conference on algebraic Biology, ANB 2010, held at the Castle of Hagenberg, Austria in July/August 2010. the conference is a follow up of the AB conference. the 10 papers were carefully reviewed and selected from numerous submissions. the papers are organized in topical sections on mathematical modeling, system analysis and design, genomics, molecular structure analysis, automata theory, artificial intelligence, sequence analysis, automated reasoning, formal language and hybrid symbolic numerical methods.

关键词： logics and Meanings of Programs Mathematical logic and Formal Languages Symbolic and algebraic Manipulation Computational Biology/Bioinformatics Software Engineering programming Languages, Compilers, Interpreters

来源：评论

学校读者我要写书评

暂无评论

Meaningless terms in rewriting 5th

Meaningless terms in rewriting

引用

5th international conference on algebraic and logic programming, alp 1996

作者： Kennaway, Richard van Oostrom, Vincent de Vries, Fer-Jan School of Information Systems University of East Anglia NorwichNR4 7TJ United Kingdom NTT BRL Information Processing Principles Research Group 3-1 Wakamiya Morinosato Atsugi-shiKanagawa243-01 Japan Hitachi Advanced Research Laboratory HatoyamaSaitama350-03 Japan

ISBN: (纸本)3540617353

We present an axiomatic approach to meaninglessness in finite and trąnsfinite term rewriting and lambda calculus. We justify our axioms in two ways. First, they are shown to imply important properties of meaninglessness: genericity of the class of meaningless terms, the consistency of equating all meaningless terms, and the construction of Böhm trees. Second we show that they can be easily verified for existing notions of meaninglessness. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Discrete normalization and standardization in deterministic residual structures 5th

Discrete normalization and standardization in deterministic ...

引用

Proceedings of the 1996 5th international conference on algebraic and logic programming, alp'96

作者： Khasidashvili, Zurab Glauert, John School of Information Systems UEA Norwich NR4 7TJ United Kingdom

ISBN: (纸本)3540617353

We prove a version of the Standardization theorem and the Discrete Normalization theorem in stable Deterministic Residual Structures, Abstract Reduction Systems with axiomatized notions of residual, which model orthogonal rewrite systems. the latter theorem gives a strategy for construction of reductions Lévy-equivalent (or permutation-equivalent) to a given, finite or infinite, regular (or semi-linear) reduction, based on the neededness concept of Huet and Lévy. this and other results of this paper add to the understanding of Lévy-equivalence of reductions, and consequently, Lévy's reduction space. We demonstrate how elements of this space can be used to give denotatJonal semantics to known functional languages in an abstract manner. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

7th REX School/Symposium on Decade of Concurrency, 1993

7th REX School/Symposium on Decade of Concurrency, 1993

引用

4th international conference on Human-Computer Interaction, EWHCI 1994

ISBN: (纸本)9783540586487

the proceedings contain 15 papers. the special focus in this conference is on Decade of Concurrency. the topics include: Data-Flow synchronous languages;process algebra with backtracking;some chemical abstract machines;verification tools for finite-state concurrent systems;linear logic on petri nets;an introduction to the theoretical aspects of coloured petri nets;temporal verification of simulation and refinement;verification and specification of concurrent programs;simulation techniques for proving properties of real-time systems;relationships between models of concurrency;interaction diagrams;algebraic theories for name-passing calculi;initial algebra and final coalgebra semantics for concurrency;logical specifications of infinite computations and partial order based design of concurrent systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

international conference on Artificial Intelligence and Symbolic Computation, AISC 1998

International Conference on Artificial Intelligence and Symb...

引用

4th international conference on Artificial Intelligence and Symbolic Computation, AISC 1998

ISBN: (纸本)3540649603

the proceedings contain 24 papers. the special focus in this conference is on Artificial Intelligence and Symbolic Computation. the topics include: An inductive logic programming query language for database mining;bertrand russell, herbrand’s theorem, and the assignment statement;representing and reasoning with context;the benefits we get from computer algebra;automatic generation of epsilon-delta proofs of continuity;finite model search for equational theories;specification and integration of theorem provers and computer algebra systems;an evolutionary algorithm for welding task sequence ordering;intuitionistic proof transformations and their application to constructive program synthesis;combining algebraic computing and term-rewriting for geometry theorem proving;cooperation between top-down and bottom-up theorem provers by subgoal clause transfer;polymorphic call-by-value calculus based on classical proofs;inference and verification in medical appropriateness criteria using grobner bases;the unification problem for one relation thue systems;basic completion with e-cycle simplification;a domain-independent scheme for constraint solver extension;optimising propositional modal satisfiability for description logic subsumption;instantiation of existentially quantified variables in induction specification proofs;knowledge discovery objects and queries in distributed knowledge systems;an algebraic language and TYPE system;real parametrization of algebraic curves and non-clausal reasoning with propositional definite theories.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Proposition algebra and short-circuit logic

Proposition algebra and short-circuit logic

引用

4th IPM international conference on Fundamentals of Software Engineering, FSEN 2011

作者： Bergstra, Jan A. Ponse, Alban Informatics Institute Faculty of Science University of Amsterdam Netherlands

ISBN: (纸本)9783642293191

Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. We review proposition algebra [2010], an algebraic approach to propositional logic with side effects that models short-circuit evaluation. Proposition algebra is based on Hoare's conditional [1985], which is a ternary connective comparable to if-then-else. Starting from McCarthy's notion of sequential evaluation [1963] we discuss a number of valuation congruences on propositional statements and we introduce Hoare-McCarthy algebras as the structures that model these congruences. We also briefly discuss the associated short-circuit logics, i.e., the logics that define these congruences if one restricts to sequential binary connectives. © 2012 Springer-Verlag.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Verification of logic programs with delay declarations 4th

引用

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

作者： Apt, Krzysztof R. Luitjes, Ingrid CWI P.O. Box 94079 Amsterdam1090 GB Netherlands Department of Mathematics and COmputer Science University of Amsterdam Plantage Muidergracht 24 Amsterdam1018 TV Netherlands

ISBN: (纸本)3540600434

logic programs augmented with delay declarations form a higly expressive programming language in which dynamic networks of processes that communicate asynchronously by means of multiparty channeis can be easily created. In this paper we study correctness these programs. In particular, we propose proof methods allowing us to deal with occur check freedom, absence of deadlock, absence of errors in presence of arithmetic relations, and termination. these methods turn out to be simple modifications of the corresponding methods dealing with Prolog programs. this allows us to derive correct delay declarations by analyzing Prolog programs. Finally, we point out diffculties concerning proofs of termination. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：