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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

488 篇 会议
59 篇 期刊文献
21 册 图书

馆藏范围

567 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

391 篇 工学
- 344 篇 计算机科学与技术...
- 209 篇 软件工程
- 50 篇 电气工程
- 28 篇 信息与通信工程
- 22 篇 控制科学与工程
- 9 篇 电子科学与技术（可...
- 7 篇 机械工程
- 3 篇 材料科学与工程（可...
- 3 篇 生物工程
- 2 篇 力学（可授工学、理...
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 2 篇 核科学与技术
- 1 篇 仪器科学与技术
- 1 篇 冶金工程
102 篇 理学
- 87 篇 数学
- 10 篇 系统科学
- 5 篇 物理学
- 5 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
32 篇 管理学
- 20 篇 管理科学与工程(可...
- 12 篇 图书情报与档案管...
- 7 篇 工商管理
7 篇 教育学
- 7 篇 教育学
6 篇 法学
- 6 篇 社会学
6 篇 文学
- 5 篇 外国语言文学
- 1 篇 新闻传播学
3 篇 医学
- 2 篇 临床医学
1 篇 经济学
- 1 篇 应用经济学

主题

144 篇 logic programmin...
18 篇 artificial intel...
16 篇 logic gates
16 篇 linear programmi...
16 篇 computer program...
15 篇 probabilistic lo...
14 篇 programming
14 篇 mathematical log...
14 篇 programming lang...
12 篇 semantics
11 篇 formal logic
11 篇 computer program...
11 篇 logics and meani...
10 篇 fuzzy logic
10 篇 software enginee...
9 篇 computer circuit...
9 篇 logic
9 篇 programming tech...
8 篇 answer set progr...
8 篇 inductive logic ...

机构

4 篇 univ minho ctr a...
4 篇 univ texas dept ...
3 篇 universita di pi...
3 篇 the weizmann ins...
3 篇 new mexico state...
3 篇 univ malaga dept...
3 篇 univ calabria de...
2 篇 aalto univ dept ...
2 篇 ontario power ge...
2 篇 univ pisa dipart...
2 篇 department of th...
2 篇 texas tech univ ...
2 篇 univ freiburg in...
2 篇 school of comput...
2 篇 katholieke univ ...
2 篇 inst natl teleco...
2 篇 vienna univ tech...
2 篇 university of po...
2 篇 arizona state un...
2 篇 inria rennes

作者

5 篇 vicente henrique
4 篇 eiter t
4 篇 neves jose
4 篇 saint-dizier pat...
4 篇 faber w
3 篇 stéphan i
3 篇 deville yves
3 篇 pereira lm
3 篇 leone n
3 篇 wang bin
3 篇 levi giorgio
3 篇 neves joao
3 篇 zhang zhizheng
3 篇 son tc
2 篇 polleres a
2 篇 gueddes abdelweh...
2 篇 gongjie liu
2 篇 pontelli e
2 篇 dung phan minh
2 篇 lee kin hong

语言

518 篇 英文
45 篇 其他
4 篇 中文
1 篇 法文

检索条件"任意字段=8th Conference on Logic Programming, 1989"

共 568 条记录，以下是391-400 订阅

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

详细简洁

排序：

Modelling dynamic aspects of intentions 8th

引用

8th Portuguese conference on Artificial Intelligence, EPIA 1997

作者： Móra, Michael da Costa Lopes, Gabriel Pereira Coelho, Helder Viccari, Rosa M.rosa@inf.ufrgs.br CENTRIA/DI – Universidade Nova de Lisboa Quinta da Torre Monte da Caparica2825 Portugal CPGCC – II – Universidade Federal do Rio Grande do Sul Bloco IV – Campus do Vale – Av. Bento Gonrçalves 9500 Porto AlegreRS Brazil DI – FCUL – Universidade de Lisboa Bloco C5 Piso 1 – Campo Grande Lisboa1700 Portugal CPGCC/UFRGS Brazil

ISBN: (纸本)3540635866

In this paper, we define a formal model of intentions that accounts for both static and dynamic aspects of intentions. By static aspects, we mean its relation with desires and beliefs and the properties that this relation has (namely, consistency and avoidance of side-effects). By dynamic aspects, we mean establishing criteria, other than those derived from commitment, to drop intentions (namely, based on the cause-effect relation between desires and intentions) and mechanisms that triggers the reasoning process without imposing a significant additional burden on the agent. Our approach is to define those conditions that make the agent start reasoning about intentions as constraints over its beliefs. © Springer-Verlag Berlin Heidelberg 1997.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A formal requirements engineering method for specification, synthesis, and verification

A formal requirements engineering method for specification, ...

引用

Software Engineering Environments conference

作者： M. von der Beeck T. Margaria B. Steffen Lehrstuhl für Programmiersysteme Universität Passau Germany

this paper presents a formal requirements engineering method capturing specification, synthesis, and verification. Being multi-paradigm, our approach integrates individual established formal methods: temporal logics are used to express abstract specifications in the form of loose global constraints, like ordering requirements, or abstract safety and liveness properties, whereas Statecharts are used to support the development of a detailed, hierarchical specification at the concrete level. the link between, these two specification layers is established by means of 1) a semi-automatic synthesis procedure, where sequential portions of Statecharts, automatically synthesized from abstract specifications, can be manually composed into structured Statecharts, and 2) by automatic formal verification via model checking, which validates the global constraints for the resulting overall Statechart specification. the method is illustrated along a detailed user session.

关键词： Specification languages Software systems Safety Concrete Formal verification programming Algebra Carbon capture and storage logic functions Testing

来源：评论

学校读者我要写书评

暂无评论

Deliberative and reactive diagnosis agent based on logic programming

Deliberative and reactive diagnosis agent based on logic pro...

引用

Proceedings of the 1996 IEEE 8th International conference on Tools with Artificial Intelligence

作者： Schroeder, Michael de Almeida Mora, Iara Pereira, Lu's Moniz Universitaet Hannover Hannover Germany

We briefly overview the architecture of a diagnosis agent. We employ logic and logic programming to specify and implement the agent: the knowledge base uses extended logic programming to specify the agent's behaviour and its knowledge about the system to be diagnosed. the inference machine, which provides algorithms to compute diagnoses, as well as the reactive layer, that realizes a meta interpreter for the agent behaviour, are implemented in PVM-Prolog, that enhances standard Prolog by message passing facilities.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Splitting a default theory

Splitting a default theory

引用

13th National conference on Artificial Intelligence (AAAI 96) / 8th conference on Innovative Applications of Artificial Intelligence (IAAI 96)

作者： Turner, H Univ Texas Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)026251091X

this paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by "splitting it into parts." these so-called Splitting theorems for default logic are related in spirit to "partial evaluation" in logic programming, in which results obtained from one part of a program are used to simplify the remainder of the program. In this paper we focus primarily on the statement and proof of the Splitting theorems for default logic. We illustrate the usefulness of the results by applying them to an example default theory for commonsense reasoning about action.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

Pushing the envelope: Planning, propositional logic, and stochastic search

Pushing the envelope: Planning, propositional logic, and sto...

引用

13th National conference on Artificial Intelligence (AAAI 96) / 8th conference on Innovative Applications of Artificial Intelligence (IAAI 96)

作者： Kautz, H Selman, B AT&T Bell Labs Murray Hill NJ 07974 USA

ISBN: (纸本)026251091X

Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning problems many times faster than the best current planning systems. Although stochastic methods have been shown to be wry effective on a wide range of scheduling problems, this is the first demonstration of its power on truly challenging classical planning instances. this work also provides a new perspective on representational issues in planning.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Array-based testing of FPGAs: Architecture and complexity

Array-based testing of FPGAs: Architecture and complexity

引用

8th Annual IEEE International conference on Innovative Systems in Silicon

作者： Huang, WK Meyer, FJ Lombardi, F Fudan Univ Shanghai China

ISBN: (纸本)0780336399

this paper analyzes the architectural and complexity features of the array-based testing technique for held programmable gate arrays (FPGAs). the analysis is pursued using a hybrid (functional/stuck-at) single fault model by considering both the architecture of the configurable logic block (CLB) as well as the whole FPGA. Its evaluation using three commercially available FPGA families by Xilinx is presented in detail;emphasis is given to the different array configurations which permit the observability/controllability requirements of the testing process to satisfy the input/output restrictions (given by the I/O pins) of the FPGA, while still reducing the number of required programming phases.

关键词： logic gates

来源：评论

学校读者我要写书评

暂无评论

8th International Symposium on programming Languages: Implementations, logics, and Programs, PLILP 1996

8th International Symposium on Programming Languages: Implem...

引用

8th International Symposium on programming Languages, Implementations, logics, and Programs, PLILP 1996

ISBN: (纸本)3540617566

the proceedings contain 36 papers. the special focus in this conference is on Typing and Structuring Systems. the topics include: Calculate polytypically;limits of ML-definability;functorial ML;parametric polymorphism for typed prolog and a-prolog;a specification formalism for inheritance and object hierarchies;towards independent and-parallelism in CLP;annotated structure shape graphs for abstract analysis of prolog;a reactive implementation of pos using ROBDDs;dynamic attribute grammars;controlling conjunctive partial deduction;unfold/fold transformations of concurrent processes;semantics-based compiling;implementing memoization for partial evaluation;higher order deforestation;scheduling expression DAGs for minimal register need;improving tabled logic programs through alternative scheduling strategies;a new implementation approach for prolog;systematic extraction and implementation of divide-and-conquer parallelism;functional skeletons generate process topologies in eden;a language for executable specifications;from term rewriting to generalised interaction nets;type isomorphisms for module signatures;decidability of logic program semantics and applications to testing;unifying pictures and widgets in a constraint-based framework for concurrent functional GUI;modeling sharing and recursion for weak reduction strategies using explicit substitution;context-sensitive computations in confluent programs;models for using stochastic constraint solvers in constraint logic programming;integrating efficient records into concurrent constraint programming;the LOL deductive database programming language;an efficient and precise sharing domain for logic programs;cheap tupling in calculational form;needed narrowing in prolog;automatic optimization of dynamic scheduling in logic programs and a visual constraint programming tool.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Rewarding behaviors

Rewarding behaviors

引用

13th National conference on Artificial Intelligence (AAAI 96) / 8th conference on Innovative Applications of Artificial Intelligence (IAAI 96)

作者： Bacchus, F Boutilier, C Grove, A Univ Waterloo Dept Comp Sci Waterloo ON N2L 3G1 Canada

ISBN: (纸本)026251091X

Markov decision processes (MDPs) are a very popular tool for decision theoretic planning (DTP), partly because of the weI1developed, expressive theory that includes effective solution techniques. But the Markov assumption-that dynamics and rewards depend on the current state only, and not on history-is often inappropriate. this is especially hue of rewards: we frequently wish to associate rewards with behaviors that extend over time. Of course, such reward processes can be encoded in an MDP should we have a rich enough state space (where slates encode enough history). However it is often difficult to "hand craft" suitable state spaces that encode an appropriate amount of history. We consider this problem in the case where non-Markovian rewards are encoded by assigning values to formulas of a temporal logic. these formulas characterize the value of temporally extended behaviors. We argue that this allows a natural representation of many commonly encountered non-Markovian rewards. the main result is an algorithm which, given a decision process with non-Markovian rewards expressed in this manner, automatically constructs an equivalent MDP (with Markovian reward structure), allowing optimal policy construction using standard techniques.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

8th International conference on Advanced Information Systems Engineering, CAiSE 1996

引用

8th International conference on Advanced Information Systems Engineering, CAiSE 1996

ISBN: (纸本)3540612920

the proceedings contain 30 papers. the special focus in this conference is on CASE Environments, Temporal, Active Database Technologies, Experience Reports and Interoperability in Information Systems. the topics include: A fully configurable multi-user and multi-tool case and came environment;a computer aided requirements engineering environment;a logic-based framework for reasoning support in software evolution;a temporal active language and execution model;tool-based re-engineering of a legacy MIS;developing an information system using troll;active relationships for controlling the propagation of information and activities in databases;multi-data models translations in interoperable information systems;interoperable transactions in business models;on information modeling to support interoperable spatial databases;guidelines for formalizing fusion object-oriented analysis models;handling conceptual model validation by planning;the world-wide web as a platform for supporting interactive concurrent engineering;context-driven information base update;managing overlapping transactional workflows;shared data management mechanism for distributed software development based on a reflective object-oriented model;agent-based tool integration for distributed information systems;cognitive biases in information modeling;the role of benchmarking in information system development;user-enhanceability for organizational information systems through visual programming;advanced primitives for changing schemas of object databases;views for information system design without reorganization;semantics, features, and applications of the viewpoint abstraction and towards a content-based data model for information retrieval.

关键词：

来源：评论

学校读者我要写书评

暂无评论

11th Workshop on Abstract Data Types, 1995

11th Workshop on Abstract Data Types, 1995

引用

Joint 11th Workshop on Abstract Data Types was held jointly with the 8th Workshop on Recent Trends in Data Type Specification, COMPASS 1995

ISBN: (纸本)3540616292

the proceedings contain 31 papers. the special focus in this conference is on Abstract Data Types, 1995. the topics include: Seven years of COMPASS;inductively defined relations;on the role of category theory in the area of algebraic specifications;a challenge for computing science;the larch shared language: some open problems;the lambda calculus as an abstract data type;unifying theories in different institutions;interchange format for inter-operability of tools and translation;experiments with partial evaluation domains for rewrite specifications;class-sort polymorphism in glider;deontic concepts in the algebraic specification of dynamic systems;reification - changing viewpoint but preserving truth;a category-based equational logic semantics to constraint programming 200;concurrent state transformations on abstract data types;categories of circuits;combining algebraic and set-theoretic specifications;minimal term rewriting systems;an interactive theorem and completeness prover for algebraic specifications with conditional equations;the non-ground case completeness;termination of curryfied rewrite systems;correctness and oracle;behavioural equivalence, bisimulation, and minimal realisation;using limits of parchments to systematically construct institutions of partial algebras;behavioural specifications in type theory;syntax, semantics, and theory;context institutions;object-oriented functional programming and type reconstruction;moving between logical systems;modular algebraic specifications and the orientation of equations into rewrite rules;a model for I/O in equational languages with don't care non-determinism and tool design for structuring mechanisms for algebraic specification languages with initial semantics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 36 37 38 39 40 41 42 43 44 45 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：