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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Towards B as a High-Level Constraint Modelling Language Solving the Jobs Puzzle Challenge

Towards B as a High-Level Constraint Modelling Language Solv...

引用

4th international conference on Abstract State Machines, Alloy, B, TLA,VDM, and Z (ABZ)

作者： Leuschel, Michael Schneider, David Univ Dusseldorf Inst Informat Univ Str 1 D-40225 Dusseldorf Germany

ISBN: (纸本)9783662436523;9783662436516

We argue that B is a good language to conveniently express a wide range of constraint satisfaction problems. We also show that some problems can be solved quite effectively by the PROB tool. We illustrate our claim on several examples, such as the jobs puzzle - for which we solve the challenge set out by Shapiro. Here we show that the B formalization is both very close to the natural language specification and can still be solved efficiently by PROB. Our approach is particularly interesting when a high assurance of correctness is required. Indeed, compared to other existing approaches and tools, validation and double checking of solutions is available for PROB and formal proof can be applied to establish important properties or provide an unambiguous semantics to the problem specification.

关键词： B-method constraint programming logic programming Alloy Kodkod optimization

来源：评论

学校读者我要写书评

暂无评论

Formal verification of ST programs using CSP 4

Formal verification of ST programs using CSP

引用

2021 4th international conference on Computer Information Science and Application Technology, CISAT 2021

作者： Zhou, Qibin Cai, Fangda Yang, Yang Wu, Changshun Shanghai Jianqiao University Shanghai201306 China East China Normal University Shanghai200062 China Shanghai Formal-Tech Information Technology Co. Ltd. Shanghai200333 China

Programmable logic Controllers (PLCs) are embedded devices that are widely used in industrial control systems. PLC programs are written in special languages that are defined in the IEC 61131-3 standard, which includes two textual and three graphical programming languages. Structured text (ST) language is one of IEC 61131-3 standards, which is a high-level text language similar to PASCAL language. ST language features the following advantages: freely programming style, compact structure and strong data processing capabilities. Using ST language can be more convenient to realize the complex control programs. In this paper, we research and discuss formal verification of PLC program based on ST language, and show the conversion rules from ST language to the formal modeling language named CSP# (short for Communicating Sequential Programs). Finally, a case study is presented to demonstrate the procedure that PLC programs written in ST language are translated into CSP#, consequently, and the result of verification is given using the Process Analysis Toolkit (PAT). © Content from this work may be used under the terms of the Creative Commons Attribution 3.0 Licence.

关键词： Programmable logic controllers

来源：评论

学校读者我要写书评

暂无评论

Advanced Intelligent Computing theories and Applications. With Aspects of Artificial Intelligence 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540859840

ISBN: (纸本)9783540859833

the international conference on Intelligent Computing (ICIC) was formed to p- vide an annual forum dedicated to the emerging and challenging topics in artificial intelligence, machine learning, bioinformatics, and computational biology, etc. It aims to bring together researchers and practitioners from both academia and ind- try to share ideas, problems and solutions related to the multifaceted aspects of intelligent computing. ICIC 2008, held in Shanghai, China, September 15–18, 2008, constituted the 4th international conference on Intelligent Computing. It built upon the success of ICIC 2007, ICIC 2006 and ICIC 2005 held in Qingdao, Kunming and Hefei, China, 2007, 2006 and 2005, respectively. this year, the conference concentrated mainly on the theories and methodologies as well as the emerging applications of intelligent computing. Its aim was to unify the picture of contemporary intelligent computing techniques as an integral concept that highlights the trends in advanced computational intelligence and bridges theoretical research with applications. therefore, the theme for this conference was “Emerging Intelligent Computing Technology and Applications”. Papers focusing on this theme were solicited, addressing theories, methodologies, and applications in science and technology.

关键词： programming Techniques programming Languages, Compilers, Interpreters Database Management Artificial Intelligence Mathematical logic and Formal Languages Computation by Abstract Devices

来源：评论

学校读者我要写书评

暂无评论

A distributed logic for Networked Cyber-Physical Systems

A distributed logic for Networked Cyber-Physical Systems

引用

4th IPM international conference on Fundamentals of Software Engineering (FSEN)

作者： Kim, Minyoung Stehr, Mark-Oliver Talcott, Carolyn SRI Int Menlo Pk CA 94025 USA

ISBN: (纸本)9783642293191

We describe a distributed logical framework designed to serve as a declarative semantic foundation for Networked Cyber-Physical Systems. the framework provides notions of facts and goals that include interactions with the environment via external goal requests, observations that generate facts, and actions that achieve goals. Reasoning rules are built on a partially ordered knowledge-sharing model for loosely coupled distributed computing. the logic supports reasoning in the context of dynamically changing facts and system goals. It can be used both to program systems and to reason about possible scenarios and emerging properties. the underlying reasoning framework is specified in terms of constraints that must be satisfied, making it very general and flexible. Inference rules for an instantiation to a specific local logic (Horn clause logic) are given as a concrete example. the key novel features are illustrated with snippets from an existing application-a theory for self-organizing robots performing a distributed surveillance task. Traditional properties of logical inference and computation are reformulated in this novel context, and related to features of system design and execution. Proofs are outlined for key properties corresponding to soundness, completeness, and termination. Finally, the framework is compared to other formal systems addressing concurrent/distributed computation. (C) 2013 Elsevier B.V. All rights reserved.

关键词： Distributed declarative logic Partially ordered knowledge Networked cyber-physical systems

来源：评论

学校读者我要写书评

暂无评论

Neutralization and preemption in extended logic programs 4th

引用

4th international conference on logic programming and Automated Reasoning, LPAR 1993

作者： Wagner, Gerd Gruppe Logik Wissenstheorie und Information Institut für Philosphie Freie Universität Berlin Habelschwerdter Allee 30 Berlin 331000 Germany

ISBN: (纸本)9783540569442

Extended logic programs allow for negative conclusions in rules. So, the question of how to deal with contradictions arises. the trivialization (or ‘explosion’) approach of classical logic, according to which everything follows from a contradiction, is certainly not adequate for the purpose of processing partially inconsistent information in a cognitively and computationally satisfactory way. We propose to consider logical principles instead, which stem from the area of directly skeptical inheritance, or defeasible reasoning, known from the AI literature on nonmonotonic reasoning.1 In these systems conflicting pieces of information neutralize each other unless one of them ‘preempts’ (i.e. defeats) the other. the preemption mechanism is usually based on some notion of specificity. Extending earlier work [19], where we have introduced the concept of neutralization to the framework of extended logic programs, we show in this paper how to add a general mechanism for specificity-based preemption and demonstrate its feasibility by presenting an appropriate meta-interpreter. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

10th international Colloquium on Automata, Languages and programming, ICALP 1983

10th International Colloquium on Automata, Languages and Pro...

引用

10th international Colloquium on Automata, Languages and programming, ICALP 1983

ISBN: (纸本)9783540123170

the proceedings contain 60 papers. the special focus in this conference is on Automata, Languages and programming. the topics include: Symmetric and economical solutions to the mutual exclusion problem in a distributed system: Extended abstract;ambiguity and decision problems concerning number systems;on the observational semantics of fair parallelism;an O(N4) algorithm to construct all Voronoi diagrams for k nearest neighbor searching;algebraic languages and polyomnoes enumeration;on the number of equal-sized semispaces of a set of points in the plane: Extended abstract;algebraic specifications with generating constraints;wythoff games, continued fractions, cedar trees and Fibonacci searches;initial index: A new complexity function for languages;an axiomatization of the intermittent assertion method using temporal logic;modular compiler descriptions based on abstract semantic data types;polynomial-time factorization of multivariate polynomials over finite fields;processes of place/transition-nets;a hardware semantics based on temporal intervals;Lower bounds for solving undirected graph problems on VLSI;concurrent probabilistic program, or: How to schedule if you must;Computation times of NP sets of different densities;rewrite methods for clausal and non-clausal theorem proving;complexity of infinite trees;incremental construction of unification algorithms in equational theories;topological characterizations of infinite behaviours of transition systems;tree automata and attribute grammars;effectively given spaces;a note on intersections of free submonoids of a free monoid;A fast sorting algorithm for VLSI;on the composition of morphisms and inverse morphisms;on the group complexity of a finite language;reasoning with time and chance: Extended abstract;factoring multivariate integral polynomials.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Impartiality and Anticipation for Monitoring of Visibly Context-Free Properties

引用

4th international conference on Runtime Verification (RV)

作者： Decker, Normann Leucker, Martin thoma, Daniel Med Univ Lubeck Inst Software Engn & Programming Languages Lubeck Germany

ISBN: (纸本)9783642407871;9783642407864

We study monitoring of visibly context-free properties. these properties reflect the common concept of nesting which arises naturally in software systems. they can be expressed e. g. in the temporal logic CaRet which extends LTL by means of matching calls and returns. the future fragment of CaRet enables us to give a direct unfolding-based automaton construction, similar to LTL. We provide a four-valued, impartial semantics on finite words which is particularly suitable for monitoring. this allows us to synthesize monitors in terms of deterministic push-down Mealy machines. To go beyond impartiality, we develop a construction for anticipatory monitors from visibly push-down.-automata by utilizing a decision procedure for emptiness.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Integrating attribute grammar and functional programming language features

Integrating attribute grammar and functional programming lan...

引用

4th international conference of Software Language Engineering, SLE 2011

作者： Kaminski, Ted Van Wyk, Eric Department of Computer Science and Engineering University of Minnesota Minneapolis MN 55455 United States

ISBN: (纸本)9783642288296

While attribute grammars have several features making them advantageous for specifying language processing tools, functional programming languages offer a myriad of features also well-suited for such tasks. Much other work shows the close relationship between these two approaches, often in the form of embedding attribute grammars into lazy functional languages. this paper continues in this tradition, but in the other direction, by integrating various functional language features into attribute grammars. Specifically we integrate rich static types (including parametric polymorphism, typed distinctions between decorated and undecorated trees, limited type inference, and generalized algebraic data-types) and pattern-matching, all in a manner that maintains familiar and convenient attribute grammar notations and especially their highly extensible nature. © 2012 Springer-Verlag.

关键词： Pattern matching

来源：评论

学校读者我要写书评

暂无评论

Recall-driven product tracing and supply chain tracking using answer set programming

Recall-driven product tracing and supply chain tracking usin...

引用

4th international conference on Knowledge Engineering and Ontology Development, KEOD 2012

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

ISBN: (纸本)9789898565303

Incomplete information and the inability to trace the movement of contaminated products across the food chain has hindered our ability to locate and remove contaminated products once a food recall has been announced. the FDA Food Safety Modernization Act (FSMA) that was signed into law in 2011, however, supports traceability by both expanding the registration requirements for companies that are involved in food production and, in the event of a food recall, requiring 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 determine the set of all companies that may be linked to a contaminated product. Unlike other approaches, we do not depend on the availability of common standards or unique identifiers. Rather, the proposed approach utilizes information about the company's primary suppliers and customers along with their products-consistent with the "one step forward" and "one step backward" required under FMSA as noted above. We demonstrate this approach using the example of a food recall involving pork products.

关键词： Supply chains

来源：评论

学校读者我要写书评

暂无评论

Co-evolving parallel random number generators 4th

Co-evolving parallel random number generators

引用

international conference on Evolutionary Computation - 4th international conference on Parallel Problem Solving from Nature, PPSN 1996

作者： Sipper, Moshe Tomassini, Marco Logic Systems Laboratory Swiss Federal Institute of Technology IN-Ecublens LausanneCH-1015 Switzerland Swiss Scientific Computing Center Manno and Logic Systems Laboratory Swiss Federal Institute of Technology IN-Ecublens LausanneCH-1015 Switzerland

ISBN: (纸本)354061723X

Random numbers are needed in a variety of applications, yet finding good random number generators is a difficult task. In the last decade cellular automata (CA) have been used to generate random numbers. In this paper non-uniform CAs are studied, where each cell may contain a different rule, in contrast to the original, uniform model. We present the cellular programming algorithm for co-evolving non-uniform CAs to perform computations, and apply it to the evolution of random number generators. Our results suggest that good generators can be evolved;these exhibit behavior at least as good as that of previously described CAs, with notable advantages arising from the existence of a "tunable" algorithm for obtaining random number generators. © 1996, Springer-Verlag. All rights reserved.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共55页 << < 37 38 39 40 41 42 43 44 45 46 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：