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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

708 篇 会议
39 篇 期刊文献
24 册 图书

馆藏范围

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

日期分布

学科分类号

696 篇 工学
- 693 篇 计算机科学与技术...
- 366 篇 软件工程
- 21 篇 电气工程
- 20 篇 信息与通信工程
- 19 篇 控制科学与工程
- 4 篇 生物工程
- 3 篇 交通运输工程
- 3 篇 生物医学工程（可授...
- 2 篇 材料科学与工程（可...
- 2 篇 电子科学与技术（可...
- 2 篇 化学工程与技术
- 2 篇 石油与天然气工程
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
- 2 篇 网络空间安全
148 篇 理学
- 135 篇 数学
- 7 篇 生物学
- 7 篇 统计学（可授理学、...
- 6 篇 物理学
- 4 篇 系统科学
34 篇 管理学
- 25 篇 图书情报与档案管...
- 12 篇 管理科学与工程(可...
- 4 篇 工商管理
5 篇 法学
- 5 篇 社会学
4 篇 医学
- 4 篇 临床医学
- 2 篇 基础医学(可授医学...
- 2 篇 药学(可授医学、理...
2 篇 教育学
- 2 篇 教育学
2 篇 农学
- 2 篇 作物学
2 篇 军事学
1 篇 文学

主题

270 篇 logic programmin...
51 篇 answer set progr...
49 篇 semantics
28 篇 knowledge repres...
25 篇 computer circuit...
24 篇 artificial intel...
19 篇 nonmonotonic rea...
15 篇 formal logic
12 篇 mathematical log...
11 篇 knowledge repres...
10 篇 logics and meani...
9 篇 atoms
9 篇 ontology
8 篇 answer-set progr...
8 篇 stream reasoning
8 篇 semantic web
8 篇 programming tech...
8 篇 constraint progr...
7 篇 model checking
7 篇 software enginee...

机构

19 篇 vienna univ tech...
15 篇 univ potsdam pot...
10 篇 univ kentucky de...
10 篇 vienna univ tech...
8 篇 inria rennes ren...
7 篇 new mexico state...
7 篇 univ a coruna la...
7 篇 univ potsdam ins...
7 篇 univ texas dept ...
6 篇 tech univ wien i...
6 篇 tu wien austria
6 篇 univ minho ctr a...
6 篇 university of po...
6 篇 institut für inf...
6 篇 univ calabria ar...
5 篇 univ manchester ...
5 篇 univ genoa dibri...
5 篇 institut für inf...
5 篇 univ calabria de...
5 篇 univ alberta dep...

作者

41 篇 eiter thomas
40 篇 schaub torsten
26 篇 gebser martin
26 篇 tompits hans
23 篇 ricca francesco
20 篇 woltran stefan
17 篇 leone nicola
16 篇 ianni giovambatt...
16 篇 fink michael
16 篇 cabalar pedro
15 篇 faber wolfgang
15 篇 alviano mario
12 篇 calimeri frances...
11 篇 oetsch johannes
10 篇 kaminski roland
10 篇 redl christoph
10 篇 janhunen tomi
9 篇 krennwallner tho...
9 篇 leite joao
8 篇 eiter t

语言

761 篇 英文
6 篇 中文
4 篇 其他

检索条件"任意字段=9th International Conference on Logic Programming and Nonmonotonic Reasoning"

共 771 条记录，以下是731-740 订阅

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

详细简洁

排序：

Smodels - an implementation of the stable model and well-founded semantics for normal logic programs 4th

Smodels - an implementation of the stable model and well-fou...

引用

4th international conference on logic programming and nonmonotonic reasoning (LPNMR 97)

作者： Niemela, I Simons, P Aalto Univ Dept Comp Sci & Engn Digital Syst Lab FIN-02015 Espoo Finland

ISBN: (纸本)3540632557

the Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free normal programs. the system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range-restricted function-free normal program. the latter module does not produce the whole set of ground instances of the program but a subset that is sufficient in the sense that no stable models ate lost. the implementation of the stable model semantics for ground programs is based on bottom-up backtracking search where a powerful pruning method is employed. the pruning method exploits an approximation technique for stable models which is closely related to the well-founded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. this makes it possible to apply the stable model semantics also in areas where resulting programs are highly non-stratified and can possess a large number of stable models. the implementation has been tested extensively and compared with a state of the art implementation of the stable model semantics, the SLG system. In tests involving ground programs it clearly outperforms SLG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects 4th

Generalized query answering in disjunctive deductive databas...

引用

4th international conference on logic programming and Non-Monotonic reasoning, LPNMR 1997

作者： Yahya, Adnan H. Electrical Engineering Department Birzeit University Birzeit Palestine

ISBN: (纸本)9783540632559

Generalized queries are defined as sets of clauses in implication form. they cover several tasks of practical importance for database maintenance such as answering positive queries, computing database completions and integrity constraints checking. We address the issue of answering generalized queries under the minimal model semantics for the class of Disjunctive Deductive Databases (DDDBs). Our approach is based on having the query induce an order on the models returned by a sound and complete minimal model generating procedure. We consider answers that are true in all and those that are true in some minimal models of the theory and investigate the monotonicity properties of the different classes of queries and answers. © 1997, Springer Verlag. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Generating efficient, terminating logic programs 7th

引用

7th international Joint conference on theory and Practice of Software Development, TAPSOFT 1997

作者： Martin, Jonathan C. King, Andy Department of Electronics and Computer Science University of Southampton SouthamptonSO9 5NH United Kingdom Computing Laboratory University of Kent at Canterbury CanterburyCT2 7NF United Kingdom

ISBN: (纸本)9783540627814

the objective of control generation in logic programming is to automatically derive a computation rule for a program that is efficient and yet does not compromise program correctness. Progress in solving this important problem has been slow and, to date, only partial solutions have been proposed where the generated programs are either incorrect or inefficient. We show how the control generation problem can be tackled with a simple automatic transformation that relies on information about the depths of SLD-trees. To prove correctness of our transform we introduce the notion of a semi delay recurrent program which generalises previous ideas in the termination literature for reasoning about logic programs with dynamic selection rules. © Springer-Verlag Berlin Heidelberg 1997.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Deduction by combining semantic tableaux and integer programming 9th

引用

9th international Workshop on Computer Science logic (CSL 95) / Annual conference of the EACSL

作者： Beckert, B Hahnle, R University of Karlsruhe Institute for Logic Complexity and Deduction Systems Am Fasanengarten 5 Karlsruhe 76128 Germany

ISBN: (纸本)3540613773

In this paper we propose to extend the current capabilities of automated reasoning systems by making use of techniques from integer programming. We describe the architecture of an automated reasoning system based on a Herbrand procedure (enumeration of formula instances) on clauses. the input are arbitrary sentences of first-order logic. the translation into clauses is done incrementally and is controlled by a semantic tableau procedure using unification. this amounts to an incremental polynomial CNF transformation which st the same time encodes part of the tableau structure and, therefore, tableau-specific refinements that reduce the search space. Checking propositional unsatisfiability of the resulting sequence of clauses can either be done with a symbolic inference system such as the Davis-Putnam procedure or it can be done using integer programming. If the latter is used a number of advantages become apparent.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

5th international Workshop on Extensions of logic programming, ELP 1996

引用

5th international Workshop on Extensions of logic programming, ELP 1996

ISBN: (纸本)9783540609834

the proceedings contain 21 papers. the special focus in this conference is on Extensions of logic programming. the topics include: Semantics of constraint logic programs with bounded quantifiers;translating a modal language with embedded implication into horn clause logic;pruning the search space of logic programs;a significant extension of logic programming by adapting model building rules;efficient resource management for linear logic proof search;a logic language based on GAMMA-like multiset rewriting;handling equality in logic programming via basic folding;an abstract machine for reasoning about situations, actions, and causality;on the computational complexity of propositional logic programs with nested implications;proof-theory for extensions of logic programming;a fibrational semantics for logic programs;language and implementation;a new framework for declarative programming;extending constructive negation for partial functions in lazy functional-logic languages;total correctness of logic programs;a declarative semantics for the prolog cut operator;a definitional approach to functional logic programming;soundness and completeness of non-classical extended SLD-resolution and some postulates for nonmonotonic theory revision applied to logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

9th international conference on theorem Proving in Higher Order logics, TPHOLs 1996

9th International Conference on Theorem Proving in Higher Or...

引用

9th international conference on theorem Proving in Higher Order logics, TPHOLs 1996

ISBN: (纸本)9783540615873

the proceedings contain 28 papers. the special focus in this conference is on theorem Proving in Higher Order logics. the topics include: Translating specifications in VDM-SL to PVS;a comparison of HOL and ALF formalizations of a categorical coherence theorem;modeling a hardware synthesis methodology in isabelle;inference rules for programming languages with side effects in expressions;deciding cryptographic protocol adequacy with HOL;proving liveness of fair transition systems;program derivation using the refinement calculator;a proof tool for reasoning about functional programs;coq and hardware verification;elements of mathematical analysis in PVS;implementation issues about the embedding of existing high level synthesis algorithms in HOL;five axioms of alpha-conversion;set theory, higher order logic or both;a mizar mode for HOL;towards applying the composition principle to verify a microkernel operating system;a modular coding of unity in coq;importing mathematics from HOL into nuprl;a structure preserving encoding of Z in Isabelle/HOL;improving the result of high-level synthesis using interactive transformational design;using lattice theory in higher order logic;verification of compiler correctness for the WAM;another logic of computable functions;function definition in higher order logic;higher order annotated terms for proof search;a comparison of MDG and HOL for hardware verification and a mechanisation of computability theory in HOL.

关键词：

来源：评论

学校读者我要写书评

暂无评论

BQM: A system integrating logic, objects, and non-monotonic reasoning

BQM: A system integrating logic, objects, and non-monotonic ...

引用

7th international conference on Tools with Artificial Intelligence (TAI 95)

作者： Leone, N Rullo, P UNICAL DEISCNRISII-87030 RENDEITALY

the BQM1 system extends deductive database technology with knowledge structuring capabilities to provide an advanced environment for the development of data and knowledge-based applications. the system relies on a kno... 详细信息

ISBN: (纸本)0818673125

the BQM¹ system extends deductive database technology with knowledge structuring capabilities to provide an advanced environment for the development of data and knowledge-based applications. the system relies on a knowledge representation language that combines the declarativeness of logic programming with the notions of object, inheritance with exceptions, and message passing. Exceptions are supported by allowing rules with negated heads. the use of exceptions inside the inheritance mechanism makes the language inherently nonmonotonic. the paper describes BQM focusing on both the language and the implementation techniques. An informal overview of the language is first given. then, a number of techniques for efficient query evaluation are presented. these techniques significantly extend 'traditional' deductive database query evaluation strategies to deal with nonmonotonic reasoning. A description of the architecture of the current prototype of the BQM system is also given.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

On logical constraints in logic programming 3rd

On logical constraints in logic programming

引用

3rd international conference on logic programming and nonmonotonic reasoning, LPNMR 1995

作者： Wiktor Marek, V. Nerode, Anil Remmel, Jeffrey B. Department of Computer Science University of Kentucky LexingtonKY40506 United States Mathematical Sciences Institute Cornell University IthacaNY14853 United States Department of Mathematics University of California La JollaCA92093 United States

ISBN: (纸本)9783540594871

We introduce a new form of logic programming with constraints. the constraints that we consider are not restricted to statements on real numbers as in CLP(R), see Jaffar and Lassez [10]. Instead our constraints are arbitrary global constraints. the basic idea is that the applicability of a given rule is not predicated on the fact that individual variables satisfy certain constraints, but rather on the fact that the least model of the set rules that are ultimately applicable satisfy the constraint of the rule. thus the role of clauses is slightly different than in the usual logic programming with constraints. In fact, the paradigm we present is closely related to stable model semantics of general logic programming, Gelfond and Lifschitz [9]. We define the notion of a constraint model of a constraint logic program and show that stable models of logic programs as well as the supported models of logic programs are just special cases of constraint models of constraint logic programs. In the general definition of a constraint logic program, the constraint of a clause is not restricted to be of a certain form or even to be expressible in the underlying language of the logic program. this feature is useful for certain applications in hybrid control systems and database applications that we have in mind. In this paper, however, we focus on the properties of constraint programs and constraint models in the simplest case where the constraints arc expressible in the language of underlying program. © Springer-Verlag Berlin Heidelberg 1995.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

BQM: a system integrating logic, objects, and non-monotonic reasoning

BQM: a system integrating logic, objects, and non-monotonic ...

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： N. Leone P. Rullo ISI CNR-c/o DEIS-UNICAL Rende Italy DIMET Universita di Reggio Calabria Reggio Calabria Italy

the BQM system extends deductive database technology with knowledge structuring capabilities to provide an advanced environment for the development of data and knowledge-based applications. the system relies on a knowledge representation language that combines the declarativeness of logic programming with the notions of object, inheritance with exceptions and message passing. Exceptions are supported by allowing rules with negated heads. the use of exceptions inside the inheritance mechanism makes the language inherently nonmonotonic. the paper describes BQM focusing on both the language and the implementation techniques. An informal overview of the language is first given. then, a number of techniques for efficient query evaluation are presented. these techniques significantly extend "traditional" deductive database query evaluation strategies to deal with nonmonotonic reasoning. A description of the architecture of the current prototype of the BQM system is also given.

关键词： Deductive databases logic programming Query processing Knowledge representation Message passing Magnetic heads Prototypes Object oriented databases Data models Database systems

来源：评论

学校读者我要写书评

暂无评论

2nd Fuzzy logic in Artificial Intelligence Workshop held in conjunction with international Joint conference of Artificial Intelligence, IJCAI 1993

2nd Fuzzy Logic in Artificial Intelligence Workshop held in ...

引用

2nd Fuzzy logic in Artificial Intelligence Workshop held in conjunction with international Joint conference of Artificial Intelligence, IJCAI 1993

the proceedings contain 9 papers. the special focus in this conference is on Fuzzy logic in Artificial Intelligence. the topics include: Fuzzy reinforcement Learning and dynamic programming;Fuzzy sets, fuzzy clustering and fuzzy rules in AI;Robust execution of robot plans using fuzzy logic;Fuzzy logic, inductive and analogical reasoning;Possibility theory, belief revision and nonmonotonic logic;Querying a database with fuzzy attribute values by iterative updating of the selection criteria;Learning fuzzy membership functions in a function-based object recognition system;A factor space approach to concept representation;Connectionist fuzzy production systems.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共78页 << < 69 70 71 72 73 74 75 76 77 78 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：