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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,428 篇 会议
70 册 图书
56 篇 期刊文献

馆藏范围

1,553 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,261 篇 工学
- 1,246 篇 计算机科学与技术...
- 663 篇 软件工程
- 83 篇 控制科学与工程
- 62 篇 电气工程
- 48 篇 信息与通信工程
- 10 篇 生物工程
- 9 篇 生物医学工程（可授...
- 6 篇 交通运输工程
- 5 篇 化学工程与技术
- 4 篇 材料科学与工程（可...
- 4 篇 电子科学与技术（可...
- 4 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 建筑学
360 篇 理学
- 337 篇 数学
- 23 篇 统计学（可授理学、...
- 17 篇 系统科学
- 14 篇 生物学
- 10 篇 物理学
- 5 篇 化学
86 篇 管理学
- 53 篇 图书情报与档案管...
- 37 篇 管理科学与工程(可...
- 17 篇 工商管理
10 篇 法学
- 7 篇 法学
- 3 篇 社会学
9 篇 医学
- 9 篇 临床医学
- 7 篇 基础医学(可授医学...
- 6 篇 药学(可授医学、理...
7 篇 教育学
- 7 篇 教育学
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学

主题

388 篇 logic programmin...
142 篇 artificial intel...
63 篇 semantics
52 篇 answer set progr...
49 篇 mathematical log...
43 篇 computer circuit...
42 篇 formal logic
40 篇 knowledge repres...
35 篇 logics and meani...
29 篇 programming tech...
25 篇 knowledge repres...
25 篇 calculations
22 篇 programming lang...
18 篇 software enginee...
16 篇 fuzzy logic
16 篇 inductive logic ...
13 篇 constraint progr...
12 篇 programming
12 篇 data description
12 篇 temporal logic

机构

15 篇 vienna univ tech...
13 篇 univ minho ctr a...
11 篇 univ potsdam pot...
11 篇 tu wien austria
8 篇 univ evora escol...
8 篇 univ texas dept ...
6 篇 new mexico state...
6 篇 inria rennes ren...
6 篇 university of po...
6 篇 imperial coll lo...
6 篇 univ kentucky de...
6 篇 univ minho dept ...
5 篇 univ potsdam ins...
5 篇 katholieke univ ...
5 篇 univ genoa dibri...
5 篇 natl inst inform...
5 篇 natl univ irelan...
5 篇 suny stony brook...
5 篇 mediclin arabian...
5 篇 carnegie mellon ...

作者

31 篇 schaub torsten
30 篇 ricca francesco
24 篇 eiter thomas
20 篇 vicente henrique
19 篇 gebser martin
18 篇 neves jose
17 篇 alviano mario
17 篇 tompits hans
16 篇 leone nicola
16 篇 woltran stefan
13 篇 faber wolfgang
13 篇 cabalar pedro
13 篇 dodaro carmine
12 篇 son tran cao
12 篇 baral chitta
11 篇 voronkov andrei
11 篇 maratea marco
11 篇 inoue katsumi
10 篇 fink michael
10 篇 neves joao

语言

1,540 篇 英文
8 篇 中文
6 篇 其他

检索条件"任意字段=15th International Conference on Logic for Programming Artificial Intelligence and Reasoning"

共 1554 条记录，以下是1201-1210 订阅

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

详细简洁

排序：

Model-based programming: Controlling embedded systems by reasoning about hidden state 8th

引用

8th international conference on Principles and Practice of Constraint programming, CP 2002

作者： Williams, Brian C. Ingham, Michel D. Space Systems and Artificial Intelligence Laboratories Massachusetts Institute of Technology 77 Massachusetts Ave CambridgeMA02139 United States

ISBN: (纸本)3540441204

programming complex embedded systems involves reasoning through intricate system interactions along paths between sensors, actuators and control processors. this is a time-consuming and error-prone process. Furthermore, the resulting code generally lacks modularity and robustness. Model-based programming addresses these limitations, allowing engineers to program by specifying high-level control strategies and by assembling common-sense models of the system hardware and software. To execute a control strategy, model-based executives reason about the models "on the fly", to track system state, diagnose faults and perform reconfigurations. this paper describes the Reactive Model-based programming Language (RMPL) and its executive, called Titan. RMPL provides the features of synchronous reactive languages with in a constraint-based modeling framework, with the added ability of being able to read and write to state variables that are hidden with in the physical plant. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

18th international conference on logic programming, ICLP 2002

引用

18th international conference on logic programming, ICLP 2002

ISBN: (纸本)3540439307

the proceedings contain 44 papers. the special focus in this conference is on logic programming. the topics include: Representing arithmetic constraints with finite automata;logic databases on the semantic web;an abductive approach for analysing event-based requirements specifications;trailing analysis for HAL;access control for deductive databases by logic programming;reasoning about actions with CHRs and finite domain constraints;using hybrid concurrent constraint programming to model dynamic biological systems;efficient real-time model checking using tabled logic programming and constraints;constraint-based infinite model checking and tabulation for stratified CLP;a model theoretic semantics for multi-level secure deductive databases;propagation completeness of reactive constraints;on enabling the WAM with region support;a different look at garbage collection for the WAM;logical algorithms;learning in logic with richprolog;towards a declarative query and transformation language for XML and semistructured data;a proof-theoretic foundation for tabled higher-order logic programming;proving the equivalence of CLP programs;a purely logical account of sequentiality in proof search;disjunctive explanations;computing stable models;towards local search for answer sets;a rewriting method for well-founded semantics with explicit negation;embedding defeasible logic into logic programs;a polynomial translation of logic programs with nested expressions into disjunctive logic programs;using logic programming to detect activities in pervasive healthcare;logic programming for software engineering;a logic-based system for application integration;the limits of horn logic programs and multi-adjoint logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

8th international conference on Principles and Practice of Constraint programming, CP 2002

引用

8th international conference on Principles and Practice of Constraint programming, CP 2002

ISBN: (纸本)3540441204

the proceedings contain 83 papers. the special focus in this conference is on Innovative Applications and Posters. the topics include: Reduced cost-based ranking for generating promising subproblems;integrating constraint and integer programming for the orthogonal latin squares problem;on optimal correction of inconsistent linear constraints;temporal planning through mixed integer programming;a new multi-resource cumulatives constraint with negative heights;global constraints for lexicographic orderings;a global filtering algorithm for handling systems of quadratic equations and inequations;amplification of search performance through randomization of heuristics;computing the envelope for stepwise-constant resource allocations;local probing applied to scheduling;recovering and exploiting structural knowledge from CNF formulas;towards a symmetric treatment of satisfaction and conflicts in quantified boolean formula evaluation;accelerating random walks;scaling and probabilistic smoothing;learning and solving soft temporal constraints;opportunistic specialization in russian doll search;range-based algorithm for max-CSP;resolution complexity of random constraints;constraint satisfaction, bounded treewidth, and finite-variable logics;determining the number of solutions to binary CSP instances;consistency checking for qualitative spatial reasoning with cardinal directions;open constraint satisfaction;arc-consistency for quantified constraints;secure distributed constraint satisfaction;partial symmetry breaking;symmetry breaking revisited;breaking row and column symmetries in matrix models;inferring constraint types in constraint programming;controlling embedded systems by reasoning about hidden state;the adaptive constraint engine;indexical-based solver learning;restart policies with dependence among runs and on the edge of planning and scheduling.

关键词：

来源：评论

学校读者我要写书评

暂无评论

8th international Workshop on Database programming Languages, DBPL 2001

引用

8th international Workshop on Database programming Languages, DBPL 2001

ISBN: (纸本)9783540440802

the proceedings contain 19 papers. the special focus in this conference is on Database programming Languages. the topics include: Typechecking for semistructured data;optimization properties for classes of conjunctive regular path queries;view-based query answering and query containment over semistructured data;model-checking based data retrieval;implementation and a case study;attribute metadata for relational OLAP and data mining;on monotone data mining languages;reasoning about keys for xml;a tree algebra for XML;a rule-based querying and updating language for XML;linear approximation of semi-algebraic spatial databases using transitive closure logic, in arbitrary dimension;a theory of spatio-temporal database queries;an application-specific database;model theory for generic schema management;view serializable updates of concurrent index structures;a flexible query language for xml and relational databases;querying an entity-relationship db to obtain xml documents;optimising active database rules by partial evaluation and abstract interpretation and simulation of advanced transaction models using GOLOG.

关键词：

来源：评论

学校读者我要写书评

暂无评论

international conference on Fuzzy Systems, AFSS 2002

引用

5th international conference on Asian Fuzzy Systems Society, AFSS 2002

ISBN: (纸本)9783540431503

the proceedings contain 73 papers. the special focus in this conference is on Fuzzy Systems, Soft Computing - theory and Applications. the topics include: A new perspective on reasoning with fuzzy rules;on interpretability of fuzzy models;degree of similarity in fuzzy partition;fuzzy set in default reasoning;interpolation in hierarchical rule-bases with normal conclusions;the dempster-shafer approach to map-building for an autonomous mobile robot with fuzzy controller;the fuzzy model for aircraft landing control;implementation of nonlinear fuzzy models using microcontrollers;a gain adaptive fuzzy logic controller;vehicle routing, scheduling and dispatching system based on HIMS model;similarity between fuzzy multi-objective control and eligibility;a fuzzy goal programming approach for solving bilevel programming problems;material handling equipment selection by fuzzy multi-criteria decision making methods;verbalizing computers - a way to everyday language computing;soft computing based emotion/intention reading for service robot;wavelet transform based fuzzy inference system for power quality classification;a fuzzy-neural technique for flashover diagnosis of winding insulation in transformers;feature identification for fuzzy logic based adaptive Kalman filtering;soft-computing technologies for biometric-applications;comparative study between different eigenspace-based approaches for face recognition;static signature verification employing a kosko-neuro-fuzzy approach;a study of electrophysiological experimentation and non-equilibrium information theory;characterization of non-linear cellular automata model for pattern recognition;recognition of handprinted bangla numerals using neural network models;a neural network based seafloor classification using acoustic backscatter and weather forecasting system based on satellite imageries using neuro-fuzzy techniques.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A logic for probabilities in semantics 16th

引用

16th international Workshop on Computer Science logic, CSL 2002 and 11th Annual conference of the European Association for Computer Science logic, EACSL 2002

作者： Moshier, M. Andrew Jung, Achim Department of Mathematics Computer Science and Physics Chapman University OrangeCA92867 United States School of Computer Science The University of Birmingham Edgbaston BirminghamB15 2TT United Kingdom

ISBN: (纸本)3540442405

Probabilistic computation has proven to be a challenging and interesting area of research, both from the theoretical perspective of denotational semantics and the practical perspective of reasoning about probabilistic algorithms. On the theoretical side, the probabilistic powerdomain of Jones and Plotkin represents a significant advance. Further work, especially by Alvarez-Manilla, has greatly improved our understanding of the probabilistic powerdomain, and has helped clarify its relation to classical measure and integration theory. On the practical side, such researchers as Kozen, Segala, Desharnais, and Kwiatkowska, among others, study problems of verification for probabilistic computation by defining various suitable logics for the classes of processes under study. the work reported here begins to bridge the gap between the domain theoretic and verification (model checking) perspectives on probabilistic computation by exhibiting sound and complete logics for probabilistic powerdomains that arise directly from given logics for the underlying domains. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

A new clausal class decidable by hyperresolution 18th

引用

18th international conference on Automated Deduction, CADE 2002

作者： Georgieva, Lilia Hustadt, Ullrich Schmidt, Renate A. Department of Computer Science University of Manchester United Kingdom Max-Planck-Institut für Informatik Saarbrücken Germany Department of Computer Science University of Liverpool United Kingdom

ISBN: (纸本)3540439315

In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that hyperresolution plus splitting can also be used as a Herbrand model generation procedure for BU and, furthermore, that the addition of a local minimality test allows us to generate only minimal Herbrand models for clause sets in BU. I n addition, we investigate the relationship of BU to other solvable classes. © Springer-Verlag Berlin Heidelberg 2002.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Well-foundedness is sufficient for completeness of ordered paramodulation 18th

引用

18th international conference on Automated Deduction, CADE 2002

作者： Bofill, Miquel Rubio, Albert Universitat de Girona Dept. IMA Lluí Girona17071 Spain Technical University of Catalonia Dept. LSI Jordi Girona 1 Barcelona08034 Spain

ISBN: (纸本)3540439315

For many years all known completeness results for Knuth- Bendix completion and ordered paramodulation required the term ordering γ to be well-founded, monotonic and total(izable) on ground terms. then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By using a new restricted form of rewriting we obtain a completeness proof of ordered paramodulation for Horn clauses with equality where wellfoundedness of the ordering suffices. Apart from the fundamental interest of this result, some potential applications motivating the interest of dropping the subterm property are given. © Springer-Verlag Berlin Heidelberg 2002.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Prolog: A simple general implementation using CLP(R) 18th

引用

18th international conference on logic programming, ICLP 2002

作者： Vaucheret, Claudio Guadarrama, Sergio Muñoz, Susana Dept. de Inteligencia Artificial Universidad Politécnica de Madrid Madrid28660 Spain Dept. de Lenguajes Sists. de la Información e Ing. del Software Universidad Politécnica de Madrid Madrid28660 Spain

ISBN: (纸本)3540439307

the result of introducing Fuzzy logic into logic programming has been the development of several "Fuzzy Prolog" systems. these systems replace the inference mechanism of Prolog with a fuzzy variant which is able to handle partial truth as a real value or as an interval on [0, 1]. Most of these systems consider only one operator to propagate the truth value through the fuzzy rules. We aim at defining a Fuzzy Prolog Language in a general way and to provide an implementation of a Fuzzy Prolog System for our general approach that is extraordinary simple thanks to the use of constraints. Our approach is general in two aspects: (i) Truth value will be a countable union of sub-intervals on [0, 1], representation also called Borel Algebra over this interval, B([0, 1]). Former representations of truth value are particular cases of this definition and many real fuzzy problems only can be modeled using this representation. (ii) the concept of aggregation generalizes the computable operators. It subsumes conjunctive operators (triangular norms as min, prod, etc), disjunctive operators (triangular co-norms as max, sum, etc), average operators (arithmetic average, cuasi-linear average, etc) and hybrid operators (combinations of previous operators). We define and use aggregation operator for our language instead of limiting ourselves to a particular one. therefore, we have implemented several aggregation operators and others can be added to the system with little effort. We have incorporated uncertainty into a Prolog system in a simple way. this extension to Prolog is realized by interpreting fuzzy reasoning (truth values and the result of aggregations) as a set of constraints then translating fuzzy rules into CLP(R) clauses. the implementation is based on a syntactic expansion of the source code at compilation-time. the novelty of the Fuzzy Prolog presented is that it is implemented over Prolog, using its resolution system, instead of implementing a new resolution system such as

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Testing satisfiability of CNF formulas by computing a stable set of points 18th

引用

18th international conference on Automated Deduction, CADE 2002

作者： Goldberg, Eugene Cadence Berkeley Labs 2001 Addison str. 3rd floor BerkeleyCA94704-1103 United States

ISBN: (纸本)3540439315

We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiability of a CNF formula reduces to looking for a stable set of points (SSP). We give some properties of SSPs and describe a simple algorithm for constructing an SSP for a CNF formula. Building an SSP can be viewed as a "natural" way of search space traversal. this naturalness of search space examination allows one to make use of the regularity of CNF formulas to be checked for satisfiability. We illustrate this point by showing that if a CNF F formula is symmetric with respect to a group of permutations, it is very easy to make use of this symmetry when constructing an SSP. As an example, we show that the unsatisfiability of pigeon-hole CNF formulas can be proven by examining only a set of points whose size is quadratic in the number of holes. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Formal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共156页 << < 117 118 119 120 121 122 123 124 125 126 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：