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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 种 纸本馆藏

日期分布

学科分类号

381 篇 工学
- 346 篇 计算机科学与技术...
- 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 条记录，以下是451-460 订阅

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

详细简洁

排序：

Demonic algebra with domain

引用

9th international conference on Relational Methods in Computer Science and 4th international Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006

作者： De Carufel, Jean-Lou Desharnais, Jules Département d'Informatique et de Génie Logiciel Université Lavai Québec Que. G1K 7P4 Canada

ISBN: (纸本)3540378731

We first recall the concept of Kleene algebra with domain (KAD). then we explain how to use the operators of KAD to define a demonic refinement ordering and demonic operators (many of these definitions come from the literature). then, taking the properties of the KAD-based demonic operators as a guideline, we axiomatise an algebra that we call Demonic algebra with domain (DAD). the laws of DAD not concerning the domain operator agree with those given in the 1987 CACM paper Laws of programming by Hoare et al. Finally, we investigate the relationship between demonic algebras with domain and KAD-based demonic algebras. the question is whether every DAD is isomorphic to a KAD-based demonic algebra, We show that it is not the case in general. However, if a DAD D is isomorphic to a demonic algebra based on a KAD K, then it is possible to construct a KAD isomorphic to K, using the operators of D. We also describe a few open problems. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Constraint representation for propagation 4th

Constraint representation for propagation

引用

4th international conference on Principles and Practice of Constraint programming, CP 1998

作者： Harvey, Warwick Stuckey, Peter J. School of Computer Science and Software Engineering Monash University ClaytonVIC3168 Australia Department of Computer Science University of Melbourne ParkvilleVIC3052 Australia

ISBN: (纸本)3540652248

Propagation based finite domain solvers provide a general mechanism for solving combinatorial problems. Different propagation methods can be used in conjunction by communicating through the do- mains of shared variables. the flexibility that this entails has been an important factor in the success of propagation based solving for solving hard combinatorial problems. In this paper we investigate how linear integer constraints should be represented in order that propagation can determine strong domain information. We identify two kinds of substitution which can improve propagation solvers, and can never weaken the do- main information. this leads us to an alternate approach to propagation based solving where the form of constraints is modified by substitution as computation progresses. We compare and contrast a solver using substitution against an indexical based solver, the current method of choice for implementing propagation based constraint solvers, identifying the the relative advantages and disadvantages of the two approaches. © Springer-Verlag Berlin Heidelberg 1998.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Physical programming: Beyond mere logic (invited talk) 4

引用

4th international conference on Fundamental Approaches to Software Engineering, FASE 2001, Held as Part of the Joint European conferences on theory and Practice of Software, ETAPS 2001

作者： Selic, Bran Rational Software Inc Canada

ISBN: (纸本)3540418636

Plato believed in a "pure" reality, where ideas existed in their perfection into eternity. What we perceive as reality, he claimed, is merely a flawed shadow of this ideal world. Many mathematicians find this view appealing since it is precisely this universe of ideas that is the subject of their exploration and discovery. the computer, and more specifically, software, seem perfectly suited to this viewpoint. they allow us to create our own reality, one in which we can simply ignore the underlying physics, forget the tyranny of inertial mass, the drudgery of dealing with machinery that leaks or parts that do not quite fit. But, can we? Even in the ideal world with infinite resources, we have discovered that there are limits to computability. However, the situation with computers and software is much more dire than mere limits on what can be computed. As computers today play an indispensable part of our daily lives we find that more and more of the software in them needs to interact with the physical world. Unfortunately, the current generation of software technologies and practices are constructed around the old Platonic ideal. Standard wisdom in designing software encourages us to ignore the underlying technological platform Ð after all, it is likely to change in a few years anyway Ð and focus exclusively on the program "logic". However, when physical distribution enters the picture, we find that mundane things such as transmission delays or component failures may have a major impact on that logic. the need to deal with this kind of raw physical "stufi" out of which the software is constructed has been relegated to highly specialised areas, such as real-time programming. the result is that we are singularly unprepared for the coming new generation of Internet-based software. Even languages that were nominally designed for this environment, such as Java, are lacking in this regard. For example, it has no facility to formally express that a communication between two

关键词： Machinery

来源：评论

学校读者我要写书评

暂无评论

An Answer Set programming Solution for Supply Chain Traceability

An Answer Set Programming Solution for Supply Chain Traceabi...

引用

4th international Joint conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management, IC3K 2012

作者： Nogueira, Monica L. Greis, Noel P. Center for Logistics and Digital Strategy The University of North Carolina at Chapel Hill Kenan Center CB#3440 Chapel Hill 27713 United States

ISBN: (纸本)9783642541049

Developing measures to improve the traceability of contaminated food products across the supply chain is one of the key provisions of the 2011 FDA Food Safety Modernization Act (FSMA). In the event of a recall, FSMA requires companies to provide information about their immediate suppliers and customers-what is referred to as "one step forward" and "one step backward" traceability. In this paper we implement the logic-based approach called answer set programming that uses inference rules to trace the flows of contaminated products-both upstream to the source of the contamination and downstream to consumer locations. the approach does not require common standards or unique product identifiers for tracking individual products. this elaboration-tolerant method can accommodate changes in the supply chain such as: 1) the addition of new multiple product pathways;2) consideration of multiple ingredients in a single product;and 3) multiple products with multiple pathways. We demonstrate this highly flexible methodology for pork and peanut products. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Supply chains

来源：评论

学校读者我要写书评

暂无评论

A parallelized theorem prover for a logic with parallel execution

A parallelized theorem prover for a logic with parallel exec...

引用

4th international conference on Interactive theorem Proving, ITP 2013

作者： Rager, David L. Hunt Jr., Warren A. Kaufmann, Matt University of Texas at Austin Department of Computer Science 2317 Speedway Stop D9500 Austin TX 78712 United States

ISBN: (纸本)9783642396335

In order to take best advantage of modern multi-core systems, interactive theorem provers need to parallelize execution effectively. We describe our modification to a particular theorem prover, ACL2, to use parallel execution automatically in its proof process. Since the ACL2 prover is written primarily in the ACL2 programming language, our approach to parallelization takes advantage of ACL2 language primitives for parallel execution. We demonstrate that the resulting system often provides earlier useful feedback from failed proofs and significant reduction of execution time for successful proofs. thus, our system not only incorporates parallelism into its proof process, but it also provides a platform for writing and verifying parallel programs written in the ACL2 programming language. © 2013 Springer-Verlag.

关键词： theorem proving

来源：评论

学校读者我要写书评

暂无评论

4th Intenational Symposium of VDM on Formal Software Development Methods, VDM 1991

引用

4th international Symposium of VDM on Formal Software Development Methods, VDM 1991

ISBN: (纸本)9783540548683

the proceedings contain 62 papers. the special focus in this conference is on Formal Software Development Methods. the topics include: Description is our business;concurrent processes as objects;the larch approach to specification;formal specification in metamorphic programming;implicit invocation mechanisms;on type checking in VDM and related consistency issues;combining transformation and posit-and-prove in a VDM development;a case for structured analysis/formal design;a model-oriented method for algebraic specifications using COLD-1 as notation;mechanical formalization of several fairness notions;specification and stepwise development of communicating systems;Z and high level petri nets;an approach to the static semantics of VDM-SL;behavioural extension for CSP;tactical tools for distributing VDM specifications;an attempt to reason about shared-state concurrency in the style of VDM;reasoning about VDM specification;formal specification of a proof tool;reasoning about VDM developments using the VDM support tool in mural;deriving transitivity of VDM-reification in DEVA;upgrading the pre-and postcondition technique;the formal development of a secure transaction mechanism;formal development of a serial copy management system;specification and refinement in an integrated database application environment;techniques for partial specification and specification of switching systems;specification of the MAA standard in VDM;unintrusive ways to integrate formal specifications in practice;an overview of HP-SL;a debugger for a meta-iv-like meta-language;an executable subset of meta-IV with loose specification;using VDM within an object-oriented framework;the integrated software development and verification system Ates.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rule validation of a meta-classifier through a galois (concept) lattice and complementary means

Rule validation of a meta-classifier through a galois (conce...

引用

4th international conference on Concept Lattices and their Applications

作者： Aoun-Allah, Mohamed Mineau, Guy Imam Univ Dept Comp Sci POB 84880 Riyadh 11681 Saudi Arabia Univ Laval Comp Sci & Software Engn Dept Lab Computat Intelligence Quebec City PQ G1K 7P4 Canada

ISBN: (纸本)9783540789208

In this work we are interested in the problem of mining very large distributed databases. We propose a distributed data mining technique which produces a meta-classifier that is both predictive and descriptive. this meta-classifier is made of a set of classification rules, which can be refined then validated. the refinement step, proposes to remove from the meta-classifier rules that according to their confidence coefficient, computed by statistical means, would not have a good prediction capability when used with new objects. the validation step uses some samples to fine-tune rules in the rule set resulted from the refinement step. this paper deals especially with the validation process. Indeed, we propose two validation techniques: the first one is very simple and the second one uses a Galois lattice. A detailed description of these processes is presented in the paper, as well as the experimentation proving the viability of our approach.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

4th international conference on Formal Engineering Methods, ICFEM 2002

4th International Conference on Formal Engineering Methods, ...

引用

4th international conference on Formal Engineering Methods, ICFEM 2002

ISBN: (纸本)9783540000297

the proceedings contain 62 papers. the special focus in this conference is on Component Engineering and Software Architecture. the topics include: A refinement based layered software architecture;developing quality software systems using the SOFL formal engineering method;maintaining referential integrity on the web;formal methods in enterprise computing;unifying theories of parallel programming;an ADL supporting component composition;the description of corba objects based on petri nets;toward a formal model of software components;a specification-based software construction framework for reuse;specifying a component model for building dynamically reconfigurable distributed systems;three-tiered specification of micro-architectures;modeling the architecture for component-based e-commerce system;component specification and wrapper/glue code generation with two-level grammar using domain specific knowledge;abstract specification in object-Z and CSP;mechanization of an integrated approach;an important distinction in building generic specifications;an overview of mobile object-Z;Z approach to semantic web;hardware/software partitioning in verilog;a formal methodology to specify E-commerce systems;model-based specification animation using testgraphs;an abstract model for scheduling real-time programs;formal representation and analysis of batch stock trading systems by logical petri net workflows;a calculus for mobile network systems;modelling real-time systems with continuous-time temporal logic;on concept-based definition of domain-specific languages;formal specification of evolutionary software agents;detecting deadlock in ADA rendezvous flow structure;based on process algebra;formal analysis of real-time systems with SAM;tool support for visualizing CSP in UML.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Flexible Dispute Derivations with Forward and Backward Arguments for Assumption-Based Argumentation 4th

Flexible Dispute Derivations with Forward and Backward Argum...

引用

4th international conference on logic and Argumentation (CLAR)

作者： Diller, Martin Gaggl, Sarah Alice Gorczyca, Piotr Tech Univ Dresden Fac Comp Sci Log Programming & Argumentat Grp Dresden Germany

ISBN: (纸本)9783030893910;9783030893903

Assumption-based argumentation (ABA) is one of the main general frameworks for structured argumentation. Dispute derivations for ABA allow for evaluating claims in a dialectical manner: i.e. on the basis of an exchange of arguments and counter-arguments for a claim between a proponent and an opponent of the claim. Current versions of dispute derivations are geared towards determining (credulous) acceptance of claims w.r.t. the admissibility-based semantics that ABA inherits from abstract argumentation. Relatedly, they make use of backwards or top down reasoning for constructing arguments. In this work we define flexible dispute derivations with forward as well as backward reasoning allowing us, in particular, to also have dispute derivations for finding admissible, complete, and stable assumption sets rather than only determine acceptability of claims. We give an argumentation-based definition of such dispute derivations and a more implementation friendly alternative representation in which disputes involve exchange of claims and rules rather than arguments. these can be seen as elaborations on, in particular, existing graph-based dispute derivations on two fronts: first, in also allowing for forward reasoning;second, in that all arguments put forward in the dispute are represented by a graph and not only the proponents.

关键词： Argumentation Assumption-based argumentation Dispute derivations

来源：评论

学校读者我要写书评

暂无评论

Network flow interpretation of logical structures in decision support systems

Network flow interpretation of logical structures in decisio...

引用

international IEEE conference on Intelligent Systems, IS

作者： Vassil Sgurev Mincho Hadjiski Vladimir Jotsov Bulgarian Academy of Sciences Sofia Bulgaria

Enhanced network flow methods have been proposed in the logical operations frame aiming at efficient methods and algorithms in the analysis and synthesis of various logical structures. Quantitative truth maintenance methods have been combined or replaced by qualitative optimization calculations. the method is widely applicable in intelligent systems.

关键词： Decision support systems Intelligent systems logic programming Intelligent structures Computational intelligence Linear programming Equations Intelligent networks Algorithm design and analysis Network synthesis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共55页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：