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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

11 篇 会议

馆藏范围

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

日期分布

学科分类号

10 篇 工学
- 10 篇 计算机科学与技术...
- 9 篇 软件工程
- 1 篇 控制科学与工程

主题

8 篇 logic programmin...
1 篇 computer circuit...
1 篇 middle school sc...
1 篇 computing

机构

2 篇 matsushita elect...
2 篇 department of co...
1 篇 department of ma...
1 篇 department of co...
1 篇 logic programmin...
1 篇 department of co...
1 篇 department of el...
1 篇 texas tech univ ...
1 篇 kyoto university
1 篇 department of co...
1 篇 department of ma...
1 篇 keio university

作者

1 篇 kolaitis phokion...
1 篇 przynrasinski te...
1 篇 aiso hideo
1 篇 papadimitriou ch...
1 篇 tamura hideo
1 篇 akasaka kôji
1 篇 sivakumar g.
1 篇 terada minoru
1 篇 lifschitz vladim...
1 篇 wang jianlan
1 篇 dershowitz nachu...
1 篇 matsumoto yûji
1 篇 tokoro mario
1 篇 gelfond michael
1 篇 hoshida masaki
1 篇 song fei
1 篇 cohen robin
1 篇 bolduc fox
1 篇 zhang yuanlin
1 篇 murray william g...

语言

11 篇 英文

检索条件"任意字段=7th Conference on Logic Programming, LP 1988"

共 11 条记录，以下是1-10 订阅

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

详细简洁

排序：

7th conference on logic programming, lp 1988

引用

7th conference on logic programming, lp 1988

ISBN: (纸本)9783540515647

the proceedings contain 16 papers. the special focus in this conference is on logic programming. the topics include: Completeness of extended unification based on basic narrowing;implementation of full GHC by communicating processes;inference methods and semantics on or-type knowledge bases;access program to minimize redundant refutations on the network database system;eUODHILOS: A general-purpose reasoning assistant system — Concept and implementation —;logic based lexical analyser LAX;extraction of characteristic facts and abstract generation;knowledge representation and reasoning for discourse understanding;proving definite clauses without explicit use of inductions;pseudo extension in default reasoning and belief revision by model inference;an approach to nonmonotonic inference mechanism in production system KORE/IE;nonmonotonic parallel inheritance network;logic programming debugger using control flow specification;aLEX: the logic programming language with explicit control and without cut-operators;lattice programming methodology;a simple programming system written in GHC and its reflective operations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Relationship Between logic programming and Non-monotonic Reasoning 7

On the Relationship Between Logic Programming and Non-monoto...

引用

7th National conference on Artificial Intelligence, AAAI 1988

作者： Przynrasinski, Teodor C. Department of Mathematics University of Texas El PasoTX79968 United States

ISBN: (纸本)0262510553

In spite of the existence of a close relationship between logic programming and non-monotonic reasoning, in the past the two research areas have progressed largely independently of each other. Recently, however, a new declarative semantics of logic programs has been proposed and it has been shown to be equivalent to suitable forms of four major non-monotonic formalisms: McCarthy's circumscription, Reiter's closed world assumption, Moore's autoepistemic logic and Reiter's default logic. the importance of these results stems not only from the fact that they shed new light on the relationship between logic programming and non-monotonic reasoning, but also from the fact that they establish a close relationship between four major formalizations of non-monotonic reasoning for an important class of theories. Copyright © 1988, AAAI (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Implementation of full GHC by communicating processes 7th

引用

7th conference on logic programming, lp 1988

作者： Terada, Minoru Department of Mathematical Engineering and Information Physics Faculty of Engineering University of Tokyo Japan

ISBN: (纸本)9783540515647

In this paper an algorithm for interpreting the parallel logic language GHC (Guarded Horn Clauses) is described. the algorithm interprets full GHC programs using several communicating processes, which do not share data objects. To control unification and suspension, an integer (called commit value) is attached to each external references. An implementation of the algorithm on a concurrent lisp is also reported. this algorithm is applicable to conventional languages. © 1989, Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

logic programming debugger using control flow specification 7th

引用

7th conference on logic programming, lp 1988

作者： Tamura, Hideo Aiso, Hideo Keio University Japan

ISBN: (纸本)9783540515647

the size of the intermediate files produced by the debugging system is 164 KBytes when the non-backtrack test program fills the local stack (128K Bytes), so it has no practical problem. We have implemented a system that support meta-predicates (‘call’, ‘not’). We are considering how to cope the ‘assert’ predicate. there are two types of bug the ‘retract’ predicate can cause:(1)the case where variables are bound to the arguments of ‘retract’.(2)the case where a term is deleted by the ‘retract’ predicate. this system can cope with the case (1), but not (2). © 1989, Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

ALEX: the logic programming language with explicit control and without cut-operators 7th

引用

7th conference on logic programming, lp 1988

作者： Hoshida, Masaki Tokoro, Mario Department of Electrical Engineering Keio University Yokohama223 Japan Matsushita Electric Industrial Co. Ltd. Japan

ISBN: (纸本)9783540515647

We propose a Prolog-like new programming language "ALEX". It is an extension of Prolog from the view point of procedural programming, keeping the merit of declarative feature of Prolog. In ALEX, the backtrack mechanism is divided into two categories: "Recall" and "Retry". "Recall" corresponds to "essential trial and error" and it appears rarely in the program, while "Retry" corresponds to "branch on condition" and it appears frequently. In ALEX, these actions are controlled by different methods, and "Recall" is restricted in default state. Control in ALEX is described as prefix of predicate. As a result, cut-operators are excluded, and we achieve easy debugging and higher readability. © 1989, Springer-Verlag.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Compiling Circumscriptive theories into logic Programs: Preliminary Report 7

Compiling Circumscriptive Theories into Logic Programs: Prel...

引用

7th National conference on Artificial Intelligence, AAAI 1988

作者： Gelfond, Michael Lifschitz, Vladimir Department of Computer Science University of Texas at El Paso El PasoTX79968 United States Department of Computer Science Stanford University StanfordCA94305 United States

ISBN: (纸本)0262510553

We study the possibility of reducing some special cases of circumscription to logic programming. the description of a given circumscriptive theory T can be sometimes transformed into a logic program II, so that, by running II, we can determine whether a given ground literal is provable in T. the method is applicable, in particular, to some formalizations of tree-structured inheritance systems with exceptions. Copyright © 1988, AAAI (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

Goal-Directed Equation Solving 7

Goal-Directed Equation Solving

引用

7th National conference on Artificial Intelligence, AAAI 1988

作者： Dershowitz, Nachum Sivakumar, G. Department of Computer Science University of Illinois at Urbana-Champaign 1304 W. Springfield Ave UrbanaIL61801 United States

ISBN: (纸本)0262510553

Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like EQLOG, SLOG and RITE, express programs as rewrite rules and use narrowing to solve goals expressed as equations. In this paper, we express equational goal solving by means of a logic program that simulates rewriting of terms. Our goal-directed equation solving procedure is based on "directed goals", and combines narrowing with a more top-down approach. We also show how to incorporate a notion of operator derivability to prune some useless paths, while maintaining completeness of the method. Copyright © 1988, AAAI (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

lp Based Integration of Computing and Science Education in Middle Schools 19

LP Based Integration of Computing and Science Education in M...

引用

4th ACM conference on Global Computing Education (CompEd)

作者： Zhang, Yuanlin Wang, Jianlan Bolduc, Fox Murray, William G. Texas Tech Univ Lubbock TX 79409 USA

ISBN: (纸本)9781450362597

there is a consensus on integrating computing with STEM teaching in K-12. However, very little is known about the integration. In this paper, we propose a novel framework for integrating science and computational thinking teaching using logic programming. We then develop and implement two 8-session integration modules on chemistry and physics for 6th and 7th graders. Pre-and post-tests, class observations and interviews show the feasibility of the framework in terms of 1) development and implementation of the modules, and 2) the students' learning outcomes on science content and Computational thinking, and their acceptance of the integration.

关键词： logic programming Middle School Science Computing

来源：评论

学校读者我要写书评

暂无评论

logic based lexical analyser LAX 7th

引用

7th conference on logic programming, lp 1988

作者： Sugimura, Ryôichi Akasaka, Kôji Kubo, Yukihiro Matsumoto, Yûji Matsushita Electric Industrial Co. LTD. Japan Japan Kyoto University Japan

ISBN: (纸本)9783540515647

this paper describes a method of Japanese morphological analysis which runs in a sequential or parallel logic programming language. In the method presented here, a morphological dictionary is compiled into a logic program which executes lexical analysis deterministically. Morphemes and their categories are written in a morphological dictionary. the categories are used as inputs to a non-deterministic finite state automaton (NFSA). the dictionary is compiled into a TRIE structure in which morphemes can be quickly looked up using an index search mechanism such as those provided in logic programming languages like ESP or Prolog. the layered stream technique, which records search space in recursively structured data, is applied in analysis. All solutions are given at the end of analysis. the analysis output can be used as input to the syntactic analyser, SAX, which can also be executed in parallel logic languages. this method can process unknown morphemes which are not in the dictionary in linear order. this paper also reports the evaluation of this method in sequential languages. © 1989, Springer-Verlag.

关键词： Computer circuits

来源：评论

学校读者我要写书评

暂无评论

Some Computational Aspects of Circumscription 7

Some Computational Aspects of Circumscription

引用

7th National conference on Artificial Intelligence, AAAI 1988

作者： Kolaitis, Phokion G. Papadimitriou, Christos H. Department of Computer Science Stanford University StanfordCA94305 United States Department of Computer Science and Engineering University of California La Jolla San DiegoCA92093 United States

ISBN: (纸本)0262510553

We explore the effects of circumscribing first-order formulae from a computational standpoint. First, extending work of V. Lifschitz, we show that the circumscription of any existential first-order formula is equivalent to a first-order formula After this, we establish that a set of universal Horn clauses has a first-order circumscription if and only if it is bounded (when considered as a logic program);thus it is undecidable to tell whether such formulae have first-order circumscription. Finally, we show that there are fiist-order formulae whose circumscription has a coNP-complete model-checking problem. Copyright © 1988, AAAI (***). All rights reserved.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：