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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

59 篇 会议
3 篇 期刊文献

馆藏范围

62 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

50 篇 工学
- 48 篇 计算机科学与技术...
- 35 篇 软件工程
- 4 篇 电气工程
- 3 篇 信息与通信工程
- 1 篇 电子科学与技术（可...
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
20 篇 理学
- 17 篇 数学
- 2 篇 系统科学
- 1 篇 物理学
- 1 篇 化学

主题

19 篇 logic programmin...
5 篇 semantics
4 篇 computer circuit...
3 篇 well-founded sem...
3 篇 temporal logic
2 篇 linear logic
2 篇 fixpoint semanti...
2 篇 time granularity
2 篇 bottom-up evalua...
2 篇 static analysis
2 篇 computers
2 篇 automata theory
2 篇 non-monotonic re...
1 篇 intrusion detect...
1 篇 calml3 gene
1 篇 constraint logic...
1 篇 lattices
1 篇 formal logic
1 篇 prolog (programm...
1 篇 higher-order log...

机构

2 篇 univ koblenz dep...
2 篇 department of co...
2 篇 artificial intel...
2 篇 univ udine dept ...
2 篇 univ g dannunzio...
2 篇 institut für inf...
2 篇 univ genoa dipar...
2 篇 irst itc i-38050...
1 篇 facoltà di scien...
1 篇 univ ghent dept ...
1 篇 information engi...
1 篇 stanford univers...
1 篇 dept. computer s...
1 篇 liens ecole norm...
1 篇 28660-boadilla d...
1 篇 university of te...
1 篇 department of co...
1 篇 knowledge based ...
1 篇 cognitive engine...
1 篇 dipartimento di ...

作者

3 篇 you jia-huai
2 篇 stolzenburg f
2 篇 konczak kathrin
2 篇 martelli m
2 篇 schaub torsten
2 篇 montanari a
2 篇 franceschet m
2 篇 bozzano m
2 篇 gelfond michael
2 篇 brogi a
2 篇 delzanno g
2 篇 linke thomas
2 篇 dix j
2 篇 konolige kurt
1 篇 mileo alessandra
1 篇 risch v.
1 篇 shen yi-dong
1 篇 mancarella p
1 篇 wakayama toshiro
1 篇 alvaro peter

语言

61 篇 英文
1 篇 其他

检索条件"任意字段=2nd International Workshop on Non-Monotonic Extensions of Logic Programming"

共 62 条记录，以下是21-30 订阅

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

详细简洁

排序：

Model checking linear logic specifications

Model checking linear logic specifications

引用

2nd international workshop on Verification and Computational logic (VCL 2001)

作者： Bozzano, M DelZanno, G Martelli, M IRST ITC I-38050 Trento Italy Univ Genoa Dipartimento Informat & Sci Informaz I-16146 Genoa Italy

The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi, 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinite-state concurrent systems (Andreoli, 1992;Cervesato, 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al., 2002). Following this line of research, we define here a general framework for the bottom-up evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasi-orderings (Abdulla et al., 1996;Finkel and Schnoebelen, 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.

关键词： linear logic fixpoint semantics bottom-up evaluation

来源：评论

学校读者我要写书评

暂无评论

IMPLEMENTING LAMBDA-CALCULUS REDUCTION STRATEGIES IN EXTEndED logic programming-LANGUAGES 2nd

IMPLEMENTING LAMBDA-CALCULUS REDUCTION STRATEGIES IN EXTENDE...

引用

2nd international workshop ON extensions OF logic programming ( ELP 91 )

作者： HANNAN, J Department of Computer Science University of Copenhagen Universitetsparken 1 Copenhagen Ø DK-2100 Denmark

ISBN: (纸本)354055498X

We study the implementation of four reduction strategies for the untyped λ-calculus in the logic programming language λProlog and restricted sublanguages. The higher-order features of these languages provide very natural methods for manipulating and substituting bound variables. Starting from clear and concise specifications of reduction in the full language we demonstrate how to make certain details in the implementations explicit as we restrict ourselves to the weaker sublanguages. We also show how to translate specifications in a higher-order language to a first-order one, such as Prolog, introducing closures as a replacement for substitutions. This process illustrates how a very high-level description of an implementation can be translated to lower-level ones by reasoning about the logic in which the descriptions are given. It also illustrates some basic methods for manipulating functional languages represented in a higher-order abstract syntax. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Autoepistemic logic and formalization of commonsense reasoning preliminary report 2nd

Autoepistemic logic and formalization of commonsense reasoni...

引用

2nd international workshop on non-monotonic Reasoning, 1988

作者： Gelfond, Michael Computer Science Department The University of Texas at El Paso United States

来源：评论

学校读者我要写书评

暂无评论

OPEN logic THEORIES 2nd

OPEN LOGIC THEORIES

引用

2nd international workshop ON extensions OF logic programming ( ELP 91 )

作者： BROGI, A LAMMA, E MELLO, P Dipartimento di Informatica Università di Pisa Corso Italia 40 Pisa 56125 Italy DEIS Università di Bologna Viale Risorgimento 2 Bologna 40136 Italy

ISBN: (纸本)354055498X

The handling of evolving knowledge as well as of incomplete knowledge is one of the main issues in knowledge representation systems. On the one hand, evolving knowledge in logic programming can be modeled by providing suitable operators for the dynamic composition of separate theories. On the other hand, when dealing with dynamic composition of separate theories, the Open World Assumption adequately models the aspects of incompleteness of knowledge. A notion of open theory is introduced along with suitable operators for composing and closing theories. It is shown how these operators can be exploited to reconstruct several policies for structuring logic programs. Open theories, as well as the operators for their composition, are provided with a compositional declarative semantics defined in terms of Herbrand models, while a proof theory is given in terms of inference rules. Soundness and completeness results are stated. © Springer-Verlag Berlin Heidelberg 1992.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A logic programming APPROACH TO IMPLEMENTING HIGHER-ORDER TERM REWRITING 2nd

A LOGIC PROGRAMMING APPROACH TO IMPLEMENTING HIGHER-ORDER TE...

引用

2nd international workshop ON extensions OF logic programming ( ELP 91 )

作者： FELTY, A INRIA Rocquencourt Domaine de Voluceau Le Chesnay Cedex 78153 France AT&T Bell Laboratories 600 Mountain Avenue Murray Hill 07974 NJ United States

ISBN: (纸本)354055498X

Term rewriting has proven to be an important technique in theorem proving. In this paper, we illustrate that rewrite systems and strategies for higher-order term rewriting, which includes the usual notion of first-order rewriting, can be naturally specified and implemented in a higher-order logic programming language. We adopt a notion of higher-order rewrite system which uses the simply typed λ-calculus as the language for expressing rules, with a restriction on the occurrences of free variables on the left hand sides of rules so that matching of terms with rewrite templates is decidable. The logic programming language contains an implementation of the simply-typed lambda calculus including βη-conversion and higher-order unification. In addition, universal quantification in queries and the bodies of clauses is permitted. For higher-order rewriting, we show how these operations implemented at the meta-level provide elegant mechanisms for the object-level operations of descending through terms and matching terms with rewrite templates. We discuss tactic style theorem proving in this environment and illustrate how term rewriting strategies can be expressed as tactic-style search. © Springer-Verlag Berlin Heidelberg 1992.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning systems

Properties of maximal cliques of a pair-wise compatibility g...

引用

2nd international workshop on Answer Set programming Advances in Theory and Implementation, ASP 2003

作者： Mercer, R.E. Risch, V. Cognitive Engineering Laboratory Department of Computer Science University of Western Ontario London ON N6A 5B7 Canada InCA Team LSIS - UMR CNRS 6168 Domaine Universitaire de Saint-Jérôme avenue Escadrille Normandie Niemen 13397 Marseille cédex 20 France

In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic programming, and a restricted form of default logic. We show some properties of the maximal cliques of the pair-wise compatibility graph givn by the relation between the rules of the various reasoning systems. Properties that these maximal cliques possess are presented. A procedure to compute stable models (resp. answer sets, extensions) by enumerating maximal cliques with intelligent pruning is sketched.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming Advances in Theory and Implementation - Proceedings of the 2nd Intl. ASP 2003 workshop

Answer Set Programming Advances in Theory and Implementation...

引用

2nd international workshop on Answer Set programming Advances in Theory and Implementation, ASP 2003

The proceedings contain 28 papers. The topics discussed include: outlier detection using default logic;translation of aggregate programs to normal logic programs;complexity of answer set checking and bounded predicate parities for non-ground answer set programming;parametric connectives in disjunctive logic programming;graphs and colorings for answer set programming: abridged report;eliminating disjunction from propositional logic programs under stable model preservation;a counter-based approach to translating normal logic programs into sets of clauses;integrating semantic web reasoning and answer set programming;using criticalities as a heuristic for answer set programming;implementing OCLP as a front-end for answer set solvers: from theory to practice;computing answer sets of a logic program via-enumeration of sat certificates;mappings between domain models in answer set programming;and towards the use of semantic contents in ASP for planning and diagnostic in GIS.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GCLA-II - A DEFINITIONAL APPROACH TO CONTROL 2nd

GCLA-II - A DEFINITIONAL APPROACH TO CONTROL

引用

2nd international workshop ON extensions OF logic programming ( ELP 91 )

作者： KREUGER, P Swedish Institute of Computer Science Box 1263 Kista S-164 28 Sweden

ISBN: (纸本)354055498X

This paper describes the logic programming language GCLA II, its operational semantics and parts of its theoretical foundations. GCLA II is a generalization of the language GCLA (Generalized Horn Clause Language) augmented by a method to guide and constrain proof search. The method is based on specification of strategies in a meta language that is a sub language of GCLA itself. A GCLA II program is partitioned into two distinct parts. One is used to express the declarative content of the program, while the other is used to define the possible inferences made from this declarative knowledge. Although the intended use of the declarative part and the procedural parts are quite different, they can both be described in the formalism of partial inductive definitions. Thus we preserve a declarative reading of the program as a whole. In particular, given certain syntactical constraints on the program, the heuristics associated with proof search does not affect the declarative reading of the declarative part of the program at all. Experimental interpreters for the language have been implemented and work on a compiler from GCLA II to Prolog is almost completed. © Springer-Verlag Berlin Heidelberg 1992.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A logic of fixpoint definitions 2

A logic of fixpoint definitions

引用

2nd workshop on Answer Set programming and Other Computing Paradigms, ASPOCP 2009, collocated with the 25th international Conference on logic programming, ICLP 2009

作者： Hou, Ping Denecker, Marc Department of Computer Science Katholieke Universiteit Leuven Belgium

We introduce the fixpoint definitions, which is a reformulation of fixpoint logic constructs. We define the logic FO(FD), an extension of first order logic with fixpoint definitions. We illustrate the relation between fixpoint definitions and non-monotone inductive definitions in FO(ID), which is developed as an integration of ASP and classical logic. We investigate the satisfiability problem, SAT(FD), of the propositional fragment of FO(FD). We also demonstrate how to extend existing SAT solvers to become SAT(FD) solvers. © 2009 Institute of Electrical and Electronics Engineers Inc. All rights reserved.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Modelling intentional reasoning with defeasible and temporal logic

Modelling intentional reasoning with defeasible and temporal...

引用

Joint 5th international workshop on logics, Agents, and Mobility, LAM 2012, the 1st international workshop on Petri Net-Based Security, WooPS 2012 and the 2nd international workshop on Petri Nets Compositions, CompoNet 2012

作者： Castro-Manzano, José Martín Escuela de Filosofía Universidad Popular Autónoma del Estado de Puebla 21 sur 1103 Barrio de Santiago Puebla 72410 Mexico Instituto de Investigaciones Filosó Universidad Nacional Autónoma de México Circuito Mario de la Cueva s/n Ciudad Universitaria México D.F. 04510 Mexico

We follow the hypothesis that intentional reasoning is a form of logical reasoning sui generis by its double nature: temporal and defeasible. Then we briefly describe a formal framework that deals with these topics and we study the metalogical properties of its notion of inference. The idea is that intentional reasoning can be represented in a well-behaved defeasible logic and has the right to be called logical reasoning since it behaves, mutatis mutandis, as a logic, strictly speaking, as a non-monotonic logic.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：