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

Modelling human expertise in knowledge engineering: some preliminary observations

International Journal of Man-Machine Studies 1987年第1期26卷 81-92页

作者： Littman, David C. Cognition and Programming Project Department of Computer Science Yale University New Haven Connecticut 06520 United States

This paper reports the results of an empirical analysis of the knowledge engineering behavior of six persons with extensive experience in artificial intelligence (AI). The six persons were given the task of designing an AI program and were videotaped while they did so;during their 2–3 h design sessions, they were asked to talk aloud about what they were doing and why they were doing it. The paper identifies several recurrent behaviors common to all the AI designers. For example, several components of the designers' goal structures are identified, as is the importance of focussing on a “touchstone”, or key issue, around which much of the designer's behavior revolves. Several potential implications of the research for the design of knowledge engineering tools are explored. © 1987, Academic Press Inc. (London) Limited. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Projections for strictness analysis 3rd

引用

3rd International Conference on Functional programming Languages and computer Architecture, 1987

作者： Wadler, Philip Hughes, R.J.M. Programming Research Group Oxford University United Kingdom Programming Methodology Group Chalmers University Göteborg Sweden Department of Computer Science University of Glasgow United Kingdom

ISBN: (纸本)9783540183174

Contexts have been proposed as a means of performing strictness analysis on non-flat domains. Roughly speaking, a context describes how much a sub-expression will be evaluated by the surrounding program. This paper shows how contexts can be represented using the notion of projection from domain theory. This is clearer than the previous explanation of contexts in terms of continuations. In addition, this paper describes finite domains of contexts over the non-flat list domain. This means that recursive context equations can be solved using standard fixpoint techniques, instead of the algebraic manipulation previously used. © 1987, Springer-Verlag.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Inverse image analysis 14th

Inverse image analysis

引用

14th International Colloquium on Automata, Languages, and programming, ALP 1987

作者： Dybjer, Peter Programming Methodology Group Department of Computer Sciences Chalmers University of Technology and University of Göteborg GöteborgS-412 96 Sweden

ISBN: (纸本)9783540180883

A method for analysing the inverse of a first-order functional program is proposed. This method is based on denotational semantics: we analyse the inverse image of a Scott open set under the continuous function which the program denotes. Inverse image analysis is one possible way of extending strictness analysis to languages with lazy data structures and could perhaps be used to optimise code in implementations of such languages. © 1987, Springer-Verlag.

关键词： Image analysis

来源：评论

学校读者我要写书评

暂无评论

Industrial machine vision: lessons and challenges

引用

Optics News 1987年第2期13卷 12-17页

作者： Steven W. Holland Robert B. Tilove STEVEN W. HOLLAND is an assistant department head in the Computer Science Dept. of General Motors Research Laboratories (GMR). He is responsible for research projects involving computer vision robotics mobile robotics process planning knowledge systems natural language advanced programming environments parallel processing and statistics. ROBERT B. TILOVE is senior staff research scientist and project leader of the machine perception project at GMR. His research interests include geometric modeling model-based programming and control of intelligent automation systems.

No abstract available.

关键词： Integral imaging Machine vision Measurement and metrology Optical systems Sensors Statistics

来源：评论

学校读者我要写书评

暂无评论

Alternatives to construct-based programming misconceptions 86

Alternatives to construct-based programming misconceptions

引用

1986 SIGCHI Conference on Human Factors in Computing Systems, CHI 1986

作者： Spohrer, James C. Soloway, Elliot Department of Computer Science Cognition and Programming Project Yale University New HavenCT06520 United States

ISBN: (纸本)0897911806

In this paper, we investigate whether or not most novice programming bugs arise because students have misconceptions about the semantics of particular language constructs. Three high frequency bugs are examined in detail - one that clearly arises from a construct-based misconception, one that does not, and one that is less cut and dry. Based on our empirical study of 101 bug types from three programming problems, we will argue that most bugs are not due to misconceptions about the semantics of language constructs. © 1986 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Analysis of Tutorial Reasoning About programming Bugs 5

An Analysis of Tutorial Reasoning About Programming Bugs

引用

5th National Conference on Artificial Intelligence, AAAI 1986

作者： Littman, David C. Pinto, Jeannine Soloway, Elliot Cognition and Programming Project Department of Computer Science Yale University New HavenCT06620 United States

A significant portion of tutorial interactions revolve around the bugs a student makes. When a tutor performs an intervention to help a student fix a programming bug, the problem of deciding which intervention to perform requires extensive reasoning. In this paper, we identify five tutorial considerations tutors appear to use when they reason about how to construct tutorial interventions for students' bugs. Using data collected from human tutors working in the domain of introductory computer programming, we identify the knowledge tutors use when they reason about the five considerations and show that tutors are cottsistent in the ways that they use the kinds of knowledge to remon about students' bugs. In this paper we illustrate our findings of tutorial consistency by showing that tutors are consistent in how they reason about bug criticality and bug categories. We suggest some implications of these empirical findings for the construction of intelligent tutoring systems. © 1986 AI Access Foundation. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

New directions in logic programming 86

New directions in logic programming

引用

1986 ACM 14th Annual Conference on computer Science, CSC 1986

作者： Bowen, Kenneth A. Logic Programming Research Group School of Computer and Information Science Syracuse University Syracuse NY13210 United States

ISBN: (纸本)0897911776

Prolog has established itself as a highly successful example of the logic programming paradigm. Today there are a number of vigorous research streams exploring methods of extending the capabilities and capacities achieved by Prolog. These include treatment of concurrency, inclusion of functional programming capabilities, and incorporation of metalevel reasoning techniques. The paper will survey the goals and current state of these explorations. © 1986 ACM.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

PROGRAM DERIVATION IN TYPE THEORY - A PARTITIONING PROBLEM

引用

computer LANGUAGES 1986年第3-4期11卷 161-172页

作者： PETERSSON, K SMITH, JM Programming Methodology Group Department of Computer Sciences University of Göteborg/Chalmers S-412 96 Göteborg Sweden

Martin-Löf's type theory is a theory in which one can write both specifications and programs. By interpreting propositions as types, predicate logic is available when formulating a specification. The rules of type theory are formulated as tactics which makes a “top down” construction of programs possible. These ideas are illustrated by a formal derivation of a program for a partitioning problem.

关键词： Type Specification Program derivation Goal Tactic

来源：评论

学校读者我要写书评

暂无评论

Category theory and programming language semantics: An overview

Category theory and programming language semantics: An overv...

引用

Workshop on Category Theory and computer programming, 1985

作者： Dybjer, Peter Programming Methodology Group Department of Computer Sciences Chalmers University of Technology and University of Göteborg GöteborgS-412 96 Sweden

ISBN: (纸本)9783540171621

I have not tried to be comprehensive here. Instead I have tried to pursue the idea of category theory as a kind of type theory and thereby I have only included those uses of category theory which I have found particularly useful for understanding type theory, domain theory and algebraic semantics. Therefore, several things have been excluded, such as Arbib and Manes' (1980) partially additive semantics and Winskel's (1984) categories of Petri nets, to mention only two examples of interest. © 1986, Springer-Verlag.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Fast decompilation of compiled Prolog clauses 3rd

引用

3rd International Conference on Logic programming, ICLP 1986

作者： Buettner, Kevin A. Logic Programming Research Group School of Computer & Information Science Syracuse University United States

ISBN: (纸本)9783540164920

Serious Prolog implementations in recent years have been primarily compiler-based, nearly all of which are founded on the abstract instruction set of Warren [1983]. The performance achieved by such implementations greatly outstrips that attainable in interpreter-based systems. Unfortunately, the sophistication of these compiler-based environments is often inferior to environments of interpreter-based systems to the extent that a "compatible" interpreter is often required for serious software development. Among the deficiencies of these environments, database operations such as assert, retract, and clause seem to be particularly afflicted. In addition, the ability to debug compiled code has been either non-existent or at best, very constrained. Unlike compiler technology of many traditional languages, there is little reason for this to be the case in Prolog. An efficient implementation of retract, listing, and clause by decompilation of compiled clause code is the subject of this paper. Techniques used in the implementation of the decompilation process have also proven useful in the implementation of the standard four port debugger found in many Prolog systems. © 1986, Springer-Verlag.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：