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

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1989年第5-6期44卷 274-282页

作者： COHEN, J 1.Department of Computer Science Brandeis Univ. 92254-9110 Waltham Massachusetts USA

The paper surveys the recent work done in attempting to parallelize logic programs. Topics covered include the basic types of parallelism and their variants, the Prolog-like languages that have been proposed to explore parallelism, a brief review of current parallel computers, implementation issues, results of benchmarks, and a discussion of the research directions worth pursuing. Although not exhaustive, a state-of-the-art bibliography is also included.

关键词： Logical programming Parallel processing Parallelism Parallel programming programmation logique Traitement parallèle Parallélisme programmation parallèle

来源：评论

学校读者我要写书评

暂无评论

LISLOG-C - A 1ST STEP TO GENERALIZED EXPRESSION OF CONSTRAINTS IN LOGIC PROGRAMMING

引用

ANNALES DES TELECOMMUNICATIONS-ANNALS OF TELECOMMUNICATIONS 1989年第5-6期44卷 218-228页

作者： BOURGAULT, S LEPAPE, JP RANSON, D ***-laa-slc route de Trégastel 40 F-22301 Lannion Cedex Lannion

En Prolog standard, la réalisation d’un programme de bonne qualité opérationnelle suppose une formulation souvent très éloignée de la spécification initiale du problème. En Lislog-C (LISp + proLOG + Contraintes), la déclaration de contraintes permet généralement d’assurer la qualité opérationnelle de la programmation simplement calquée sur la spécification. Sur le plan externe, le nouveau concept de base de Lislog-C est le concept de contraintes; il s’intègre très naturellement au formalisme des clauses de Horn. Le point fort de la notion de contraintes est que, tout en améliorant la puissance et la souplesse du langage, elle assure un comportement optimisé des programmes à l’exécution. Sur le plan interne, l’approche Lislog-C assure, d’une part, la richesse et la fiabilité de l’interface Lisp/Prolog et, d’autre part, la réalisation de mécanismes de contr?le transparents pour l’utilisateur. De nombreux types de problèmes font naturellement appel au concept de contraintes: caracterisation d’ensembles, description de types, domaines, gestion de ressources, synchronisation par événements, etc. Les quelques exemples traités illustrent la facilité de la programmation basée sur les contraintes.

关键词： Langage programmation Prolog Lisp programmation logique Contrainte Programming language Prolog language Lisp language Logical programming Constraint

来源：评论

学校读者我要写书评

暂无评论

Expressing unrestricted grammars by extended definite clause grammars

引用

Computational Intelligence 1989年第2期5卷 127-133页

作者： Knudsen, Erik Systems Development and Artificial Intelligence Laboratory Department of Computer and Systems Sciences University of Stockholm Stockholm S-106 91 Sweden

A definition of extended definite clause grammars and their relationship to unrestricted grammars are presented. A method for translating extended definite clause grammars describing unrestricted grammars into executable prolog programs is given. Three different parsing techniques are presented, and for each a complete presentation of how to incorporate unrestricted grammars in the actual formalism is done. Extended definite clause grammar is a powerful formalism usable for specifying grammars in natural language processing systems. Copyright © 1989, Wiley Blackwell. All rights reserved

关键词： analyse definite clause grammars grammaires non restreintes grammaires à clauses définies Iogic programming parsing programmation logique unrestricted grammars

来源：评论

学校读者我要写书评

暂无评论

Logics in Artificial Intelligence : European Workshop, Jelia'98 Dagstuhl, Germany, October 12-15, 1998 : Proceedings

引用

2016年

作者： j. dix

Logics in Artificial Intelligence : European Workshop, Jelia'98 Dagstuhl, Germany, October 12-15, 1998 : Proceedings by European Workshop Jelia'98 (1998 : Dagstuhl, Germany); Dix, J. (Jürgen), 1961-; Fariñas... 详细信息

关键词： artificial artificial intelligence automatisches beweisverfahren dagstuhl, démonstration théorème épistémologie european germany, inteligencia artificial intelligence artificielle kongress kunstmatige intelligentie logic, symbolic logica logique mathématique non classique logique ordre élevé logique symbolique et mathématique logique temporelle logische programmierung mathematical nichtmonotones schließen nonstandard-logik programmation en logique programmation logique raisonnement non monotone représentation connaissance sémantique

来源：评论

学校读者我要写书评

暂无评论

Logics in Artificial Intelligence : 9Th European Conference, Jelia 2004, Lisbon, Portugal, September 27-30, 2004 : Proceedings

引用

2016年

作者： josé júlio alferes

Logics in Artificial Intelligence : 9Th European Conference, Jelia 2004, Lisbon, Portugal, September 27-30, 2004 : Proceedings by Jelia (Conference) (9Th : 2004 : Lisbon, Portugal); Alferes, José Júlio; Leite, João... 详细信息

关键词： ai artificial artificial intelligence conference, european intelligence artificielle intelligence artificielle - congrès jelia künstliche intelligenz logic, symbolic logics logique (informatique) logique symbolique logique symbolique et mathématique logique symbolique et mathématique - congrès logische programmierung logischer schluss mathematical mehragentensystem programmation logique

来源：评论

学校读者我要写书评

暂无评论

Logic Program Synthesis and Transformation : 7Th International Workshop, Lopstr'97, Leuven, Belgium, July 10-12, 1997 : Proceedings

引用

2016年

作者： n. e. fuchs

Logic Program Synthesis and Transformation : 7Th International Workshop, Lopstr'97, Leuven, Belgium, July 10-12, 1997 : Proceedings by International Workshop on Logic Program Synthesis; Transformation (1997 : Leuv... 详细信息

关键词： analyse programme automatisches beweisverfahren belgium, international leuven, logic logic programming logica matematica logique inductive logische programmierung métaprogrammation metaprogrammierung programacao de computadores programmation en logique programmation logique programmschema programmsynthese programmtransformation transformation programme

来源：评论

学校读者我要写书评

暂无评论

Compiling general linear recursions by variable connection graph analysis

引用

Computational Intelligence 1989年第1期5卷 12-31页

作者： Han, Jiawei School of Computing Science Simon Fraser University Burnaby British Columbia V5A 1S6 Canada

Compilation is a powerful preprocessing technique in the processing of recursions in knowledge‐based systems. This paper develops a method of compiling and optimizing complex function‐free linear recursions using a variable connection graph, the V‐graph. It shows that a function‐free recursion consisting of a linear recursive rule and one or more nonrecursive rules can be compiled to (1) a bounded recursion, in which recursion can be eliminated from the program, or (2) an n‐chain recursion, whose compiled formula consists of one chain, when n= 1, or n synchronized compiled chains, when n > 1. The study is based on a classification of linear recursions and a study of the compilation results of each class. Using the variable connection graph, linear recursions are classified into six classes: acyclic paths, unit cycles, uniform cycles, nonuniform cycles, connected components, and their disjoint mixtures. Recursions in each class share some common properties in compilation. Our study presents an organized picture for the compilation of general function‐free linear recursions. After compilation, the processing of complex linear recursions becomes essentially the processing of primitive n‐chain recursions or bounded recursions to which efficient processing methods are available. Copyright © 1989, Wiley Blackwell. All rights reserved

关键词： bases de données déductives compilation techniques deductive databases knowledge‐based systems logic programming programmation logique recursive query processing systèmes à base de connaissances techniques de compilation traitement des requětes récursif

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：