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

Yet another efficient backward execution algorithm in the AND/OR process model

Information Processing Letters 1992年第3期43卷 165-165页

作者： Do-Hyung Kim Kwang-Moo Choe Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusong-Dong Yusung-Gu Taejon 305-701 South Korea

来源：评论

学校读者我要写书评

暂无评论

YET ANOTHER EFFICIENT BACKWARD EXECUTION ALGORITHM IN THE AND OR PROCESS MODEL

引用

INFORMATION PROCESSING LETTERS 1991年第4期40卷 201-211页

作者： KIM, DH CHOE, KM Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 371-1 Kusong-Dong Yusang-Gu Taejon 305-701 South Korea

An efficient backward execution algorithm in the AND/OR Process Model for parallel evaluation of logic programs is proposed. The efficiency of the algorithm is achieved by means of information acquired during execution of clauses. The algorithm is considered to be efficient in the sense that it issues fewer number of cancel messages and avoids unnecessary resetting operations. Furthermore, it performs independent redoing and resetting more concurrently than other related works.

关键词： APPLICATIVE (LOGIC) programming PARALLEL EVALUATION OF LOGIC PROGRAMS AND OR PROCESS MODEL AND PARALLELISM BACKWARD EXECUTION ALGORITHM MULTIPLE FAILURE SELECTIVE RESETTING

来源：评论

学校读者我要写书评

暂无评论

A proof-theoretic approach to logic programming: II. Programs as definitions

引用

Journal of Logic and Computation 1991年第5期1卷 635-660页

作者： Hallnäs, Lars Schroeder-Heister, Peter Programming Methodology Group Department of Computer Science Chalmers University of Technology Sweden Universitä Tübingen 7400 Tübingen Germany University Göteborg 412 96 Göteborg Sweden

We introduce a definitional extension of logic programming by means of an inference schema (Ph), which, in acertain sense, is dual to the (1-P) schema of rule application discussed in Part I. In the operational semantics, this schema is dual to the resolution principle. We prove soundness and completeness for the extended system, discuss the computation of substitutions that this new schema gives rise to, and also consider the notion of negation intrinsic to the system and its relation to negation by failure. © 1991 Oxford University Press.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Normalising the associative law: An experiment with Martin-Löf's type theory

引用

Formal Aspects of Computing 1991年第3期3卷 218-252页

作者： Hedberg, Michael Programming Methodology Group Department of Computer Sciences Chalmers University of Technology Göteborg S-412 96 Sweden

Martin-Löf's type theory contains a logic, a specification language and a programming language, so it is a tool with different uses. Although it is traditionally used as an integrated programming logic, it may well be used as an external logic, which is necessary if one wants to use the formalism of type theory to verify the correctness of an external program. Different tools, such as well founded recursion, measure functions, or the separation of correctness into termination and partial correctness, may be used to obtain a correct type theory program. Type theory is viewed as an open system with respect to inductively defined types and predicates, which makes it easy to represent an external program as a graph. Formal proofs have been edited using Larry Paulson's ISABELLE. © 1991 BCS.

关键词： Associative law Functional programming Inductive types Type theory

来源：评论

学校读者我要写书评

暂无评论

HOW WELL ARE NON-HORN CLAUSES HANDLED 6th

HOW WELL ARE NON-HORN CLAUSES HANDLED

引用

6TH INTERNATIONAL SYMP ON METHODOLOGIES FOR INTELLIGENT SYSTEMS ( ISMIS 91 )

作者： NIE, XM Institute for Programming and Logics Department of Computer Science State University of New York at Albany Albany 12222 NY United States

ISBN: (纸本)3540545638

We analyze the search space of two clause-based proof procedures, the Model Elimination procedure and Near-Horn Prolog, both of Loveland. We study how the search space changes with respect to the degree of how “non-Horn” a clause set is. The “non-Hornness” of a clause set is measured by the average number of negative subgoals in a clause. We show that Near-Horn Prolog performs better at the very beginning of the “non-Hornness” scale. But when the clause set becomes more and more non-Horn, model elimination has a clear advantage over Near-Horn Prolog. We also observe an interesting symmetrical property of the search space of model elimination. The reason for this symmetry is that model elimination treats positive literals and negative literals in the same way. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Using types as search keys in function libraries

引用

Journal of Functional programming 1991年第1期1卷 71-89页

作者： Rittri, Mikael Programming Methodology Group Department of Computer Sciences Chalmers University of Technology and University of Goteborg S-412 96 Göteborg Sweden

A method is proposed to search for an identifier in a functional program library by using its Hindley-Milner type as a key. This can be seen as an approximation of using the specification as a key. Functions that only differ in their argument order or currying are essentially the same, which is expressed by a congruence relation on types. During a library search, congruent types are identified. If a programmer is not satisfied with the type of a found value, he can use a conversion function (like curry), which must exist between congruent types, to convert the value into the type of his choice. Types are congruent if they are isomorphic in all cartesian closed categories. To put it more simply, types are congruent if they are equal under an arithmetical interpretation, with cartesian product as multiplication and function space as exponentiation. This congruence relation is characterized by seven equational axioms. There is a simple term-rewriting algorithm to decide congruence, using which a search system has been implemented for the functional language Lazy ML, with good performance. The congruence relation can also be used as a basis for other search strategies, e.g. searching for identifiers of a more general type, modulo congruence or allowing free type variables in queries. © 1991, Cambridge University Press. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Semantic file systems 91

Semantic file systems

引用

13th ACM Symposium on Operating Systems Principles, SOSP 1991

作者： Gifford, David K. Jouvelot, Pierre Sheldon, Mark A. O'Toole Jr., James W. Programming Systems Research Group MIT Laboratory for Computer Science United States CRI Ecole des Mines de Paris France

ISBN: (纸本)0897914473

A semantic file system is an information storage system that provides flexible associative access to the system's contents by automatically extracting attributes from files with file type specific transducers. Associative access is provided by a conservative extension to existing tree-structured file system protocols, and by protocols that are designed specifically for content based access. Compatiblity with existing file system protocols is provided by introducing the concept of a virtual directory. Virtual directory names are interpreted as queries, and thus provide flexible associative access to files and directories in a manner compatible with existing software. Rapid attribute-based access to file system contents is implemented by automatic extraction and indexing of key properties of file system objects. The automatic indexing of files and directories is called "semantic" because user programmable transducers use information about the semantics of updated file system objects to extract the properties for indexing. Experimental results from a semantic file system implementation support the thesis that semantic file systems present a more effective storage abstraction than do traditional tree structured file systems for information sharing and command level programming. © 1991 ACM.

关键词： Transducers

来源：评论

学校读者我要写书评

暂无评论

An algebra for Delay-Insensitive circuits 2nd

An algebra for Delay-Insensitive circuits

引用

2nd International Conference on computer-Aided Verification, CAV 1990

作者： Josephs, Mark B. Udding, Jan Tijmen Programming Research Group Oxford University Computing Laboratory 11 Keble Road OxfordOX1 3QD United Kingdom Department of Computer Science Washington University Campus Box 1045 St. LouisMO63130 United States

ISBN: (纸本)9783540544777

A novel process algebra is presented;algebraic expressions specify delay-insensitive circuits in terms of voltage-level transitions on wires. The approach appears to have several advantages over traditional state-graph and production-rule based methods. The wealth of algebraic laws makes it possible to specify circuits concisely and facilitates the verification of designs. Individual components can be composed into circuits in which signals along internal wires axe hidden from the environment. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Resolution and path dissolution in multiple-valued logics 6th

Resolution and path dissolution in multiple-valued logics

引用

6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991

作者： Murray, Neil V. Rosenthal, Erik Inst. for Programming & Logics Dept. of Computer Science State Univ. of N.Y. at Albany AlbanyNY12222 United States Dept. of Mathematics University of New Haven 300 Orange Avenue West HavenCT06516 United States

ISBN: (纸本)9783540545637

Path dissolution is an inferencing mechanism for classical logic that efficiently generalizes the method of analytic tableaux. Two features that both methods enjoy are (in the propositional case) strong completeness and the ability to produce a list of essential models (satisfying interpretations) of a formula. The latter feature is particularly valuable in a setting in which one wishes to make use of satisfying interpretations rather than merely to determine whether any exist. In this paper we describe a method for employing dissolution as a deduction mechanism for a class of multiple-valued logics that we call the UNF logics. The basic idea is to keep track of the sign of the formula. Dissolution is shown to be a sound rule of inference as well as strongly complete in this setting. We also describe how the signing technique may be used to apply resolution to these logics;Robinson's semantic tree argument is adapted to prove completeness. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Dissolution

来源：评论

学校读者我要写书评

暂无评论

Formal specification of software systems using Two-Level Grammar 15

Formal specification of software systems using Two-Level Gra...

引用

15th Annual International computer Software and Applications Conference, CMPSAC 1991

作者： Bryant, Barrett R. Pan, Aiqin Computer and Information Sciences Dept. University of Alabama at Birmingham UAB Station Mail Stop 1170 BirminghamAL35294 United States Knowledge Based/Programming Systems IBM Santa Teresa Laboratory Department L78 555 Bailey Avenue San JoseCA95161 United States

ISBN: (纸本)0818621524

Two-Level Grammar (TLG) is proposed for the formal specification and automatic generation of software systems. TLG specifications are unique in that they are a structured form of natural language which is executable. This has the potential for greatly increasing the reliability of the developed software system for the following reasons. Because it is a form of natural language, TLG may be used as an effective communication medium between the system users, designers, and implementors, thereby reducing the likelihood of errors caused by miscommunication. Furthermore, we may automatically generate an efficient software system, expressed in C, from the specification in a provably correct way. Successful applications have included database/knowledge base systems and programming language compilers. © 1991 IEEE.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：