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

IEEE International Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE)

作者： K.L. Clark V.S. Lazarou Logic Programming Section Department of Computing Imperial College London London UK

In this paper a novel approach concerned with the general framework of information management, is presented. We use a Multi-Agent system to cope with the problem of distributed information retrieval. The distributed information retrieval task deals with the collection of information from multiple and usually heterogeneous information sources that exist in a distributed environment, which in our case is the world wide web.

关键词： Multiagent systems Information retrieval Web sites Information management Data mining Uniform resource locators World Wide Web Web pages Artificial intelligence logic programming

来源：评论

学校读者我要写书评

暂无评论

LogiMOO: A multi-user virtual world with agents and natural language programming

LogiMOO: A multi-user virtual world with agents and natural ...

引用

Conference on Human Factors in Computing Systems, CHI EA 1997

作者： Tarau, Paul Dahl, Veronica Rochefort, Stephen De Bosschere, Koen Departement d'Informatique Universite de Moncton Moncton Canada Logic Programming Group School of Computing Science Simon Fraser University Burnaby Canada Vakgroep Elektronica en Informatiesystemen Universiteit Gent Gent Belgium

LogiMOO is a BinProlog-based Virtual World running under Netscape or Internet Explorer. It is user extensible and supports distributed group-work over the Internet. Virtual places, virtual objects and agents are progr... 详细信息

ISBN: (纸本)0897919262

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

A constraint-based approach for specification and verification of real-time systems

A constraint-based approach for specification and verificati...

引用

Real-Time Systems Symposium (RTSS)

作者： G. Gupta E. Pontelli Laboratory for Logic Databases and Advanced Programming Department Computer Science New Mexico State University USA

We develop a general constraint logic programming (CLP) based framework for specification and verification of real time systems. Our framework is based on the notion of timed automata that have traditionally been used for specifying real time systems. In our framework, a user models the ordering of real time events as the grammar of a language accepted by a timed automata, the real time constraints on these events are then captured as denotations of the grammar productions specified by the user. The grammar can be specified as a Definite Clause Grammar (DCG), while the denotations can be specified in constraint logic. The resulting specification can hence be regarded as a constraint logic program (CLP), and is executable. Many interesting properties of the real time system can be verified by posing appropriate queries to this CLP program. A major advantage of our approach is that it is constructive in nature, i.e., it can be used for computing the conditions under which a property will hold for a given real time system. Our framework also suggests new types of formalisms that we call constraint automata and timed push down automata.

关键词： Real time systems Automata logic programming Production systems Databases Computer science Vehicles Clocks Context modeling

来源：评论

学校读者我要写书评

暂无评论

Optimization schemas for parallel implementation of nondeterministic languages and systems

Optimization schemas for parallel implementation of nondeter...

引用

International Symposium on Parallel Processing

作者： G. Gupta E. Pontelli Laboratory for Logic Databases and Advanced Programming New Mexico State University Las Cruces NM USA

Naive parallel implementation of nondeterministic systems (such as a theorem proving system) and languages (such as a logic, constraint, or a concurrent constraint language) can result in poor performance. We present three optimization schemas based on flattening of the computation tree, procrastination of overheads, and sequentialization of computations that can be systematically applied to parallel implementations of nondeterministic systems/languages to reduce the parallel overhead and to obtain improved efficiency of parallel execution. The effectiveness of these schemas is illustrated by applying them to the ACE parallel logic programming system. Performance data presented shows that considerable improvement in performance can result.

关键词： logic programming Constraint theory Concurrent computing Artificial intelligence Constraint optimization Computer languages Parallel processing Laboratories Databases Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Data parallel logic programming in &ACE

Data parallel logic programming in &ACE

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： E. Pontelli G. Gupta Laboratory for Logic Databases and Advanced Programming New Mexico State University USA

&ACE is a high performance parallel Prolog system developed at the Laboratory for logic, Databases, and Advanced programming that exploits and-parallelism from Prolog programs. &ACE was developed to exploit MIMD parallelism. However, SPMD parallelism also arises naturally in many Prolog programs. In this paper we develop runtime techniques that allow systems that have primarily been designed to exploit MIMD parallelism (such as &ACE) to also efficiently exploit SPMD parallelism. These runtime techniques have been incorporated in the &ACE system. Performance of &ACE augmented with these techniques on programs containing SPMD parallelism is presented.

关键词： logic programming Runtime Parallel processing Program processors programming profession Artificial intelligence Laboratories Databases Parallel programming Sun

来源：评论

学校读者我要写书评

暂无评论

Nested parallel call optimization

Nested parallel call optimization

引用

International Symposium on Parallel Processing

作者： E. Pontelli G. Gupta Laboratory for Logic Databases and Advanced Programming New Mexico State University NM USA

We present a novel optimization called Last Parallel Call Optimization (LPCO) for parallel systems. The last parallel call optimization can be regarded as a parallel extension of last call optimization found in sequential systems. While the LPCO is fairly general, we use and-parallel logic programming systems to illustrate it and to report its performance on multiprocessor systems. The last parallel call optimization leads to improved time and space performance for a majority of and-parallel programs. We also present a generalization of the Last Parallel Call Optimization called Nested Parallel Call Optimization (NPCO). A major advantage of LPCO and NPCO is that parallel systems designed for exploiting control parallelism can automatically exploit data parallelism efficiently.

关键词： logic programming Multiprocessing systems Automatic control Control systems

来源：评论

学校读者我要写书评

暂无评论

Machine intelligibility and the duality principle

British Telecom technology journal

引用

British Telecom technology journal 1996年第4期14卷 15-23页

作者： Muggleton, S. Michie, D. Wolfson College Oxford United Kingdom University of Tokyo Turing Institute Glasgow United Kingdom Intelligent Systems Research Group BT Laboratories Inductive Logic Programming Oxford University Press Logic Programming ILP Oxford Univ. Computing Laboratory University of Edinburgh Royal Society of Edinburgh British Computer Society

Lack of machine intelligibility in human/computer interactions can be traced to present approaches in software design. From the duality principle, software involved in human/computer software interaction contains two distinct layers, a declarative knowledge-level layer and a lower-level functional or procedural-knowledge layer. The former supports simple deductive and inductive inferences and can be used to facilitate human-comprehensible communication between programs, while the latter is composed of normal procedurally encoded computer programs. The duality principle in software design is necessary in dealing with the demands of wide-scale computer usage in the information age and an urgent goal for computer science research.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A hypothetical reasoning based framework for NL processing

A hypothetical reasoning based framework for NL processing

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： V. Dahl A. Fall S. Rochefort P. Tarau Logic Programming Group School of Computing Science Simon Fraser University Burnaby BC Canada Département d'Informatique Université de Moncton Moncton Canada

We examine some natural language uses of a new type of logic grammars called Assumption Grammars, particularly suitable for hypothetical reasoning. They are based on intuitionistic and linear implications scoped over the current continuation, which allow us to follow given branches of the computation under hypotheses that disappear when and if backtracking takes place. We show how Assumption Grammars can simplify the treatment of some crucial computational linguistics problems, e.g. long distance dependencies, while simultaneously facilitating more readable grammars.

关键词： logic programming Mars Natural languages Helium Delay Concrete Natural language processing Switches

来源：评论

学校读者我要写书评

暂无评论

logic programming and logic grammars with first-order continuations 4th

引用

4th International Workshop on logic Program Synthesis and Transformation, LOPSTR 1994 and Metaprogramming in logic, META 1994

作者： Tarau, Paul Dahl, Veronica Département d’Informatique Université de Moncton MonctonNBE1A 3E9 Canada Logic Programming Group Department of Computing Sciences Simon Fraser University BurnabyBCV5A 1S6 Canada

ISBN: (纸本)9783540587927

Continuation passing binarization and specialization of the WAM to binary logic programs have been proven practical implementation techniques in the BinProlog system. In this paper we investigate the additional benefits of having first order continuations at source level. We devise a convenient way to manipulate them by introducing multiple-headed clauses which give direct access to continuations at source-level. We discuss the connections with various logic grammars, give examples of typical problem solving tasks and show how looking at the future of computation can improve expressiveness and describe complex control mechanisms without leaving the framework of binary definite programs. © Springer-Verlag Berlin Heidelberg 1994.

关键词： logic programming

来源：评论

学校读者我要写书评

暂无评论

On anti-links 5th

引用

5th International Conferenceon logic programming and Automated Reasoning, LPAR 1994

作者： Beckert, Bernhard Hähnle, Reiner Ramesh, Anavai Murray, Neil V. Institute for Logic Complexity and Deduction Systems Universität Karlsruhe Karlsruhe Germany Institute for Programming & Logics Department of Computer Science University at Albany AlbanyNY12222 United States

ISBN: (纸本)9783540582168

The concept of anti-link is defined, and useful equivalence-preserving operations on propositional formulas based on anti-links are introduced. These operations eliminate a potentially large number of subsumed paths in a negation normal form formula. The operations have linear time complexity in the size of that part of the formula containing the anti-link. These operations are useful for prime implicant/implicate algorithms because most of the computational effort in such algorithms is spent on subsumption checks. © Springer-Verlag Berlin Heidelberg 1994.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：