AI Technical Reports an incomplete bibliography of about 5000 lines from Usenet ------------------------------------------------------------------------ Path: yetti!mnetor!seismo!ut-sally!husc6!rutgers!sri-spam!ames!ucbcad!ucbvax!SMU From: E1AR0002@SMUVM1.BITNET (Leff, Southern Methodist University) Newsgroups: mod.ai Subject: AI.BIB43TR Date: 3 Mar 87 22:35:00 GMT Date-Received: 8 Mar 87 15:00:52 GMT Sender: daemon@ucbvax.BERKELEY.EDU Distribution: world Organization: The ARPA Internet Lines: 808 Approved: ailist@sri-stripe.arpa %A Ashar A. Butt %T Cell Design in Prolog %I University of California, Berkeley %R CSD 86/286 %K AA04 T02 %X $3.50 %A David Michael Ungar %T The Design and Evaluation of a High Performance Smalltalk System %I University of California, Berkeley %R CSD 86/287 %X $9.00 %A Yigal Arens %T CLUSTER: An Approach to Contextual Language Understanding %I University of California, Berkeley %R CSD 86/293 %K Unix Consultant AI02 AA15 %X $8.25 %A Robert Wilensky %T Some Problems and Proposals for Knowledge Representation %I University of California, Berkeley %R CSD 86/294 %K AI02 AI16 kodiak AT14 %X $3.25 %A Joseph Pasquale %T Knowledge Based Distributed System Management %I University of California, Berkeley %R CSD 86/295 %K AA08 %X $2.50 %A Paul Schafran Jacobs %T A Knowledge Based Approach to Language Production %I University of California, Berkeley %R CSD 86/254 %K AI02 O01 %X $7.50 %A Jung-Herng Chang %T High Performance Execution of Prolog Programs Based on a Static Data Dependence Analysis %I University of California, Berkeley %R CSD 86/263 %K T02 %X $5.00 %R CS-86-147 Computer Science Department %I Washington State University %C Pullman, WA 99164-1210 %T COREL - A CONCEPTUAL RETRIEVAL SYSTEM %A M. Kathryn Di Benigno %A George R. Cross %A Gary G. deBessonet %K AI16 %X Corel is an experimental retrieval system that employs techniques of artificial intelligence. Articles of the Civil Code of Louisiana have been conceptually indexed using frame-based knowledge structures in hope of improving accessibility over traditional key-word retrieval systems. A set of macro packages has been developed to allow a domain expert to implement a retrieval system based on this methodology. %R CS-86-149 Computer Science Department %I Washington State University %C Pullman, WA 99164-1210 %T THE STRUCTURE OF CCLIPS %A Mohammed Nasiruddin %A George R. Cross %A Cary G. deBessonet %K AA24 %X The Civil Code Legal Information Processing System (CCLIPS) is a conceptual retrieval system whose domain is the Louisiana Civil Code. Statutes are coded in Atomically Normalized Form (ANF) and entered into a database. Legal situations are entered by the user in ANF and relevant statutes are retrieved. We discuss the current status of the system and some plans for further development. %R CSL T.R. 86-291 %T Lisp and Prolog Memory Performance %A Evan Tick %D January 1986 %I Stanford University Computer Systems Laboratory %X This report presents a comparison between a Lisp and Prolog architecture bas ed on memory performance. Four Lisp programs were translated into Common Lisp and Prolog abstract machine instruction sets. The translated programs were emulated and memory reference counts collected. Memory usage statistics indicate how the two languages do fundamental computations different ways with varying efficiency. Additional measurements of production systems running on a conventional host are presented. %R CSL-TN-86-286 %T Microprogram Control of a Prolog Machine %A Kiyomi Koyama %D January 1986 %X .br br A Prolog machine design and its control are described. The machine features two-stage pipelining, a triple bus interconnection data path and support for concurrent control of micro-operations. The objective of this design is to improve execution of a Prolog processor by simultaneously performing multiple micro-operations. Capabilities of concurrent operation support are described in detail and demonstrated using some example Prolog functions. Two-stage pipeline technique as applied to non-deterministic control of Prolog program execution will be presented. .br br 37 pages.....$4.35 %R 1260 %T The AQ15 Inductive Learning System: An Overview and Experiments %A R. S. Michalski %A I. Mozetic %A J. Hong %A N. Lavrac %I The University of Illinois at Urbana-Champaign, Department of Computer Scienc e %D JUL 1986 %K AI04 %R 1268 %T Automated Reference Librarians for Program Libraries and Their Interaction with Language Based Editors %A J. J. Shilling %I The University of Illinois at Urbana-Champaign, Department of Computer Scienc e %D AUG 1986 %K AA14 %R 1293 %T Induction, Of and By Probability %A Larry Rendell %R 1268 %I The University of Illinois at Urbana-Champaign, Department of Computer Scienc e %D AUG 1986 %K AI04 %A Marianne Winslett Wilkins %T A Model-Theoretic Approach to Updating Logical Databases %D JAN 1986 %R STAN-CS-86-1096 %I Stanford University, Department of Computer Science %D JAN 1986 %K AI10 AA09 %$ 5.00 %A Jitendra Malik %T Interpreting Line Drawings of Curved Objects %D DEC 1985 %R STAN-CS-86-1099 %I Stanford University, Department of Computer Science %K AI06 %$ 15.00 %A Martin Abadi %A Zohar Manna %T Modal Theorem Proving %D MAY 1986 %R STAN-CS-86-1100 %I Stanford University, Department of Computer Science %K AA13 AI11 %$ 5.00 %A David E. Foulser %T On Random Strings and Sequence Comparisons %D FEB 1986 %R STAN-CS-86-1101 %I Stanford University, Department of Computer Science %K O06 %$ microfiche only charge listed as N/A %A Devika Subramanian %T A Survey of AI Classnotes for Winter 84-85 %D APR 1986 %R STAN-CS-86-1104 %I Stanford University, Department of Computer Science %K AI16 %$ 15.00 %A Martin Abadi %A Zohar Manna %T A Timely Resolution %D APR 1986 %R STAN-CS-86-1106 %I Stanford University, Department of Computer Science %K AI11 temporal logic AI10 %A David E. Smith %T Controlling Inference %D APR 1986 %R STAN-CS-86-1107 %I Stanford University, Department of Computer Science %K AI03 %$ 15.00 %A K. Morris %A J. Ullman %A A. Van Gelder %T Design Overview of the NAIL! System %D MAY 1986 %R STAN-CS-86-1108 %I Stanford University, Department of Computer Science %K AI10 AA09 %X Nail = Not another implementation of logic %$ 5.00 %A Ross Casley %T A Proof Editor for Propositional Temporal Logic %D MAY 1986 %R STAN-CS-86-1109 %I Stanford University, Department of Computer Science %K AI11 %$ 5.00 %A Y. Malachi %A Z. Manna %A R. Waldinger %T TABLOG: A New Approach to Logic Programming %D MAR 1985 %I Stanford University, Department of Computer Science %R STAN-CS-86-1110 %K AI10 %$ 5.00 %A Paul Rosenbloom %A John Laird %T Mapping Explanation-Based Generalization onto Soar %D JUN 1986 %R STAN-CS-86-1111 %I Stanford University, Department of Computer Science %K AI16 explanation-based generalization %$ 5.00 %A Jeffrey F. Naughton %T Optimizing Function-Free Recursive Inference Rules %D MAY 1986 %R STAN-CS-86-1114 %I Stanford University, Department of Computer Science %K AI10 %$ 5.00 %A B. G. Buchanan %A B. Hayes-Roth %A O. Lichtarge %T The Heuristic Refinement Method for Deriving Solution Structures of Proteins %R STAN-CS-86-1115 %D MAR 1986 %I Stanford University, Department of Computer Science %K AA10 AI01 %$ 5.00 %A Li-Min Fu %A Bruce G. Buchanan %T Inductive Knowledge Acquisition for Rule-based Expert Systems %R STAN-CS-86-1116 %I Stanford University, Department of Computer Science %D OCT 1985 %K AI01 %$ 5.00 %A D. Howe %T Implementing Number Theory: An Experiment with NUPRL %I Cornell University, Department of Computer Science %D MAY 1986 %R 86-752 %K AA13 AI11 AI14 %A J. Sasaki %T Extracting Efficient Code From Constructive Proofs %I Cornell University, Department of Computer Science %D JUNE 1986 %R 86-757 %K AA08 %A M. P. Mendler %T First and Second Lambda Calculi with Recursive Types %I Cornell University, Department of Computer Science %D JUL 1986 %R 86-764 %K T01 %A J. Bates %T THEFRL Mathematics Environment: A Knowledge Based Medium %I Cornell University, Department of Computer Science %D AUG 1986 %R 86-768 %K AA13 %A C. Kreitz %T Constructive Automata Theory Implemented with the Nuprl Proofl Development Systems %I Cornell University, Department of Computer Science %D SEP 1986 %R 86-779 %K AA13 AA08 AI11 %A A. Moitra %A P. Panangaden %T A Proof System for Dataflow Networks with Indeterminate Modules %I Cornell University, Department of Computer Science %D SEP 1986 %R 86-782 %K AA13 AA08 AI11 %A J. D. Ward %A B. E. Gillett %A A. R. DeKock %T CIGEN: A System for Testing Knowledge Base Compilation Heuristics on a Microcomputer %I University of Missouri-Rolla Department of Computer Science %R CSC 84-10 %D 1984 %K AA08 %A K. W. Whiting %A A. R. DeKock %A J. B. Prater %T A Focus of Attention Algorithm for Expert Systems %I University of Missouri-Rolla Department of Computer Science %R CSC 84-12 %D 1984 %K AI01 %A R. M. Butler %A A. R. DeKock %T An Algorithm for Parallel Subsumption %I University of Missouri-Rolla Department of Computer Science %R CSc 84-1 %D 1985 %K H03 AI11 %A R. L.Boehning %A B. E. Gillett %T A Parallel Branch and Bound Algorithm for Integer Linear Programming Models %I University of Missouri-Rolla Department of Computer Science %R CSC 85-2 %D 1985 %K H03 AI03 %A R. S. Dare %A A. R. DeKock %T Genesis of an Expert System for UMR Degree Auditing %I University of Missouri-Rolla Department of Computer Science %R CSC 86-3 %D 1986 %K AI01 AA07 %A J. H. Marchal %A A. R. DeKock %T MICA: prototyping an Expert System Consultant %I University of Missouri-Rolla Department of Computer Science %R CSC 86-5 %D 1986 %K AI01 %A J. A. Vila Ruiz %A A. R. DeKock %T A Computerized Audio-Visual Speech Model %I University of Missouri-Rolla Department of Computer Science %R CSC 86-4 %D 1986 %K AI05 %A D. Wise %T The Applicative Style of Programming %I Oregon State University, Department of Computer Science %R CSTR 84-2 %D 1984 %A F. Springsteel %T Expert Systems for Exploratory Data Analysis: Towards Automated Research %I Oregon State University, Department of Computer Science %R CSTR 85-30-1 %D 1985 %K AA12 AI01 automated knowledge acquisition %A F. Springsteel %T Biomedical Knowledge Acquisition: Three Systems Reviewed %I Oregon State University, Department of Computer Science %R CSTR-86-60-1 %D 1986 %K AA01 AI01 AA12 automated knowledge acquisition %A T. Dietterich %T Learning at the Knowledge Level %I Oregon State University, Department of Computer Science %R CSTR-86-30-1 %D 1986 %K AI04 %A T. G. Dietterich %A N. S. Flann %A D. C. Wilkins %T A Summary of Machine Learning Papers from IJCAI-85 %I Oregon State University, Department of Computer Science %R CSTR-86-30-2 %D 1986 %K AI04 %A N. S. Flann %A T. G. Dietterich %T Two Short Papers on Machine Learning %I Oregon State University, Department of Computer Science %R CSTR-86-30-3 %D 1986 %K AI04 %A A. Birjandi %A T. G. Lewis %T YASHAR: A Ruled Based Meta-tool for Program Development %I Oregon State University, Department of Computer Science %R CSTR-86-10-1 %D 1986 %K AI01 AA08 %X this system does computer language to language translations and restructuring of code %A A. Birjandi %A T. G. Lewis %T ARASH: A Re-Structuring Environment for Building Software Systems From Reusable Components %I Oregon State University, Department of Computer Science %R CSTR-86-10-2 %D 1986 %K AA08 %A A. Birjandi %A T. G. Lewis %T Artimis: A Module Indexing and Source Program Reading and Understanding Environment %I Oregon State University, Department of Computer Science %R CSTR-86-10-3 %D 1986 %K AA14 AA08 %A J. S. Bennett %A T. G. Dietterich %T The Test Incorporation Hypothesis and the Weak Methods %I Oregon State University, Department of Computer Science %R CSTR-86-30-4 %D 1986 %K AI03 %A N. S. Flann %A T. G. Dietterich %T Selecting Appropriate Representations for Learning From Examples %I Oregon State University, Department of Computer Science %D 1986 %R CSTR-86-30-5 %K AI16 AI04 %A C. S. Rapp %T Algebra READER: An Expert Algebra Work Problem Reader %I Oregon State University, Department of Computer Science %D 1986 %R CSTR-86-30-6 %K AA07 AA13 AI02 AI01 %A W. S. Bregar %A A. M. Farley %A G. Bayley %T Knowledge Sources for an Intelligent Algebra Tutor %I Oregon State University, Department of Computer Science %R CSTR-86-30-7 %D 1986 %K AA07 AA13 %A C. Swart %A D. Richards %T On the Inference of Strategies %I Oregon State University, Department of Computer Science %R CSTR-86-20-3 %D 1986 %K AI04 O06 %A W. G. Rudd %A K. Uppuluri %A G. R. Cross %A S. Haley %T Expert Systems for Management of Pests of Agricultural Crops %I Oregon State University, Department of Computer Science %R CSTR-86-60-4 %D 1986 %K AA23 AI01 %A T. G. Dietterich %A D. G. Ullman %T FORLOG: A Logic-based Architecture for Design %I Oregon State University, Department of Computer Science %R CSTR-86-30-8 %D 1986 %K AA05 AI10 %A D. G. Ullman %A L. A. Stauffer %A T. G. Dietterich %T Preliminary Results of an Experimental Study of the Mechanical Design Process %I Oregon State University, Department of Computer Science %R CSTR-86-30-9 %D 1986 %K AA05 AI08 %A Edward A. Stohr %A Jon A. Turner %A Yannis Vassiliou %A Norman H. White %T Research in Natural Language Retrieval Systems %I New York University, Center for Research on Information Systems %R 30 %K AA09 AI02 %A Jon A. Turner %A Matthias Jarke %A Edward A. Stohr %A Yannis Vassiliou %A Norman H. White %T Using Restricted Natural Language for Data Retrieval: A Plan for Field Evalua tion %I New York University, Center for Research on Information Systems %R 38 %K AA09 AI02 %A Yannis Vassiliou %A James Clifford %A Matthias Jarke %T How Does an Expert System Get its Data? %I New York University, Center for Research on Information Systems %R 50 %K AI01 %A Matthias Jarke %A Jacob Shalev %T A Knowledge-Based Approach to the 'Analysis and Design of Business Transactio n Processing Systems %I New York University, Center for Research on Information Systems %R 53 %K AA09 AA06 %A Yannis Vassiliou %A Matthias Jarke %A Edward A. Stohr %A Jon A. Turner %A Norman H. White %T Natural Languages for Database Queries: A Laboratory Study %I New York University, Center for Research on Information Systems %R 55 %K AI02 AA09 %A Matthias Jarke %A Yannis Vassiliou %T Coupling Expert Systems with Database Management Systems %I New York University, Center for Research on Information Systems %R 54 %K AI01 AA09 %A James Clifford %A Matthias Jarke %A Yannis Vassiliou %T A Short Introduction to Expert Systems %I New York University, Center for Research on Information Systems %R 59 %K AI01 AT08 %A Matthias Jarke %A Jon A. Turner %A Edward A. Stohr %A Yannis Vassiliou %A Norman H. White %A Ken Michielsen %T A Field Evaluation of Natural Language for Data Retrieval %I New York University, Center for Research on Information Systems %R 62 %K AI02 AA09 %A Matthias Jarke %A James Clifford %A Yannis Vassiliou %T An Optimizing Prolog Front End to a Relational Query Systems %I New York University, Center for Research on Information Systems %R 65 %K AA09 T02 %A Taracad Sivasankaran %A Matthias Jarke %T Logic-Based Formula Management Strategies in an Actuarial Consulting System %I New York University, Center for Research on Information Systems %R 69 %K AA06 AA12 AI01 %A Matthias Jarke %A Jurgen Krause %A Yannis Vassiliou %T Studies in the Evaluation of a Domain-Independent Natural Language Query Syst em %I New York University, Center for Research on Information Systems %R 72 %K AI02 AA09 %A Yannis Vassiliou %A Jim Clifford %A Matthias Jarke %T Database Access Requirements of Knowledge Based Systems %I New York University, Center for Research on Information Systems %R 74 %K AA09 %A Matthias Jarke %T External Semantic Query Simplification: A Graph Theoretic Approach and its Implementation in Prolog %I New York University, Center for Research on Information Systems %R 75 %K AA09 T02 %A Vasant Dhar %A Casey Quayle %T An Approach to Dependency Directed Backtracking Using Domain Specific Knowled ge %I New York University, Center for Research on Information Systems %R 89 %K AI03 %A Vasant Dhar %T On the Plausibility and Scope of Expert Systems in Management %I New York University, Center for Research on Information Systems %R 98 %K AI01 AA06 %A James Clifford %A Matthias Jarke %A Henry C. Lucas %T Designing Expert Systems in a Business Environment %I New York University, Center for Research on Information Systems %R 99 %K AI01 %A Vasant Dhar %A Matthias Jarke %T Analogical and Dependency-Directed Reasoning Strategies for Large Systems Evolution %I New York University, Center for Research on Information Systems %R 100 %K AI16 %A Jae B. Lee %A Edward A. Stohr %T Representing Knowledge for Portfolio Management Decision Making %I New York University, Center for Research on Information Systems %R 101 %K AA06 AI01 AI13 %R AI-208-86 %T Some Thoughts on Proof Discovery %I Microelectronics and Computer Technology Corporation %D JUN 1986 %K AI16 %R AI-160-86 %T Models of Technology Transfer at MCC %I Microelectronics and Computer Technology Corporation %D MAY 1986 %K AT19 %R AI-159-86 %T A Man-Machine Procedure for Building a Medium Sized Knowledge Base by Analogy and Learning: Preliminary Report %I Microelectronics and Computer Technology Corporation %D MAY 1986 %K AI16 AI04 %R Ai-158-86 %T The Use of Analogy in Automatic Proof Discovery: Preliminary Report %I Microelectronics and Computer Technology Corporation %D MAY 1986 %K AI16 %R AI-157-86 %T Algorithms for Subpixel Registration %I Microelectronics and Computer Technology Corporation %D APR 1986 %K AI06 %R AI-102-86 %T Extended Contradiction Resolution %I Microelectronics and Computer Technology Corporation %D MAR 1986 %K AI16 %R AI-101-86 %T Expert Systems in the Marketplace %I Microelectronics and Computer Technology Corporation %D MAR 1986 %K AI01 %R AI-082-86 %T Automating Knowledge Acquisition From Experts %I Microelectronics and Computer Technology Corporation %D MAR 1986 %K AI01 %R AI-016-86 %T A Diffusing Computation for Truth Maintenance %I Microelectronics and Computer Technology Corporation %D 1985 %K AI15 %R AI-013-86 %T Rule-Based Geometrical Reasoning for the Interpretation of Line Drawings %I Microelectronics and Computer Technology Corporation %D JAN 24, 1986 %K AI01 AI06 %R AI-181-85 %T Efficient Management of Backtracking in And-Parallelism %I Microelectronics and Computer Technology Corporation %D DEC 12, 1985 %K AI10 H03 AI03 %R AI-119-85 %T A Knowledge Engineering Bibliography %I Microelectronics and Computer Technology Corporation %D NOV 1985 %K AI01 AT09 %R AI-109-85 %T An Encoding Technique for the Efficient Implementation of Type Inheritance %I Microelectronics and Computer Technology Corporation %D DEC 1985 %K O06 %R AI-100-85 %T Suggested Reading List for an Introduction to Artificial Intelligence %I Microelectronics and Computer Technology Corporation %D OCT 1985 %K AT09 AI16 %R AI-083-85 %T Machine Translation: An American Perspective %I Microelectronics and Computer Technology Corporation %D AUG 1985 %K AI02 GA02 %R AI-082-85 %T Integrating Data Type Inheritance into Logic Programming %I Microelectronics and Computer Technology Corporation %D AUG 1985 %K AI10 %R AI-076-85 %T Logic and Inheritance %I Microelectronics and Computer Technology Corporation %D JUL 1985 %K AI10 %R AI-068-85 %T LOGIN: A Logic Programming Language with Built-In Inheritance %I Microelectronics and Computer Technology Corporation %D JUL 1985 %K AI10 %R AI-062-85 %T An Algorithm for Truth Maintenance %I Microelectronics and Computer Technology Corporation %D APR 1985 %K AI15 %R AI-055-85 %T CYC: Using Common Sense Knowledge to Overcome Brittleness and Knowledge Acquisition Bottlenecks %I Microelectronics and Computer Technology Corporation %D JUL 15, 1985 %K AI16 %R AI-054-85 %T "I Had A Dream" AAAI Presidential Address %I Microelectronics and Computer Technology Corporation %D AUG 19, 1985 %K AI16 %R AI-017-85 %T Extraction of Expert System Rules From Text %I Microelectronics and Computer Technology Corporation %D JUN 1985 %K AI01 AI02 %R Ai-015-85 %T The Treatment of Grammatical Categories and Word Order in Machine Translation %I Microelectronics and Computer Technology Corporation %D MAR 1985 %K AI02 %R AI-014-85 %T An Evaluation of Metal: The LRC Machine Translation System %I Microelectronics and Computer Technology Corporation %D MAR 1985 %K AI02 %R AI-013-85 %T The LRC Machine Translation System %I Microelectronics and Computer Technology Corporation %D MAR 1985 %K AI02 %R AI-012-85 %T A Machine-Aided Translation Bibliography %I Microelectronics and Computer Technology Corporation %D MAR 1985 %K AT09 AI02 %R AI-011-85 %T A Survey of Machine Translation: Its History, Current Status and Future Prospects %I Microelectronics and Computer Technology Corporation %D MAY 1985 %K AI02 AT08 %R AI-010-85 %T Machine Translation: Viewpoint From Both Sides %I Microelectronics and Computer Technology Corporation %D FEB 1985 %K AI02 %R AI-009-85 %T Machine Translation %I Microelectronics and Computer Technology Corporation %D FEB 1985 %K AI02 %R AI-008-85 %T A Practical Comparison of Parsing Strategies %I Microelectronics and Computer Technology Corporation %D MAY 1985 %K AI02 %R AI-007-85 %T Parser Construction Techniques: A Tutorial %I Microelectronics and Computer Technology Corporation %D MAY 1985 %K AI02 AT08 %R AI-006-85 %T Transportability to Other Languages: The Natural Language Processing Project in the AI Program at MCC %I Microelectronics and Computer Technology Corporation %D MAR 1985 %K AI02 %R AI-0100-05 %T Using Explicit Contradictions to Provide Explanations in a TMS %I Microelectronics and Computer Technology Corporation %D APR 1985 %K AI15 %R AI/CAD-162-85 %T Analogical Reasoning for Digital System Synthesis %I Microelectronics and Computer Technology Corporation %D MAY 1986 %K AA04 %R DB-081-86 %T A Computational Logic for Database Programs %I Microelectronics and Computer Technology Corporation %D March 12, 1986 %K AA09 %R DB-064-86 %T Analyzing the Run-Time Behavior of Logic Programs %I Microelectronics and Computer Technology Corporation %D March 6, 1986 %K AI10 %R DB-058-86 %T Some extensions to the Closed World Assumption in Databases %I Microelectronics and Computer Technology Corporation %D March 3, 1986 %K AA09 AI16 %R DB-026-86 %T LDL: A Logic Based Data-Language %I Microelectronics and Computer Technology Corporation %D February 11, 1986 %K AI10 AA09 %R DB-021-86 %T Optimizing the Rule/Data Interface in a Knowledge Management System %I Microelectronics and Computer Technology Corporation %D February 3, 1986 %K AA09 AI01 %R DB-171-85 %T Tools for the Analysis of Large Prolog Programs %I Microelectronics and Computer Technology Corporation %D DEC 3, 1985 %K T02 O02 %R DB-132-85 %T Parallel Evaluation of Recursive Rule Queries %I Microelectronics and Computer Technology Corporation %D October 1985 %K AI01 %R DB-121-85 %T Magic Sets and Other Strange Ways to Implement Logic Programs %I Microelectronics and Computer Technology Corporation %D October 28, 1985 %K AI10 %R DB-101-85 %T On the Implementation of a Simple Class of Logic Queries for Databases %I Microelectronics and Computer Technology Corporation %D October 14, 1985 %K AI10 AA09 %R DB-088-85 %T Safety and Compilation of Non-Recursive Horn Clauses %I Microelectronics and Computer Technology Corporation %D September 20, 1985 %K AI10 %R DB-038-85 %T Object Oriented Database Systems and Knowledge Systems %I Microelectronics and Computer Technology Corporation %D July 9, 1985 %K AI16 %R DB-021-85 %T A Logic-Programming/Object-Oriented Cocktail %I Microelectronics and Computer Technology Corporation %D September 10, 1985 %K AI10 %R Mcc/db/dbsa-7/rev.0 %T Database and Knowledge Based System Opportunities %I Microelectronics and Computer Technology Corporation %D October 5, 1986 %K AA09 %R mcc/db/kbs-77/rev.1 %T The Representation and Deductive Retrieval of Complex Objects %I Microelectronics and Computer Technology Corporation %D May 6, 1985 %K AI16 %R mcc/db/kbs-75/rev.1 %T The Transition from Data Management to Knowledge Management %I Microelectronics and Computer Technology Corporation %D April 30, 1985 %K AI16 %R mcc/db/kbs-52/rev.1 %T Opportunities for Parallelism in Knowledge Management Systems: A Bibliography %I Microelectronics and Computer Technology Corporation %D December 11, 1984 %K AT09 H03 %R mcc/db/kbs-49/rev.1 %T Logic Programming/Database Interfaces %I Microelectronics and Computer Technology Corporation %D December 5, 1984 %K AA09 AI10 %R mcc/db/kbs-44/rev.1 %T Rule Support in Prolog %I Microelectronics and Computer Technology Corporation %D November 30, 1984 %K AI01 T02 %R mcc/db/kbs-43/rev.1 %T Logics for Semantic Data Models %I Microelectronics and Computer Technology Corporation %D November 30, 1984 %K AI10 AI16 %R mcc/db/kbs-33/rev.0 %T KBS Requirements, Rev.0 %I Microelectronics and Computer Technology Corporation %D October 31, 1984 %K AI16 %R mcc/db/kbs-29/rev.1 %T Knowledge Base Development and Use in Deductive Data Management %I Microelectronics and Computer Technology Corporation %D October 31, 1984 %K AI16 %R HI-294-86 %T Human Computer Interactions and Intelligent Tutoring Systems %I Microelectronics and Computer Technology Corporation %D September 8, 1986 %K AA07 O01 %R HI-200-86 %T Speech Processing for the User Interface %I Microelectronics and Computer Technology Corporation %D July 1986 %K AI05 %R HI-179-86 %T A Parser for Portable NL Interfaces Using Graph-Unification-Based Grammars %I Microelectronics and Computer Technology Corporation %D June 1986 %K AI02 %R HI-075-86 %T Parsing as Heuristic Graph Search %I Microelectronics and Computer Technology Corporation %D Mar 6, 1986 %K AI02 %R HI-073-86 %T Ambiguity and Procrastination in NL Interfaces %I Microelectronics and Computer Technology Corporation %D March 1986 %K AI02 %R HI-012-86 %T Some Properties of Combinatory Categorical Grammars of Relevance to Parsing %I Microelectronics and Computer Technology Corporation %D January 22, 1986 %K AI02 %R HI-017-86 %T A General User Model, Part 1: Connectionist Framework %I Microelectronics and Computer Technology Corporation %D January 31, 1986 %K AI08 %R HI-118-85 %T Extraposition from NP as Anaphora %I Microelectronics and Computer Technology Corporation %D October 23, 1985; revision one: March 1986 %K AI02 %R HI-111-85 %T Memory for Spatial Locations and Related Topics: A Review and Annotated Bibliography %I Microelectronics and Computer Technology Corporation %D October 18, 1985 %K AI08 AT09 %R HI-089-85 %T Graphic Interfaces for Knowledge-Based System Development %I Microelectronics and Computer Technology Corporation %D September 1985; revision one: December 1985 %K O01 O02 %R HI-084-85 %T Analysis of User-Expert Dialogues: Task Networks, Subdialogue Boundary Markers and Antecedent Distribution %I Microelectronics and Computer Technology Corporation %D December 1, 1985 %K AI08 AI01 AI02 %R HI-074-85 %T Natural Language Understanding: How Natural Can it Be? %I Microelectronics and Computer Technology Corporation %D September 13, 1985 %K AI02 %R HI-066-85 %T Applications of Speech Technology in the CAD Workstation %I Microelectronics and Computer Technology Corporation %D April 26, 1985 %K AI05 AA04 AA15 %R HI-85-103-04 %T On the Applied Use of Computer Models of Human Memory: A Proposal for a Large-Scale Personal Filing System %I Microelectronics and Computer Technology Corporation %D 1985 %K AA14 AI08 %R HI-85-102-04 %T Memory Structure, Focusing, and Anaphora Resolutions: A Study and Comparison of Computer and Human Memory %I Microelectronics and Computer Technology Corporation %D 1985 %K AI08 %R HI-85-100-04 %T Speech Processing State of the Art Report %I Microelectronics and Computer Technology Corporation %D 1985 %K AI05 AT08 %R HI/STP-054-86 %T Artificial Intelligence and Advanced User Interfaces %I Microelectronics and Computer Technology Corporation %D February 25, 1986 %K AI02 %R PP-083-86 %T Goal Scheduling and Memory Management in Parallel Logic Systems %I Microelectronics and Computer Technology Corporation %D March 15, 1986 %K H03 AI10 %R PP-020-86 %T Potentials for Parallel Execution of Common Lisp Programs %I Microelectronics and Computer Technology Corporation %D January 30, 1986 %K T01 H03 %R PP-154-85 %T An Abstract Machine for Restricted And-Parallel Execution of Logic Programs %I Microelectronics and Computer Technology Corporation %D November 26, 1985 %K AI10 H03 %R PP-140-85 %T A Study of the Parallelism Inherent in Combinator Reduction %I Microelectronics and Computer Technology Corporation %D Nov 11, 1985 %K H03 %R PP-104-85 %T A Restricted and-Parallel Execution Model and Abstract Machine for Prolog Programs %I Microelectronics and Computer Technology Corporation %D October 2, 1985 %K T02 H03 %R PP-079-85 %T Parallel Execution of a Rule-Based Expert System %I Microelectronics and Computer Technology Corporation %D 1985 %K AI01 H03 %R PP-024-85 %T Expert System Application Study %I Microelectronics and Computer Technology Corporation %D 1985 %K AI01 %R PP-019-85 %T Proceedings of the MCC Workshop on LFP (Logical/Functional) programming Languages %I Microelectronics and Computer Technology Corporation %D July 1, 1985 %K AI10 %R STP-053-86 %T Biggertalk* = Biggertalk + Gordion %I Microelectronics and Computer Technology Corporation %D November 1, 1985 %K AI10 %R TR 86-1 %T Data and Resource Abstraction Mechanisms on an Object-Based Architecture %A Kanad Gose %A R. M. Steward %I Iowa State University %D JAN 1986 %R TR 86-16 %T On Developing a Logic for Program Derivation and Verification %A David A. Schmidt %A Jacek Leszczylowski %I Iowa State University %D NOV 1986 %K AA08 AI10 predicate calculation %R TR 86-21 %T Logic Programming with External Procedures: Introducing S-Unification %A Jacek Lesczylowski %A Jan Maluszynski %I Iowa Sate University %D DEC 1986 %K AI10 %R 83-5 %A Helen M. Gigley %A Jean-Francois Boulicaut %A Eric Ramahefarivony %T Grasper-Insa -- A Graph Processing Tool for Knowledge Engineering %I University of New Hamshire %D SEP 1983 %K T01 %R 83-6 %A Helen M. Gigley %T Processing Word Ambiguities: Availability of Multiple Meanings of Ambiguous Words in Aphasic Patients and Normal Controls %I University of New Hampshire, Department of Computer Science %D SEP 1983 %K AA08 AA11 AI02 %R 83-8 %A Sylvia Weber Russell %T Conceptual Analysis of Partial Metaphor %I University of New Hampshire, Department of Computer Science %D OCT 1983 %K AI02 %R 83-9 %A Michael J. Quinn %T On the Speedup of Parallel Depth-First Branch-and-Bound Algorithms %I University of New Hampshire, Department of Computer Science %D NOV 1983 %K H03 AI03 %R 84-13 %A Eugene C. Freuder %T Utilizing Subgraph Isomorphism in Constraint Graphs %I University of New Hampshire, Department of Computer Science %D JAN 1984 %K constraint satisfaction AI03 %R 84-14 %A Eugene C. Freuder %T A Sufficient Condition for Backtrack-Bounded Search %I University of New Hampshire, Department of Computer Science %D JAN 1984 %K AI03 constraint satisfaction %R 84-15 %A Eugene C. Freuder %T Direct Independence of Variables in Constraint Satisfaction Problems %I University of New Hampshire, Department of Computer Science %D MAR 1984 %K AI03 H03 %A Lee Tibbert %A R. Daniel Bergeron %R 84-18 %T Graphics Programming For Knowledge-Guided Interaction %I University of New Hampshire, Department of Computer Science %D JAN 1984 %K O01 %A Eugene C. Freuder %A Michael J. Quinn %T Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems %R 84-20 %I University of New Hampshire, Department of Computer Science %D DEC 1984 %K AI03 %A Eugene C. Freuder %A Michael J. Quinn %T Parallelism in an Algorithm that Takes Advantage of Stable Sets of Variables to Solve Constraint Satisfaction Problems %R 85-21 %I University of New Hampshire, Department of Computer Science %D Jan 1985 %K AI03 H03 %A Michael J. Quinn %A Narsingh Deo %R 85-23 %T An Upper Bound for the Speedup of Parallel Branch-and-Bound Algorithms %I University of New Hampshire, Department of Computer Science %D FEB 1985 %K AI03 H03 %A Helen M. Gigley %T Computational Neurolinguistics -- What is it all About %R 85-24 %I University of New Hampshire, Department of Computer Science %D JAN 1985 %K AI08 AI02 %A Helen M. Gigley %T Grammar Viewed as a Functioning Part of a Cognitive System %R 85-25 %I University of New Hampshire, Department of Computer Science %D JAN 1985 %K AI02 AI08 %A Helen M. Gigley %T Computational Neurolinguistic Modelling Integrating 'Natural Computation' Control with Performance Defined Representatives %R 85-26 %I University of New Hampshire, Department of Computer Science %D SEP 1985 %K AI02 AI08 HOPE %A Michael J. Quinn %A Narsingh Deo %T An Upper Bound for the Speedup of Parallel Best-Bound Branch-and-Bound Algorithms %R 85-27 %I University of New Hampshire, Department of Computer Science %D SEP 1985 %K AI03 H03 %A Helen M. Gigley %T Studies in Artificial Aphasia - Experiments in Processing Change %R 85-28 %I University of New Hampshire, Department of Computer Science %D OCT 1985 %K AI08 AA11 AI02 %A Bruce Barker %T An Abstract Prolog Machine %R 85-29 %I University of New Hampshire, Department of Computer Science %D DEC 1985 %K H02 T02 Warren %A Henk J. Haarmann %A Helen M. Gigley %T Neural-like Modelling of Synchronization Deficits in Aphasic Comprehension %R 86-32 %I University of New Hampshire, Department of Computer Science %D MAR 1986 %K AI02 AA11 AI08 %A Eugene C. Freuder %T Applying Constraint Satisfaction Search Techniques to Concept Learning %R 86-33 %I University of New Hampshire, Department of Computer Science %D MAR 1986 %K AI03 AI04 %A Brian Otis %A Eugene C. Freuder %T Subdivision of Knowledge for Igneous Rock Identifications %R 86-35 %I University of New Hampshire, Department of Computer Science %D APR 1986 %K AI01 AA03 %A Sylvia Weber Russell %R 86-36 %T A Perspective from Computer Analysis %I University of New Hampshire, Department of Computer Science %D APR 1986 %K metaphor AI02 %A Helen M. Gigley %R 86-36 %T Lexical Ambiguity Resolution in Aphasia %I University of New Hampshire, Department of Computer Science %D MAY 1986 %K AA11 AI02 %A Helen M. Gigley %T Sentence Comprehension Processing - A Serial ORder, Time-Synchronous Process %R 86-39 %I University of New Hampshire, Department of Computer Science %D APR 1986 %K AI02 HOPE %A Michael J. Quinn %T Implementing Best-First Branch-And-Bound Algorithms on Hypercube Multiprocessors %R PCL 86-02 %I University of New Hampshire, Parallel Computing Laboratory, Department of Computer Science %D SEP 1986 %K AI02 H03 %A Saul Gorn %T Who Can Be Replaced by A Computer %R MS-CIS-85-04 %I University of Pennsylvania %K O05 %A Saul Gorn %T Self-Annihilating Sentences: Saul Gorn's Compendium of Rarely Used Cliches %R MS-CIS-85-03 %I University of Pennsylvania %K AI02 %A Robert Ruminoff %T Explaining Concepts in Expert Systems: The Clear System %R MS-CIS-85-06 %I University of Pennsylvania %K O01 AI01 %A Vijay-Shankar %A Aravind Joshi %T Some Computational Properties of Tree Adjoining Grammars %R MS-CIS-85-07 %I University of Pennsylvania %K AI02 %A D. Smitley %A S. M. Goldwasser %A I. Lee %T IPON - Advanced Architectural Framework for Image %R MS-CIS-85-13 %I University of Pennsylvania %K AI06 H03 MIMD %A Eric P. Krotkov %T Results in Finding Edges and Corners in Images Using the First Directional Derivative %R MS-CIS-85-14 %I University of Pennsylvania %K AI06 %A Anthony S. Kroch %A Aravand K. Joshi %T The Linguistic Relevance of Tree Adjoining Grammars %R MS-CIS-85-16 %I University of Pennsylvania %K AI02 %A Dale A. Miller %A Gopalan Nadathur %T A Computational Logic Approach to Syntax and Semantics %R MS-CIS-85-17 %I University of Pennsylvania %K AI10 AI11 %A Paul A. Fishwick %T Hierarchical Reasoning: Simulating Complex Processes over Multiple Levels of Abstraction [Dissertation Exam Version] %R MS-CIS-85-21 %I University of Pennsylvania %K simulation %A Aravind K. Joshi %T Tree Adjoining Grammars: How Much Context-Sensitivity is Required to Provide Reasonable Structural Descriptions %R MS-CIS-85-23 %I University of Pennsylvania %K AI02 %A David Smiley %T The Design and Analysis of a Stereo Vision Algorithm %R MS-CIS-85-27 %I University of Pennsylvania %K AI06 %A Peter Allen %A Ruzena Bajcsy %T Two Sensors Are Better Than One: Examples of Integration of Vision and Touch %R MS-CIS-85-29 %I University of Pennsylvania %K AI06 AI07 %A Samuel Goldwasser %A Ruzena Bacsy %T A Distributed Active Sensor Processor System %R MS-CIS-85-30 %I University of Pennsylvania %K AI06 AI07 AI01 %A Franc Solina %T Errors in Stereo Due to Quantization %R MS-CIS-85-34 %I University of Pennsylvania %K AI06 %A David A. Klein %T An Expert Systems Approach to Realtime, Active Management of a Target Resource %R MS-CIS-85-40 %I University of Pennsylvania %K AI01 AA08 YES/MVS IBM O03 %X (describes part of a system for monitoring IBM systems) %A Robin F. Karlin %T Romper Mumble %R MS-CIS-85-41 %I University of Pennsylvania %K text generation %A Brant A. Cheikes %T Monitor Offers an a Dynamic Database [sic]: The Search for Relevance %R MS-CIS-85-43 %I University of Pennsylvania %K AA09 %A Aravind K. Joshi %T Grammar, Phrase Structure %R MS-CIS-85-45 %I University of Pennsylvania %K AI02 %A Ethel Shuster %T Code Switching in Yiddish and Spanish: Evidence for the Translation Model %R MS-CIS-85-49 %I University of Pennsylvania %K AI02 AI08 %X discusses second-language acquisition %A Bonnie Lynn Webber %T Question, Answer and Responses: Interacting with Knowledge Base Systems %R MS-CIS-85-50 %I University of Pennsylvania %K O01 %A Paul A. Fishwick %T Hires: Hierarchical Reasoning System %R MS-CIS-85-52 %I University of Pennsylvania %K simulation %X manual for system %A A. Zwarico %A I. Lee %T Proving a Network of Real-Time Processes Correct %R MS-CIS-85-53 %I University of Pennsylvania %K AA08 %A Ruzena Bajcsy %T Active Perception vs. Passive Perception %R MS-CIS-85-54 %I University of Pennsylvania %K AI06 AI16 %X getting a system to "look" as opposed to just "see." %A Greogry Donald Hager %T Computational Aspects of Proofs in Modal Logic %R MS-CIS-85-55 %I University of Pennsylvania %K AI10 %A Kathleen Filliben McCoy %T Correcting Object-Related Misconceptions %R MS-CIS-85-57 %I University of Pennsylvania %K AI08 AI01 %X discusses how human experts correct misconceptions as they use the ROMPER system %A Peter Kirby Allen %T Object Recognition Using Vision %R MS-CIS-85-60 %I University of Pennsylvania %K AI06 AI07 %X includes discussion of the use of vision and exploratory tactile sensing in object recognition %A Aravind K. Joshi %A K. Vijay-Shanker %A David J. Weir %R MS-CIS-86-01 %T The Relationship Between Tree Adjoining Grammars and Head Grammars %I University of Pennsylvania %K AI02 %A Hossam A. Elgindy %T Efficient Algorithms for Computing the Weak Visibility Polygon from an Edge %I University of Pennsylvania %R MS-CIS-86-04 %K O06 %A Jean H. Gallier %T A Fast Algorithm for Testing Unsatisfiability of Ground Horn Clauses with Equations %I University of Pennsylvania %R MS-CIS-86-06 %K AI10 %A Richard Paul %A Hugh F. Durrant-Whyte %A Max Mintz %T A Robust, Distributed Sensor and Actuation Robot Control System %I University of Pennsylvania %R MS-CIS-86-07 %K AI06 AI07 %X proposal for a blackboard based robot system %A Hugh F. Durrant-Whyte %T Consistent Integration and Propagation of Disparate Sensor Observations %I University of Pennsylvania %R MS-CIS-86-08 %K AI07 AI06 %A Eric P. Krotkov %A Jean-Paul Maritan %T Range From Focus %I University of Pennsylvania %R MS-CIS-86-09 %K AI07 AI06 %A Jean H. Gallier %A Stan Raatz %T Hornlog: A Graph Based Interpreter for General Horn Clauses %I University of Pennsylvania %R MS-CIS-86-10 %K AI10 %A Stan Raatz %A George Drastal %T Relating Expert System Rule Interactions to Norms of Rule-based Programming %I University of Pennsylvania %R MS-CIS-86-12 %K AI01 %A Ruzena Bajcsy %A Max Mintz %A Erica Liebman %T A Common Framework for Edge Detection and Region Growing %I University of Pennsylvania %R MS-CIS-86-13 %K AI06 %A Fil Fuma %A Erick Krotkov %A John Summers %T The Pennsylvania Active Camera System %I University of Pennsylvania %R MS-CIS-86-15 %K AI06 %A Tim Finin %A Aravind K. Joshi %A Bonnie Lynn Webber %T Natural Language Interactions with Artificial Experts %I University of Pennsylvania %R MS-CIS-86-16 %K AI01 AI02 O01 %A Dale A. Miller %A Gopalan Nadathur %T Higher-Order Logic Programming %I University of Pennsylvania %R MS-CIS-86-17 %K AI10 T02 %A Eric Krotkov %T Focusing %I University of Pennsylvania %R MS-CIS-86-22 %K AI06 %X automatic focusing of a computer controlled camera %A Rusena Bajcsy %A Eric Krotkov %A Max Mintz %T Models of Errors and Mistakes in Machine Perception %I University of Pennsylvania %R MS-CIS-86-26 %K AI06 stereo %A Aravind K. Joshi %A Bonnie L. Webber %A Ralph M. Weischedel %T Some Aspects of Default Reasoning in Interactive Discourse %I University of Pennsylvania %R MS-CIS-86-27 %K AI02 %A Yuen-Wah Eva Ma %A Ramesh Krishnamurti %A Bhagirath Narahari %A Dennis G. Shea %A Kwang-shi Shu %T High Performance Special-Purpose Computer Architectures for Robotics Applications %I University of Pennsylvania %R MS-CIS-86-28 %K H03 AI06 AI07 %A Dale A. Miller %A Gopalan Nadathur %T Some Uses of Higher Order Logic in Computational Linguistics %I University of Pennsylvania %R MS-CIS-86-31 %K AI10 AI02 %A Robert Rubinoff %T Adapting Mumble: Experience with Natural Language Generation %I University of Pennsylvania %R MS-CIS-86-32 %K text generation %K AI10 T02 %A Ethel Schuster %T Towards a Computational Model of Anaphora in Discourse: References to Events and Actions %R MS-CIS-86-34 %I University of Pennsylvania %K AI02 %A Tim Finin %A David Drager %T $GUMS sub 1$: A General User Modeling System %R MS-CIS-86-35 %I University of Pennsylvania %K AI08 O01 AA15 %A Robert Kass %A Ron Katriel %A Tim Finin %T Breaking the Primitive Concept Barrier %R MS-CIS-86-36 %I University of Pennsylvania %K AI16 KL-ONE %X describes extensions to KL-ONE %A Anthony S. Kroch %A Aravind K. Joshi %T Analyzing Extraposition in A Tree Adjoining Grammar %R MS-CIS-86-37 %I University of Pennsylvania %K AI02 %A Martha Elizabeth Pollack %T Inferring Domain Plans in Question-Answering %R MS-CIS-86-40 %I University of Pennsylvania %K AI08 O01 %A Brant A. Cheikes %T Research in Artificial Intelligence at the University of Pennsylvania %R MS-CIS-86-41 %I University of Pennsylvania %K AT09 AI16 %A Susan B. Davidson %A Mark M. Winkler %T Conflict Resolution in Class Conflict Graph Analysis %R MS-CIS-86-43 %I University of Pennsylvania %K conflict resolution AI16 %A Jean H. Gallier %A Stan Raatz %T Extending SLD-Resolution to Equational Horn Clauses Using E-Unification %I University of Pennsylvania %R MS-CIS-86-44 %K AI10 %A Dale Miller %A Amy Felty %T An Integration of Resolution and Natural Deduction Theorem Proving %I University of Pennsylvania %R MS-CIS-86-47 %K AI11 %A Sharon A. Stansfield %T A Rudimentary Active Multimodal, Intelligent System for Object Categorization %I University of Pennsylvania %R MS-CIS-86-48 %K AI06 %A Mark Turner %T Texture Discrimination by Gabor Functions %I University of Pennsylvania %R MS-CIS-86-51 %K AI06 %A Megumi Kameyama %T A Property-Sharing Constraint in Centering %I University of Pennsylvania %R MS-CIS-86-52 %K AI02 pronoun resolution %A Dale Miller %T A Theory of Modules for Logic Programming %I University of Pennsylvania %R MS-CIS-86-53 %K AI10 %A Claire Socolovsky Caine %T An Expert System for Marine Umbrella Liability Insurance Underwriting %I University of Pennsylvania %R MS-CIS-86-54 %K AA06 %A Gerald P. Stoloff %T Lanpick -- An Expert System for Recommendation of Local Area Network Hardware and Software Products %I University of Pennsylvania %R MS-CIS-86-55 %K AA08 %A Franc Solina %T Object Recognition Using Function Based Category Models %I University of Pennsylvania %R MS-CIS-86-56 %K AI06 %A Robert Kaas %T The Role of User Modelling in Intelligent Tutoring System %I University of Pennsylvania %R MS-CIS-86-58 %K AA07 AI08 %A Jean H. Gallier %A Stan Raatz %T Refutation Methods for Horn Clauses with Equality Based on Unification %I University of Pennsylvania %R MS-CIS-86-59 %K AI10 %A Megumi Kameyama %T Japanese Zero Pronominal Bindings: Where Syntax and Discourse Meet %I University of Pennsylvania %R MS-CIS-86-60 %K AI02 %A Robert Kaas %A Tim Finin %T The Role of User Models in Question Answering Systems %I University of Pennsylvania %R MS-CIS-86-63 %K AI01 AI08 personal investment AA06 %A Aravind K. Joshi %T An Introduction to Tree Adjoining Grammars %I University of Pennsylvania %R MS-CIS-86-64 %K AI06 AT08 %A Alex Pelin %A Jean Gallier %T Solving Word Problems in Free Algebras Using Complexity Functions %I University of Pennsylvania %R MS-CIS-86-65 %K AI11 %A Jugal Kalita %A Sunish Shende %T Generation of Natural Language Text Describing a System of Asynchronous, Concurrent Processes %I University of Pennsylvania %R MS-CIS-86-66 %A Hugh F. Durrant-Whyte %T Integration, Coordination and Control of Multi-Sensor Robot Systems %I University of Pennsylvania %R MS-CIS-86-67 %K AI06 AI07 blackboard AI01 %A Greg Hager %A Hugh F. Durrant-Whyte %T Information and Multi-Sensor Coordination %I University of Pennsylvania %R MS-CIS-86-68 %K AI07 AI06 H03 %A Tim Finin %T NFL- A Novices Frame Language %I University of Pennsylvania %R MS-CIS-86-71 %K AT18 T01 T03 %A Bonnie Lynn Webber %T Two Steps Closer to Event Reference %I University of Pennsylvania %R MS-CIS-86-74 %K AI02 AI16 %A Greg Hagar %T Active Reduction of Uncertainty in Multi-Sensor Systems %I University of Pennsylvania %R MS-CIS-86-76 %K H03 O04 %A Lokendra Shastri %T Massive Parallelism in Artificial Intelligence %I University of Pennsylvania %R MS-CIS-86-77 %K H03 %A Lokendra Shastri %A Raymond L. Wairous %T Learned Phonetic Discrimination Using Connectionistic Networks %I University of Pennsylvania %R MS-CIS-86-78 %K H03 AI05 %A Linda Ness %T Reducing Linear Recursion to Transitive Closure %I University of Texas at Austin, Department of Computer Sciences %R TR-86-25 %K AA09 AI10 %D NOV 1986 %X shows how to deal with a recursively expressed logic program that is designed to query a database %A David A. Schmidt %A Jacek Leszczylowski %T On Developing a Logic for Program Derivation and Verification %I Iowa State University Computer Science Department %R TR#86-16 %D NOV 1986 %K AA08 AI10 intuitionistic type theory predicate calculus %A James M. Bieman %A Albert L. Baker %A Paul M. Clites %A David A. Gustafson %A Austin C. Melton %T A Standard Representation of Imperative Language Programs %I Iowa Sate University Computer Science Department %R TR #86-17 %D NOV 1986 %K AA08 %A Ken-Chih Liu %A Rajshekhar Sunderraman %T Applying an Extended Relational Model to Indefinite Deductive Databases %I Iowa State University Computer Science Department %R TR #86-18 %D NOV 1986 %K AI10 AA09 %A Jacek Leszczylowski %A Jan Maluszynski %T Logic Programming with External Procedures: Introducing S-Unification %I Iowa State University Computer Science Department %R TR #86-21 %D DEC 1986 %K AI10 %A Chen %A Chi %A Ost %A Sabbaugh %A Spring %T Scheme Graphics Reference Manual %I Indiana University Computer Science Department %R TR 144 %D 1984 %K T01 %A Daniel P. Friedman %A Pee-Hong Chen %T Prototyping Data Flow by Translation Into Scheme %I Indiana University Computer Science Department %R TR 147 %D 1983 %K T01 %A Mitchell Wand %T A Semantic Algebra for Logic Programming %I Indiana University Computer Science Department %R TR 148 %D August 1983 %K AI10 %A Kent Dybvig %T C-Scheme Reference Manual %I Indiana University Computer Science Department %R TR 149 %D SEP 1983 %K T01 %A J. Barnden %T On Short-Term Information-Processing in Connectionist Theories %I Indiana University Computer Science Department %R TR 152 %D JAN 1984 %K H03 %A D. Friedman %A C. Hayes %A E. Kohlbecker %A M. Wand %T Scheme 84 Interim Reference Manual %R TR 153 %D JUN 1985 %I Indiana University Computer Science Department %K T01 %A E. Kohlbecker %T eu-Prolog: Reference Manual and Report %R TR 155 %D APR 1984 %I Indiana University Computer Science Department %K T02 %A C. D. Halpern %T An Implementation of 2-Lisp %R TR 160 %D JUN 1984 %I Indiana University Computer Science Department %K T01 %A L. D. Sabbagh %T Scheme as an Interactive Graphics Programming Environment %R TR 166 %D FEB 1985 %I Indiana University Computer Science Department %K T01 %A J. A. Barnden %T Representations of Intensions, Representations as Intensions, and Propositional Attitudes %R TR 172 %D JUN 1985 %I Indiana University Computer Science Department %K AI02 AI16 %A Johnathan Rees %A W. D. Clinger %T Revised Report on Scheme %R TR 174 %D AUG 1986 %I Indiana University Computer Science Department %K AI06 %$ 6.00 %A M. W. Lugowski %T Why Artificial Intelligence is Necessarily Ad Hoc: One's Thinking/Approach/ Model/Solution Rides on One's Metaphors %R TR 176 %D AUG 1985 %I Indiana University Computer Science Department %K AI16 %$ 2.00 %A S. C. Kwasny %A J. Dalby %A R. Port %T Rules for Automatic Mapping Between Fast and Slow Speech %R TR 175 %D JUL 1985 %I Indiana University Computer Science Department %K AI05 %A Matthias Felleisen %T Transliterating Prolog into Scheme %R TR 182 %D OCT 1985 %I Indiana University Computer Science Department %K T01 T02 %A Christopher T. Haynes %T Logic Continuations %R TR 183 %D NOV 1985 %I Indiana University Computer Science Department %K AI10 %A John A. Barnden %T Imputations and Explications: Representational Problems in Treatments of Propositional Attitudes %R TR 187 %D JAN 1986 %I Indiana University Computer Science Department %K AI16 %A Erich J. Smythe %T The Pleasures of SINN: A System for Programming Connectionist Models %R TR189 %D FEB 1986 %I Indiana University Computer Science Department %K FEB 1986 %A Matthias Felleisen %A Daniel P. Friedman %T Control Operators, the SECD-Machine and the $lambda$-calculus %R TR 197 %D JUN 1986 %I Indiana University Computer Science Department %K T01 %A Eugene E. Kohlbecker %T Syntactic Extensions in the Programming Language Lisp %R TR 199 %D AUG 1986 %I Indiana University Computer Science Department %K T01 %$ 12.00 (Ph. D. Dissertation) %A Matthias Felleisen %T A Final Scheme-Word on Landin's J-Operator %R TR 205 %D NOV 1986 %I Indiana University Computer Science Department %K T01 %A Bipin Indurykha %T Analogies and Metaphors: An Interdisciplinary Perspective %R BUCS Tech Report #86-012 %D DEC 1986 %I Boston University Department of Computer Science %K AI08 AI16 AI02 %A Michael Siegel %T Automatic Rule Derivation for Semantic Query Optimization %R BUCS Tech Report #86-013 %D DEC 1986 %I Boston University Computer Science Department %K AA09 AI01 %A Leonard Uhr %T Toward a Computational Information-Processing Model of Object Perception %I University of Wisconsin-Madison, Computer Sciences Department %R TR651 %D JUL 1986 %K AI08 AI06 %X describes what is known and is necessary for development of a model of visual perception in humans as well as those points of information that are lacking. %A Matthew J. Thazhuthaveetil %T A Structured Memory Access Architecture for LISP %I University of Wisconsin-Madison, Computer Sciences Department %R TR658 %D AUG 1986 %K H02 T01 %A Udi Manber %T Using Mathematical Induction to Design Computer Algorithms %I University of Wisconsin-Madison, Computer Sciences Department %R TR660 %D AUG 1986 %K AA08 AI11 %A M. A. Sridhar %T Efficient Algorithms for Multiple Pattern Matching %I University of Wisconsin-Madison, Computer Sciences Department %R TR661 %D AUG 1986 %K O06 %A Charles V. Steward %A Charles R. Dyer %T A Scheduling Algorithm for the Pipelined Image-Processing Engine %I University of Wisconsin-Madison, Computer Sciences Department %R TR664 %D SEP 1986 %K AI06 H03 %A Nian Li %A Leonard Uhr %T Comparative Timings for a Neuron Recognition Program on Serial and Pyramid Computers %I University of Wisconsin-Madison, Computer Sciences Department %R TR665 %D SEP 1986 %K AA10 AI06 H03 %X a system to recognize neurons in photomicrographs %A Gilbert Verghese %A Shekhar Mehta %A Charles R. Dyer %T Image Processing Algorithms for the Pipelined Image-Processing Engine %I University of Wisconsin-Madison, Computer Sciences Department %R TR668 %D SEP 1986 %K local peak detection median filtering thinning Hough transform photometric stereo AI06 O06 H03 %A Mitali Bhattacharyya %A David Cohrs %A Barton Miller %T Implementation of a Visual UNIX Process Connector %I University of Wisconsin-Madison, Computer Sciences Department %R TR677 %D DEC 1986 %X An environment for connecting several UNIX processes. Not specifically AI related %A Ze-Nian Li %A Leonard Uhr %T Pyramid Vision Using Key Features to Integrate Image-Driven Bottom-Up and Model-Driven Top Down Processes %I University of Wisconsin-Madison, Computer Sciences Department %D DEC 1986 %R TR678 %K H03 AI06 %A Charles R. Dyer %T Multiscale Image Understanding %I University of Wisconsin-Madison, Computer Sciences Department %R TR679 %D DEC 1986 %K texture AI06 %A G. T. Toussaint %T Computational Geometry and Morphology %I McGill University, School of Computer Science %R TR-SOCS-86.3 %D FEB 1986 %K AA10 AI06 O06 %X applications of such algorithms as hulls, medial axis, geodesic and visibility for polygons to understanding biological shape and shape change. %A R. De Mori %A L. Lam %A M. Gilloux %T Learning and Plan Refinement in a Knowledge-Based System for Automatic Speech Recognition %R TR-SOCS-86.14 %I McGill University, School of Computer Science %D MAY 1986 %K AI09 AI04 AI05 %X experimental work on recognition of connected letters by 100 speakers %A Heedong Ko %A Kunwoo Lee %T Toward a Practical Planning System for Assembly Tasks %R Department of Computer Science File 957 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AA26 %A Carl Thomas Uhrik %T A Rule Exerciser for Knowledge Base Enhancement in Expert Systems %R Department of Computer Science File 969 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AI01 O04 AA23 AA10 %X The system has been applied to soybean diagnosis and monkey behavior discrimination %A Kenneth D. Forbus %A Dedre Gentner %T Learning Physical Domains: Toward a Theoretical Framework %R Department of Computer Science File 1247 %I University of Illinois at Urbana-Champaign %D DEC 1986 %K AI08 AI04 %A Steven Greenbaum %T Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic %R Department of Computer Science File 1298 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AI11 %X the aim is opposed to solve small sized problem with little or no human guidance as opposed to other systems which are designed to solve large problems with human guidance. Uses priority-based search strategy, discrimination networks and Knuth-Bendix method %A Brian Falkenhainer %T An Examination of the Third State in the Analogy Process: Verification- Based Analogical Learning %R Department of Computer Science File 1302 %I University of Illinois at Urbana-Champaign %D OCT 1986 %K AI04 qualitative models liquid flow and heat flow %A Y-L. Steve %A Daniel D. Gajski %T LES: A Layout Expert System %R Department of Computer Science File 1308 %I University of Illinois at Urbana-Champaign %D NOV 1986 %K AA04 %X A layout system that is competitive with human designers %A Krish Purswani %A Larry Rendell %T A Probabilistic Reasoning-Based Approach to Machine Learning %R Department of Computer Science File 1311 %I University of Illinois at Urbana-Champaign %D DEC 1986 %K AI03 O04 %A Yoram Ofer Moses %T Knowledge in a Distributed Environment %D MAR 1986 %R STAN-CS-86-1120 %I Stanford University Computer Science %K H03 %X Discusses the effects of unreliable communications on coordination of an expert system, the Byzantine agreement problem and the "cheating wives" puzzle .br br 15.00 104 pages %A Glenn Douglas Rennels %T A Computational Model of Reasoning from the Clinical Literature %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1122 %K AA01 AI01 %X discusses getting information from the clinical literature into an AI system for patient care. Example problem is "breast cancer management options." .br br 244 pages 15.00 %A H. Penny Nii %T Blackboard Systems %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1123 %X general review of black board systems .br br 86 pages, 10.00 %A Daniel J. Scales %T Efficient Matching Algorithms for the SOAR/OPS5 Production System %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1124 %K T03 AI01 %X 50 pages 10.00 %A Eric Schoen %T The CAOS System %D MAR 1986 %I Stanford University Computer Science %R STAN-CS-86-1125 %K H03 O03 %X a real time Lisp distributed system for signal interpretations .br br 69 pages 10.00 %A Byron Davies %T CAREL: A Visible Distributed Lisp %D MAR 1986 %R STAN-CS-86-1126 %I Stanford University Computer Science %K H02 H03 T01 %X A system programming language that runs on the TI Explorer that includes real time display of the processor activity and data communications; useful as an educational tool .br br 15 pages 5.00 %A Yonathan Malachi %T A Timely Resolution %D MAR 1986 %R STAN-CS-86-1127 %I Stanford University Computer Science %K AI11 AI10 T01 T02 H03 TABLOG unification %X 15.00 145 pages %A Evan R. Cohn %A Ramsey W. Haddad %T Beta Operations: Efficient Implementation of a Primitive Parallel Operation %D AUG 1986 %R STAN-CS-86-1129 %I Stanford University Computer Science %K H03 %X The Beta Operation can be performed in O(log N + log **2 M) time on a hypercube where N is the size of the input and M is the size of the output. .br br 5.00, 18 pages %A Vishvjit S. Nalwa %A Thomas O. Binford %T On Detecting Edges %R STAN-CS-86-1130 %D MAR 1986 %I Stanford University Computer Science %K AI06 %X Proposed method will localize edges to within a thilrd of a pixel if step-size over noise ratio > 2.5 .br br 50 pages 10.00 %A Yehoshua Sagiv %T Optimizing Datalog Programs %R STAN-CS-86-1132 %D MAR 1986 %I Stanford University Computer Science %K AI10 %X Prolog programs without function symbols are optimized. Also defines a new form of equivalence under which such programs can be compared. .br br 30 pages, 50.00 %A Richard James Treitel %T Sequentialization of Logic Programs %R STAN-CS-86-1135 %D NOV 1986 %I Stanford University Computer Science %K AI10 %X 16 pages 15.00 %A Harold Brown %A Erich Schoen %A Bruce Delogi %T An Experiment in Knowledge-based Signal Understanding Using Parallel Architectures %R STAN-CS-86-1136 %D OCT 1986 %I Stanford University Computer Science %K H03 AA18 T01 %X System was tested on radar emissions from air craft .br br 36 pages 5.00 Received: From YUYETTI(PETER) by YUSOL with RSCS id 9389 for CS100006@YUSOL; Sun, 7 Jun 87 21:13 EDT Date: Sun, 7 Jun 87 21:05:34 edt From: peter@yuyetti.BITNET (Peter Roosen-Runge) To: cs100006@yusol.bitnet Relay-Version: version B 2.10.2 9/5/84; site yetti.UUCP Path: yetti!mnetor!utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!SMUVM1.BITNET!E From: E1AR0002@SMUVM1.BITNET.UUCP Newsgroups: comp.ai.digest Subject: ai.bib49TR Message-ID: <8706021534.AA00874@ucbvax.Berkeley.EDU> Date: 31 May 87 20:56:00 GMT Date-Received: 4 Jun 87 23:20:19 GMT Sender: daemon@ucbvax.BERKELEY.EDU Distribution: world Organization: The ARPA Internet Lines: 795 Approved: ailist@stripe.sri.com %A Fil Fuma %A Erick Krotkov %A John Summers %T The Pennsylvania Active Camera System %I University of Pennsylvania %R MS-CIS-86-15 %K AI06 %A Tim Finin %A Aravind K. Joshi %A Bonnie Lynn Webber %T Natural Language Interactions with Artificial Experts %I University of Pennsylvania %R MS-CIS-86-16 %K AI01 AI02 O01 %A Dale A. Miller %A Gopalan Nadathur %T Higher-Order Logic Programming %I University of Pennsylvania %R MS-CIS-86-17 %K AI10 T02 %A Eric Krotkov %T Focusing %I University of Pennsylvania %R MS-CIS-86-22 %K AI06 %X automatic focusing of a computer controlled camera %A Rusena Bajcsy %A Eric Krotkov %A Max Mintz %T Models of Errors and Mistakes in Machine Perception %I University of Pennsylvania %R MS-CIS-86-26 %K AI06 stereo %A Aravind K. Joshi %A Bonnie L. Webber %A Ralph M. Weischedel %T Some Aspects of Default Reasoning in Interactive Discourse %I University of Pennsylvania %R MS-CIS-86-27 %K AI02 %A Yuen-Wah Eva Ma %A Ramesh Krishnamurti %A Bhagirath Narahari %A Dennis G. Shea %A Kwang-shi Shu %T High Performance Special-Purpose Computer Architectures for Robotics Applications %I University of Pennsylvania %R MS-CIS-86-28 %K H03 AI06 AI07 %A Dale A. Miller %A Gopalan Nadathur %T Some Uses of Higher Order Logic in Computational Linguistics %I University of Pennsylvania %R MS-CIS-86-31 %K AI10 AI02 %A Robert Rubinoff %T Adapting Mumble: Experience with Natural Language Generation %I University of Pennsylvania %R MS-CIS-86-32 %K text generation %K AI10 T02 %A Ethel Schuster %T Towards a Computational Model of Anaphora in Discourse: References to Events and Actions %R MS-CIS-86-34 %I University of Pennsylvania %K AI02 %A Tim Finin %A David Drager %T $GUMS sub 1$: A General User Modeling System %R MS-CIS-86-35 %I University of Pennsylvania %K AI08 O01 AA15 %A Robert Kass %A Ron Katriel %A Tim Finin %T Breaking the Primitive Concept Barrier %R MS-CIS-86-36 %I University of Pennsylvania %K AI16 KL-ONE %X describes extensions to KL-ONE %A Anthony S. Kroch %A Aravind K. Joshi %T Analyzing Extraposition in A Tree Adjoining Grammar %R MS-CIS-86-37 %I University of Pennsylvania %K AI02 %A Martha Elizabeth Pollack %T Inferring Domain Plans in Question-Answering %R MS-CIS-86-40 %I University of Pennsylvania %K AI08 O01 %A Brant A. Cheikes %T Research in Artificial Intelligence at the University of Pennsylvania %R MS-CIS-86-41 %I University of Pennsylvania %K AT09 AI16 %A Susan B. Davidson %A Mark M. Winkler %T Conflict Resolution in Class Conflict Graph Analysis %R MS-CIS-86-43 %I University of Pennsylvania %K conflict resolution AI16 %A Jean H. Gallier %A Stan Raatz %T Extending SLD-Resolution to Equational Horn Clauses Using E-Unification %I University of Pennsylvania %R MS-CIS-86-44 %K AI10 %A Dale Miller %A Amy Felty %T An Integration of Resolution and Natural Deduction Theorem Proving %I University of Pennsylvania %R MS-CIS-86-47 %K AI11 %A Sharon A. Stansfield %T A Rudimentary Active Multimodal, Intelligent System for Object Categorization %I University of Pennsylvania %R MS-CIS-86-48 %K AI06 %A Mark Turner %T Texture Discrimination by Gabor Functions %I University of Pennsylvania %R MS-CIS-86-51 %K AI06 %A Megumi Kameyama %T A Property-Sharing Constraint in Centering %I University of Pennsylvania %R MS-CIS-86-52 %K AI02 pronoun resolution %A Dale Miller %T A Theory of Modules for Logic Programming %I University of Pennsylvania %R MS-CIS-86-53 %K AI10 %A Claire Socolovsky Caine %T An Expert System for Marine Umbrella Liability Insurance Underwriting %I University of Pennsylvania %R MS-CIS-86-54 %K AA06 %A Gerald P. Stoloff %T Lanpick -- An Expert System for Recommendation of Local Area Network Hardware and Software Products %I University of Pennsylvania %R MS-CIS-86-55 %K AA08 %A Franc Solina %T Object Recognition Using Function Based Category Models %I University of Pennsylvania %R MS-CIS-86-56 %K AI06 %A Robert Kaas %T The Role of User Modelling in Intelligent Tutoring System %I University of Pennsylvania %R MS-CIS-86-58 %K AA07 AI08 %A Jean H. Gallier %A Stan Raatz %T Refutation Methods for Horn Clauses with Equality Based on Unification %I University of Pennsylvania %R MS-CIS-86-59 %K AI10 %A Megumi Kameyama %T Japanese Zero Pronominal Bindings: Where Syntax and Discourse Meet %I University of Pennsylvania %R MS-CIS-86-60 %K AI02 %A Robert Kaas %A Tim Finin %T The Role of User Models in Question Answering Systems %I University of Pennsylvania %R MS-CIS-86-63 %K AI01 AI08 personal investment AA06 %A Aravind K. Joshi %T An Introduction to Tree Adjoining Grammars %I University of Pennsylvania %R MS-CIS-86-64 %K AI06 AT08 %A Alex Pelin %A Jean Gallier %T Solving Word Problems in Free Algebras Using Complexity Functions %I University of Pennsylvania %R MS-CIS-86-65 %K AI11 %A Jugal Kalita %A Sunish Shende %T Generation of Natural Language Text Describing a System of Asynchronous, Concurrent Processes %I University of Pennsylvania %R MS-CIS-86-66 %A Hugh F. Durrant-Whyte %T Integration, Coordination and Control of Multi-Sensor Robot Systems %I University of Pennsylvania %R MS-CIS-86-67 %K AI06 AI07 blackboard AI01 %A Greg Hager %A Hugh F. Durrant-Whyte %T Information and Multi-Sensor Coordination %I University of Pennsylvania %R MS-CIS-86-68 %K AI07 AI06 H03 %A Tim Finin %T NFL- A Novices Frame Language %I University of Pennsylvania %R MS-CIS-86-71 %K AT18 T01 T03 %A Bonnie Lynn Webber %T Two Steps Closer to Event Reference %I University of Pennsylvania %R MS-CIS-86-74 %K AI02 AI16 %A Greg Hagar %T Active Reduction of Uncertainty in Multi-Sensor Systems %I University of Pennsylvania %R MS-CIS-86-76 %K H03 O04 %A Lokendra Shastri %T Massive Parallelism in Artificial Intelligence %I University of Pennsylvania %R MS-CIS-86-77 %K H03 %A Lokendra Shastri %A Raymond L. Wairous %T Learned Phonetic Discrimination Using Connectionistic Networks %I University of Pennsylvania %R MS-CIS-86-78 %K H03 AI05 %A Linda Ness %T Reducing Linear Recursion to Transitive Closure %I University of Texas at Austin, Department of Computer Sciences %R TR-86-25 %K AA09 AI10 %D NOV 1986 %X shows how to deal with a recursively expressed logic program that is designed to query a database %A David A. Schmidt %A Jacek Leszczylowski %T On Developing a Logic for Program Derivation and Verification %I Iowa State University Computer Science Department %R TR#86-16 %D NOV 1986 %K AA08 AI10 intuitionistic type theory predicate calculus %A James M. Bieman %A Albert L. Baker %A Paul M. Clites %A David A. Gustafson %A Austin C. Melton %T A Standard Representation of Imperative Language Programs %I Iowa Sate University Computer Science Department %R TR #86-17 %D NOV 1986 %K AA08 %A Ken-Chih Liu %A Rajshekhar Sunderraman %T Applying an Extended Relational Model to Indefinite Deductive Databases %I Iowa State University Computer Science Department %R TR #86-18 %D NOV 1986 %K AI10 AA09 %A Jacek Leszczylowski %A Jan Maluszynski %T Logic Programming with External Procedures: Introducing S-Unification %I Iowa State University Computer Science Department %R TR #86-21 %D DEC 1986 %K AI10 %A Chen %A Chi %A Ost %A Sabbaugh %A Spring %T Scheme Graphics Reference Manual %I Indiana University Computer Science Department %R TR 144 %D 1984 %K T01 %A Daniel P. Friedman %A Pee-Hong Chen %T Prototyping Data Flow by Translation Into Scheme %I Indiana University Computer Science Department %R TR 147 %D 1983 %K T01 %A Mitchell Wand %T A Semantic Algebra for Logic Programming %I Indiana University Computer Science Department %R TR 148 %D August 1983 %K AI10 %A Kent Dybvig %T C-Scheme Reference Manual %I Indiana University Computer Science Department %R TR 149 %D SEP 1983 %K T01 %A J. Barnden %T On Short-Term Information-Processing in Connectionist Theories %I Indiana University Computer Science Department %R TR 152 %D JAN 1984 %K H03 %A D. Friedman %A C. Hayes %A E. Kohlbecker %A M. Wand %T Scheme 84 Interim Reference Manual %R TR 153 %D JUN 1985 %I Indiana University Computer Science Department %K T01 %A E. Kohlbecker %T eu-Prolog: Reference Manual and Report %R TR 155 %D APR 1984 %I Indiana University Computer Science Department %K T02 %A C. D. Halpern %T An Implementation of 2-Lisp %R TR 160 %D JUN 1984 %I Indiana University Computer Science Department %K T01 %A L. D. Sabbagh %T Scheme as an Interactive Graphics Programming Environment %R TR 166 %D FEB 1985 %I Indiana University Computer Science Department %K T01 %A J. A. Barnden %T Representations of Intensions, Representations as Intensions, and Propositional Attitudes %R TR 172 %D JUN 1985 %I Indiana University Computer Science Department %K AI02 AI16 %A Johnathan Rees %A W. D. Clinger %T Revised Report on Scheme %R TR 174 %D AUG 1986 %I Indiana University Computer Science Department %K AI06 %$ 6.00 %A M. W. Lugowski %T Why Artificial Intelligence is Necessarily Ad Hoc: One's Thinking/Approach/ Model/Solution Rides on One's Metaphors %R TR 176 %D AUG 1985 %I Indiana University Computer Science Department %K AI16 %$ 2.00 %A S. C. Kwasny %A J. Dalby %A R. Port %T Rules for Automatic Mapping Between Fast and Slow Speech %R TR 175 %D JUL 1985 %I Indiana University Computer Science Department %K AI05 %A Matthias Felleisen %T Transliterating Prolog into Scheme %R TR 182 %D OCT 1985 %I Indiana University Computer Science Department %K T01 T02 %A Christopher T. Haynes %T Logic Continuations %R TR 183 %D NOV 1985 %I Indiana University Computer Science Department %K AI10 %A John A. Barnden %T Imputations and Explications: Representational Problems in Treatments of Propositional Attitudes %R TR 187 %D JAN 1986 %I Indiana University Computer Science Department %K AI16 %A Erich J. Smythe %T The Pleasures of SINN: A System for Programming Connectionist Models %R TR189 %D FEB 1986 %I Indiana University Computer Science Department %K FEB 1986 %A Matthias Felleisen %A Daniel P. Friedman %T Control Operators, the SECD-Machine and the $lambda$-calculus %R TR 197 %D JUN 1986 %I Indiana University Computer Science Department %K T01 %A Eugene E. Kohlbecker %T Syntactic Extensions in the Programming Language Lisp %R TR 199 %D AUG 1986 %I Indiana University Computer Science Department %K T01 %$ 12.00 (Ph. D. Dissertation) %A Matthias Felleisen %T A Final Scheme-Word on Landin's J-Operator %R TR 205 %D NOV 1986 %I Indiana University Computer Science Department %K T01 %A Bipin Indurykha %T Analogies and Metaphors: An Interdisciplinary Perspective %R BUCS Tech Report #86-012 %D DEC 1986 %I Boston University Department of Computer Science %K AI08 AI16 AI02 %A Michael Siegel %T Automatic Rule Derivation for Semantic Query Optimization %R BUCS Tech Report #86-013 %D DEC 1986 %I Boston University Computer Science Department %K AA09 AI01 %A Leonard Uhr %T Toward a Computational Information-Processing Model of Object Perception %I University of Wisconsin-Madison, Computer Sciences Department %R TR651 %D JUL 1986 %K AI08 AI06 %X describes what is known and is necessary for development of a model of visual perception in humans as well as those points of information that are lacking. %A Matthew J. Thazhuthaveetil %T A Structured Memory Access Architecture for LISP %I University of Wisconsin-Madison, Computer Sciences Department %R TR658 %D AUG 1986 %K H02 T01 %A Udi Manber %T Using Mathematical Induction to Design Computer Algorithms %I University of Wisconsin-Madison, Computer Sciences Department %R TR660 %D AUG 1986 %K AA08 AI11 %A M. A. Sridhar %T Efficient Algorithms for Multiple Pattern Matching %I University of Wisconsin-Madison, Computer Sciences Department %R TR661 %D AUG 1986 %K O06 %A Charles V. Steward %A Charles R. Dyer %T A Scheduling Algorithm for the Pipelined Image-Processing Engine %I University of Wisconsin-Madison, Computer Sciences Department %R TR664 %D SEP 1986 %K AI06 H03 %A Nian Li %A Leonard Uhr %T Comparative Timings for a Neuron Recognition Program on Serial and Pyramid Computers %I University of Wisconsin-Madison, Computer Sciences Department %R TR665 %D SEP 1986 %K AA10 AI06 H03 %X a system to recognize neurons in photomicrographs %A Gilbert Verghese %A Shekhar Mehta %A Charles R. Dyer %T Image Processing Algorithms for the Pipelined Image-Processing Engine %I University of Wisconsin-Madison, Computer Sciences Department %R TR668 %D SEP 1986 %K local peak detection median filtering thinning Hough transform photometric stereo AI06 O06 H03 %A Mitali Bhattacharyya %A David Cohrs %A Barton Miller %T Implementation of a Visual UNIX Process Connector %I University of Wisconsin-Madison, Computer Sciences Department %R TR677 %D DEC 1986 %X An environment for connecting several UNIX processes. Not specifically AI related %A Ze-Nian Li %A Leonard Uhr %T Pyramid Vision Using Key Features to Integrate Image-Driven Bottom-Up and Model-Driven Top Down Processes %I University of Wisconsin-Madison, Computer Sciences Department %D DEC 1986 %R TR678 %K H03 AI06 %A Charles R. Dyer %T Multiscale Image Understanding %I University of Wisconsin-Madison, Computer Sciences Department %R TR679 %D DEC 1986 %K texture AI06 %A G. T. Toussaint %T Computational Geometry and Morphology %I McGill University, School of Computer Science %R TR-SOCS-86.3 %D FEB 1986 %K AA10 AI06 O06 %X applications of such algorithms as hulls, medial axis, geodesic and visibility for polygons to understanding biological shape and shape change. %A R. De Mori %A L. Lam %A M. Gilloux %T Learning and Plan Refinement in a Knowledge-Based System for Automatic Speech Recognition %R TR-SOCS-86.14 %I McGill University, School of Computer Science %D MAY 1986 %K AI09 AI04 AI05 %X experimental work on recognition of connected letters by 100 speakers %A Heedong Ko %A Kunwoo Lee %T Toward a Practical Planning System for Assembly Tasks %R Department of Computer Science File 957 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AA26 %A Carl Thomas Uhrik %T A Rule Exerciser for Knowledge Base Enhancement in Expert Systems %R Department of Computer Science File 969 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AI01 O04 AA23 AA10 %X The system has been applied to soybean diagnosis and monkey behavior discrimination %A Kenneth D. Forbus %A Dedre Gentner %T Learning Physical Domains: Toward a Theoretical Framework %R Department of Computer Science File 1247 %I University of Illinois at Urbana-Champaign %D DEC 1986 %K AI08 AI04 %A Steven Greenbaum %T Input Transformations and Resolution Implementation Techniques for Theorem Proving in First-Order Logic %R Department of Computer Science File 1298 %I University of Illinois at Urbana-Champaign %D SEP 1986 %K AI11 %X the aim is opposed to solve small sized problem with little or no human guidance as opposed to other systems which are designed to solve large problems with human guidance. Uses priority-based search strategy, discrimination networks and Knuth-Bendix method %A Brian Falkenhainer %T An Examination of the Third State in the Analogy Process: Verification- Based Analogical Learning %R Department of Computer Science File 1302 %I University of Illinois at Urbana-Champaign %D OCT 1986 %K AI04 qualitative models liquid flow and heat flow %A Y-L. Steve %A Daniel D. Gajski %T LES: A Layout Expert System %R Department of Computer Science File 1308 %I University of Illinois at Urbana-Champaign %D NOV 1986 %K AA04 %X A layout system that is competitive with human designers %A Krish Purswani %A Larry Rendell %T A Probabilistic Reasoning-Based Approach to Machine Learning %R Department of Computer Science File 1311 %I University of Illinois at Urbana-Champaign %D DEC 1986 %K AI03 O04 %A Yoram Ofer Moses %T Knowledge in a Distributed Environment %D MAR 1986 %R STAN-CS-86-1120 %I Stanford University Computer Science %K H03 %X Discusses the effects of unreliable communications on coordination of an expert system, the Byzantine agreement problem and the "cheating wives" puzzle .br br 15.00 104 pages %A Glenn Douglas Rennels %T A Computational Model of Reasoning from the Clinical Literature %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1122 %K AA01 AI01 %X discusses getting information from the clinical literature into an AI system for patient care. Example problem is "breast cancer management options." .br br 244 pages 15.00 %A H. Penny Nii %T Blackboard Systems %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1123 %X general review of black board systems .br br 86 pages, 10.00 %A Daniel J. Scales %T Efficient Matching Algorithms for the SOAR/OPS5 Production System %D JUN 1986 %I Stanford University Computer Science %R STAN-CS-86-1124 %K T03 AI01 %X 50 pages 10.00 %A Eric Schoen %T The CAOS System %D MAR 1986 %I Stanford University Computer Science %R STAN-CS-86-1125 %K H03 O03 %X a real time Lisp distributed system for signal interpretations .br br 69 pages 10.00 %A Byron Davies %T CAREL: A Visible Distributed Lisp %D MAR 1986 %R STAN-CS-86-1126 %I Stanford University Computer Science %K H02 H03 T01 %X A system programming language that runs on the TI Explorer that includes real time display of the processor activity and data communications; useful as an educational tool .br br 15 pages 5.00 %A Yonathan Malachi %T A Timely Resolution %D MAR 1986 %R STAN-CS-86-1127 %I Stanford University Computer Science %K AI11 AI10 T01 T02 H03 TABLOG unification %X 15.00 145 pages %A Evan R. Cohn %A Ramsey W. Haddad %T Beta Operations: Efficient Implementation of a Primitive Parallel Operation %D AUG 1986 %R STAN-CS-86-1129 %I Stanford University Computer Science %K H03 %X The Beta Operation can be performed in O(log N + log **2 M) time on a hypercube where N is the size of the input and M is the size of the output. .br br 5.00, 18 pages %A Vishvjit S. Nalwa %A Thomas O. Binford %T On Detecting Edges %R STAN-CS-86-1130 %D MAR 1986 %I Stanford University Computer Science %K AI06 %X Proposed method will localize edges to within a thilrd of a pixel if step-size over noise ratio > 2.5 .br br 50 pages 10.00 %A Yehoshua Sagiv %T Optimizing Datalog Programs %R STAN-CS-86-1132 %D MAR 1986 %I Stanford University Computer Science %K AI10 %X Prolog programs without function symbols are optimized. Also defines a new form of equivalence under which such programs can be compared. .br br 30 pages, 50.00 %A Richard James Treitel %T Sequentialization of Logic Programs %R STAN-CS-86-1135 %D NOV 1986 %I Stanford University Computer Science %K AI10 %X 16 pages 15.00 %A Harold Brown %A Erich Schoen %A Bruce Delogi %T An Experiment in Knowledge-based Signal Understanding Using Parallel Architectures %R STAN-CS-86-1136 %D OCT 1986 %I Stanford University Computer Science %K H03 AA18 T01 %X System was tested on radar emissions from air craft .br br 36 pages 5.00 Received: From YUYETTI(PETER) by YUSOL with RSCS id 9398 for CS100006@YUSOL; Sun, 7 Jun 87 21:15 EDT Date: Sun, 7 Jun 87 21:06:05 edt From: peter@yuyetti.BITNET (Peter Roosen-Runge) To: cs100006@yusol.bitnet Relay-Version: version B 2.10.2 9/5/84; site yetti.UUCP Path: yetti!mnetor!utzoo!utgpu!water!watmath!clyde!cbosgd!ucbvax!SMUVM1.BITNET!E From: E1AR0002@SMUVM1.BITNET.UUCP Newsgroups: comp.ai.digest Subject: ai.bib50TR Message-ID: <8706021719.AA02817@ucbvax.Berkeley.EDU> Date: 31 May 87 20:56:00 GMT Date-Received: 4 Jun 87 23:22:14 GMT Sender: daemon@ucbvax.BERKELEY.EDU Distribution: world Organization: The ARPA Internet Lines: 646 Approved: ailist@stripe.sri.com %A Ganesh C. Gopalakrishnan %A Mandayam K. Srivas %A David R. Smith %T Hierarchical Design of VLSI Systems Using Algebraic Specifications and Temporal Logic: On Automatic Synthesis of Controllers for VLSI Modules From Their Functional Specifications %I Department of Computer Science, SUNY at Stony Brook %D Jan 1986 %K AA04 AI11 %R TR 86/01 %A Sanjay Manchanda %A Suzanne Dietrich %T Storing and Accessing Relations on Disk in a Prolog Database System %I Department of Computer Science, SUNY at Stony Brook %D JAN 1986 %R TR 86/08 %K AA09 T02 %A Michael Kifer %A R. Lozinskii %T Framework for an Efficient Implementation of Deductive Databases %I Department of Computer Science, SUNY at Stony Brook %D FEB 1986 %R TR 86/04 %K AA09 %A Saumya K. Debray %T Mode Inference and Abstract Interpretation in Logic Programs %I Department of Computer Science, SUNY at Stony Brook %D FEB 1986 %R TR 86/05 %K AI11 %A Michael Kifer %A E. Lozinskii %T Can We Implement Logic as a Database System %I Department of Computer Science, SUNY at Stony Brook %D FEB 1986 %R TR 86/06 %K AI11 AA09 %A Ganesh C. Goplakrishnan %A David Smith %A Mandayam K. Srivas %T From Algebraic Specifications to Correct VLSI Circuits %I Department of Computer Science, SUNY at Stony Brook %D JUN 1986 %R 86/13 %K AA04 %A Saumya K. Debray %A Prateek Mishra %T Denotational and Operational Semantics for Prolog %I Department of Computer Science, SUNY at Stony Brook %D JUL 1986 %R 86/15 %K T02 AA08 %A Sanjay Manchanda %A David Scott Warren %T Toward a Logical Theory of Database Updates %I Department of Computer Science, SUNY at Stony Brook %D JUL 1986 %R 86/19 %K AI11 AA09 %A R. Ramesh %A R. M. Verma %A T. Krishnaprasad %A I. V. Ramakrishnan %T Term Matching on Parallel Computer %I Department of Computer Science, SUNY at Stony Brook %D AUG 1986 %R 86/20 %K AI11 H03 %A Sanjay Manchanda %A Soumitra Sengupta %A David Scott Warren %T Concurrent Updates in a Prolog Database Systems %I Department of Computer Science, SUNY at Stony Brook %D Dec 1986 %R 86/28 %K AA09 T02 %A Jieh Hsiang %A Michael Rusinowitch %T ON Word Problems in Equational Theories %I Department of Computer Science, SUNY at Stony Brook %D DEC 1986 %R 86/29 %K AI14 %A Anita Wasilewska %T Definable Sets in Knowledge Representation Systems %I Department of Computer Science, SUNY at Stony Brook %D DEC 1986 %R 86/31 %K AI16 %A Anita Wasilewski %T On Automatic Learning %I Department of Computer Science, SUNY at Stony Brook %D DEC 1986 %R 86/34 %K AI04 %A Chilukuri K. Mohan %A Mandayam K. Srivas %A Deepak Kapurm %T On Proofs in System of Equations and Inequations %I Department of Computer Science, SUNY at Stony Brook %D JAN 1987 %R 87/02 %K AI14 %A Alexander Waibel %T Prosody and Speech Recognition (Thesis) %I Carnegie Mellon Computer Sciences %R CMU-CS-86-162 %D 1986 %K AI05 %A Maurice P. Herlihy %A Jeannette M. Wing %T Axioms for Concurrent Objects %I Carnegie Mellon Computer Sciences %R CMU-CS-86-154 %D 1986 %K AA08 %A Michael C. Browne %T An Improved Algorithm for the Automatic Verification of Finite State Systems Using Temporal Logic %I Carnegie Mellon Computer Sciences %R CMU-CS-86-156 %D 1986 %K AA08 %A Andrew W. Appel %A Guy J. Jacobson %T The World's Fastest Scrabble Program %I Carnegie Mellon Computer Sciences %D 1986 %R CMU-CS-86-153 %K AA17 AI03 %A H. T. Kung %A Jon A. Webb %T Mapping Image Processing Operations onto a Linear Systolic Machine %I Carnegie Mellon Computer Sciences %D 1986 %R CMU-CS-86-137 %K H03 AI06 Warp FFT Hough Transform connected component labeling relaxation %A Katsushi Ikeuchi %T Generating an Interpretation Tree From a CAD Model to Represent Object Configurations for Bin-Picking Trees %I Carnegie Mellon Computer Sciences %D 1986 %R CMU-CS-86-144 %K AI07 AA26 %A P. Helman %A R. Veroff %T Designing Deductive Databases %I University of New Mexico Computer Sciences %D 1986 %R CS86-5 %K AA09 %A James R. Slagle %A Michael R. Wick %A Marius O. Poliac %T Agness: A Generalized Network-Based Expert System Shell %I University of Minnesota, Computer Science Department %R CSci TR86-48 %D 1986 %K T03 %A Valdis Berzins %A Jeff Petty %T The DB Lisp Code Analyzer %I University of Minnesota, Computer Science Department %R CSci TR 86-56 %D 1986 %K T01 %A Jik H. Chang %A Oscar H. Ibarra %A Ting-Chuen Pong %A Stephen M. Sohn %T Two-Dimensional Convolution on a Pyramid Computer %I University of Minnesota, Computer Science Department %R CSci TR87-1 %D 1987 %K AI06 H03 %A Ting-Chuen Pong %T Matching Topographic Structures in Stereo Vision %I University of Minnesota, Computer Science Department %R CSci TR87-2 %D 1987 %K AI06 %T Recent Developments in NIKL %A Thomas Kaczmarek %A Raymond Bates %A Gabriel Robins %R ISI/RS-86-167 %I USC/Information Sciences Institute %D November 1986 %K AI16 %X NIKL (a New Implementation of KL-ONE) is one of the members of the KL-ONE family of knowledge representation languages. NIKL has been in use for several years and our experiences have led us to define and implement various extensions to the language, its support environment and the implementation. Our experiences are particular to the use of NIKL. However, the requirements that we have discovered are relevant to any intelligent system that must reason about terminology. This article reports on the extensions that we have found necessary based on experiences in several different testbeds. The motivations for the extensions and future plans are also presented. %T A Logical-Form and Knowledge-Base Design for Natural Language Generation %A Norman Sondheimer %A Bernhard Nebel %R ISI/RS-86-169 %D November 1986 %I USC/Information Sciences Institute %K AI02 %X This paper presents a technique for interpreting output demands by a natural language sentence generator in a formally transparent and efficient way. These demands are stated in a logical language. A network knowledge base organizes the concepts of the application domain into categories known to the generator. The logical expressions are interpreted by the generator using the knowledge base and a restricted, but efficient, hybrid knowledge representation system. The success of this experiment has led to plans for the inclusion of this design in both the evolving Penman natural language generator and the Janus natural language interface. %T Rhetorical Structure Theory: Descripton and Construction of Text %A William C. Mann %A Sandra Thompson %R ISI/RS-86-174 %I USC/Information Sciences Institute %D October 1986 %X Rhetorical Structure Theory (RST) is a theory of text structure that is being extended to serve as a theoretical basis for computational text planning. Text structure in RST are hierarchic, built on small patterns called schemas. The schemas which compose the structural hierarchy of a text describe the functions of the parts rather than their form characteristics. Relations between text parts, comparable to conjunctive relations, are a prominent part of RST's definitional machinery. .sp sp Recent work on RST has put it onto a new definitional basis. This paper describes the current status of descriptive RST, along with efforts to create a constructive version for use as a basis for programming a text planner. %T Automatic Compilation of Logical Specifications into Efficient Programs %A Donald Cohen %R ISI/RS-86-175 %D November 1986 %I USC/Information Sciences Institute %K AA08 %X We describe an automatic programmer, or "compiler" which accepts as input a predicate calculus specification of a set to generate or a condition to test, along with a description of the underlying representation of the data. This compiler searches a space of possible algorithms for the one that is expected to be most efficient. We describe the knowledge that is and is not available to this compiler, and its corresponding capabilities and limitations. This compiler is now regularly used to produce large programs. %T Towards Explicit Integration of Knowledge in Expert Systems %A Jack Mostow %A Bill Swartout %R ISI/RS-86-176 %D November 1986 %I USC/Information Sciences Institute %K AI16 O04 AA01 AI01 %X The knowledge integration problem arises in rule-based expert systems when two or more recommendations made by right-hand sides of rules must be combined. Current expert systems address this problem either by engineering the rule set to avoid it, or by using a single integration technique built into the interpreter, e.g., certainty factor combination. We argue that multiple techniques are needed and that their use -- and underlying assumptions -- should be made explicit. We identify some of the techniques used in MYCIN's therapy selection algorithm to integrate the diverse goals it attempts to satisfy, and suggest how knowledge of such techniques could be used to support construction, explanation, and maintenance of expert systems. %A M. Fanty %T Context-free Parsing in Connectionist Networks %I University of Rochester Computer Science Department %D NOV 1985 %R TR 174 %K H03 O06 %X algorithm to convert any context-free grammar into a connectionist network .br br 30 pages $1.25 %A D. H. Ballard %T Interpolation Coding: A Representation for Numbers in Neural Nets %I University of Rochester Computer Science Department %D MAY 1986 %R TR 175 %K O04 H03 O06 %X also discusses a method of combining evidence in neural nets .br br 30 pages $1.25 %A J. Aloimonos %A A. Basu %T Determining the Translation of a Rigidly Moving Surface Without Correspondence %I University of Rochester Computer Science Department %D JAN 1986 %R TR176 %K AI06 %X deal withs three dimensional translation of a textured object and uses four cameras .br br 20 pages, $1.00 %A J. Aloimonos %A I. Rigoutsos %T Determining the Three-Dimensional Motion of a Surface Patch Without Correspondence, Under Perspective Projection: (i) Planar Surfaces (ii) Curved Surfaces %I University of Rochester Computer Science Department %D DEC 1985 %R TR 178 %K AI06 stereo 3-D %X 35 pages, $1.50 %A J. F. Allen %A P. J. Hayest %T A Common-Sense Theory of Time %I University of Rochester Computer Science Department %D FEB 1987 %R TR 180 %K AI16 %X 32 pages, $1.50 .br br .br br Includes discussion of an axiomatization of time subsuming Allen's interval-based theory. %A D. B. Sher %T Optimal Likelihood Generators for Edge Detection Under Gaussian Additive Noise %I University of Rochester Computer Science Department %D AUG 1986 %R TR 185 %K O04 AI06 %X 9 pages, $0.75 %A D. Baldwin %T A Model for Automatic Design of Digital Circuits %I University of Rochester Computer Science Department %D JUL 1986 %R TR 188 %K AA04 %X 25 pages $1.25 .br br discusses partitioning of design tasks into algorithmic and knowledge-based parts %A J. A. Feldman %T Neural Representation of Conceptual Knowledge %I University of Rochester Computer Science Department %D JUN 1986 %R TR 189 %K AI12 AI16 %X 35 pages, $1.50 .br br discusses holographic models %A R. P. Loui %T A Presumptive System of Defeasible Inference %I University of Rochester Computer Science Department %D MAY 1986 %R TR 190 %K AI15 %X 20 pages, $1.25 %A R. P. Loui %T Real Rules of Inference: Acceptance and Non-Monotonicity in AI %I University of Rochester Computer Science Department %D SUMMER 1986 %R TR 191 %K AI15 %X 59 pages $2.25 %A D. Sher %T Evidence Combination Using Likelihood Generators %I University of Rochester Computer Science Department %D JAN 1987 %R TR 192 %K O04 AI16 %X 27 pages, $1.25 %A A. Mukherjee %T Self-calibration Strategies for Robot Manipulators %I University of Rochester Computer Science Department %D SEP 1986 %R TR 193 %K AI07 %X 105 pages, $3.75, PH. D. Thesis %A L. Hartman %T Generating Motor Behavior %I University of Rochester Computer Science Department %D OCT 1986 %R TR 195 %K AI09 naive physics %X 31 pages $1.50 .br br planning in a block world under naive physics axiomitization %A S. Hollbach %T Tinker Toy Recognition From 2D Connectivity %I University of Rochester Computer Science Department %D OCT 1986 %R TR 196 %K AI06 %X 22 pages, $1.25 %A D. Sher %T Advanced Likelihood Generators for Boundary Detection %I University of Rochester Computer Science Department %D JAN 1987 %R TR 197 %K AI06 O04 %X 50 pages, $2.00 %A I. Rigoutsis %T Homotopies: A Panacea or Just Another Method? %I University of Rochester Computer Science Department %D DEC 1986 %R TR 201 %K AI06 O06 %X discusses applications of a method for solving non-linear equations and its applicability to computer vision. %A Marek W. Lugowski %T Computational Metabolism %I Indiana University Computer Science Department %R 200 %K AI16 AI08 AI06 AI04 dynamical locally-coupled bottom-up architecture %X A new architecture for programming of dynamical systems. It consists of a tessellation into processors which undergo pairwise swaps. Processors come in several types; each type recognizes certain other ones. Recognition events result either in processor state change or a 2-processor swap. Model combines cellular automaton and connectionist featrures with probabilistic computation. Intended application: representation and computation of metaphors. %A Jacek Leszczylowski %A David Schmidt %T A Logic for Program Derivation and Verification %R TR-CS-86-2 %I Kansas State University, Computing and Information Sciences Department %K AI10 AI11 AA08 %A J. R. B. Cockett %A J. Herrera %T Prime Rule Based Methodologies Give Inadequate Control %R CS-85-60 %I University of Tennessee - Knoxville, Computer Science Department %K AI01 AA09 %A Janusz Kacprzyk %A Andrzej Ziolkowski %T Database Querying Schemes with Fuzzy Linguistic Quantifiers %R CS-86-62 %I University of Tennessee - Knoxville, Computer Science Department %K O04 AI02 AA09 %A Janusz Kacprzyk %T Enhancing Algorithmic/Procedural "Human Consistency" of Control Models by Using Some Representation of Common Sense Knowledge %R CS-86-63 %I University of Tennessee - Knoxville, Computer Science Department %K O04 AI13 %A Janusz Kacprzyk %A Jerzy Holubiec %T Towards a More Realistic Modeling of International Economic Cooperation via Fuzzy Mathematical Programming and Cooperative Games %R CS-86-64 %K AA11 O04 %I University of Tennessee - Knoxville, Computer Science Department %A Janusz Kacprzyk %A Cezary Iwanski %T A Generalization of Discounted Multistage Decision Making and Control Through Fuzzy Linguistic Quantifies: An Attempt to Introduce Commonsense Knowledge %R CS-86-66 %K O04 AI13 %I University of Tennessee - Knoxville, Computer Science Department %A Stanley H. Smith %A Mehmet Celenk %T A New, Systematic Method for Color Image Analysis II. Computer Implementation and Results %R Tech. Rep. EE 8610 %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %D MAR 1986 %K natural sceens AI06 %A Divyendu Sinha %T Operations on Unimodal Possibility Distributions that Characterize the Gray-Values of Images in the Fuzzy Settings Part I %R Tech Rep. EECS 8614 %D MAY 1986 %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %K AI06 O04 %A Divyendu Sinha %T Operations on Unimodal Possibility Distributions that Characterize the Gray-Values of Images in the Fuzzy Settings Part II %R Tech Rep. EECS 8615 %D MAY 1986 %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %K AI06 O04 %A Harrison E. Rowe %A Jung G. Shin %A Ta-Shing Chu %T Radio Imaging of Launch Vehicles and Payloads %I Stevens Institute of Technology, Electrical Engineering and Computer Science Departments %D JUN 1986 %R TECH. Rep. EECS 8617 %K AI06 AA27 %X discussed problems in receiving radio images such as rain attenuation, clouds, etc. %A John S. Conery %T Closed Environments: Partitioned Memory Representation for Parallel Logic Programming %I Computer and InformationScience Department, University of Oregon %C Eugene, Oregon %R CIS-TR-86-02 %K AI11 H03 %A Kent A. Stevens %A Daniel P. Lulich %T Artifacts at the Limit of Resolution %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-04 %K AI06 AA10 AA01 %X A visual illusion which appears at the limit of resolution is used to investigate perceived artifacts of the convolution by Gaussian filters. Evidence is provided that implicate the smallest size operator at the retina and that suggest that the perceived shape of intensity changes is influenced by artifacts induced by the operator. %A Kent A. Stevens %A Allen Brookes %T Integrating Stereopsis with Monocular Interpretations of Planar Surfaces %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-05 %K AI06 AA10 AA01 %A Kent A. Stevens %A Allen Brookes %T Probing Depth in Monocular Images %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-06 %K AI06 AA10 AA01 %A Stephen Fickas %T Automating the Analysis Process %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-08 %K AA08 %X discusses the automation of requirements analysis %A John Conery %T Backward Execution in Nondeterministic AND-Parallel Systems %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-09 %K H03 AI10 %A Kent A. Stephens %A Allen Brooks %T Detecting Structure by Symbolic Constructions on Tokens %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-10 %K AI06 %X discusses the interpretation of dot patterns, comparison of feature detection structure-detection and energy-summation systems. %A Allen Brookes %A Kent A. Stevens %T The Analogy Between Stereo Depth and Brightness Contrast %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-11 %K AI06 AI08 AA01 AA10 %A Virginia M. Lo %A David Chen %T Intelligent Scheduling in Distributed Computing Systems %R CIS-TR-86-14 %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %K H03 AI01 %X applies expert system technology to task migration on distribution systems including dealing with out of date system load tables %A Kent A. Stevens %A Allen Brookes %T Theory of Depth Reconstruction in Stereopsis %I Computer and Information Science Department, Univerisity of Oregon %C Eugene, Oregon %R CIS-TR-86-15 %K AI06 AI08 AA01 AA10 Received: From YUYETTI(PETER) by YUSOL with RSCS id 9293 for CS100006@YUSOL; Sun, 7 Jun 87 21:05 EDT Date: Sun, 7 Jun 87 20:57:40 edt From: peter@yuyetti.BITNET (Peter Roosen-Runge) To: cs100006@yusol.bitnet Relay-Version: version B 2.10.2 9/5/84; site yetti.UUCP Path: yetti!mnetor!seismo!columbia!rutgers!ames!sdcsvax!ucbvax!SMUVM1.BITNET!E1A From: E1AR0002@SMUVM1.BITNET (Leff, Southern Methodist University) Newsgroups: comp.ai.digest Subject: ai.bib53TR Message-ID: <8705300457.AA08347@ucbvax.Berkeley.EDU> Date: 25 May 87 19:38:00 GMT Date-Received: 31 May 87 20:51:46 GMT Sender: daemon@ucbvax.BERKELEY.EDU Distribution: world Organization: The ARPA Internet Lines: 628 Approved: ailist@stripe.sri.com %A N. V. Murray %A E. Rosenthal %T Theory Links %I State University of New York at Albany, Department of Computer Science %R 86-3 %K AI11 %X We develop the notiton of theory link, which is a generalization of ordinary link to a set of literals that are simultaneously unsatisfiable relative to a given set of clauses. We show that theory links may be 'activated' in much the same manner as ordinary links when inferencing with respect to the given set of clauses. Several link deletion results are shown to hold for theory links, and several examples, including Schubert's Steamroller, are presented using first-order theory links. %A N. V. Murray %A E. Rosenthal %T Path Dissolution for Propositional Logic %I State University of New York at Albany, Department of Computer Science %R 86-6 %K AI10 Prawitz matrix reduction semantic graphs path resolution Noetherean %A M. Balaban %A N. V. Murray %T Logic Programming with LOGLISP %I State University of New York at Albany, Department of Computer Science %R 86-9 %K AT08 AI11 T01 %A M. Balaban %T The Generalized-Concept Approach to Knowledge Representation: A Frame Like Interface to Logic %I State University of New York at Albany, Department of Computer Science %R 86-12 %K Generalized-Concept Model AI10 AI16 AA25 %X see Tech Report 86-13 for extended version of the same paper %A M. Balaban %A N. V. Murray %T A First Order Calculus for Temporal Knowledge %I State University of New York at Albany, Department of Computer Science %R 86-26 %K AI10 AI16 %A M. Balaban %T The Generalized-Concept (G-C) Formalism- An Object Oriented, Logic Framework for Knowledge Representation in AI %I State University of New York at Albany, Department of Computer Science %R 86-27 %K AI10 AI16 %A A. Ginsberg %A S. M. Weiss %A P. Politakis %T Automatic Knowledge Base Refinement for Classification Systems %I Rutgers University %R CBM-TR-148 %K SEEK SEEK2 AI03 AI01 %X system to refine knowledge bases automatically %A C. V. Apte %A S. M. Weiss %T An Expert Systems Methodology for Control and Interpretation of Applications Software %I Rutgers University %R CBM-TR-149 %K AA03 AI01 AA15 %X System for the Control and Interpretation of interactive software systems %A A. Van der Mude %T Some Formal Properties of Version Spaces %I Rutgers University %R DCS-TR-201 %K AI04 AI16 Inductive Inference %X Version Spaces are a method for learning a general model which describes some input data, by keeping track of a number of equally likely alternative models (versions) consistent with the data, while deleting unacceptable models and adding new versions as the need arises %A T. Imielinski %T Complexity of Query Processing in the Deductive Databases with Incomplete Information %I Rutgers University %R DCS-TR-206 %K AA09 AI10 %X The Query Processing problem on relation databases with intensions built from Linear Horn clauses, prefixes of the type all, some, all and conjunctive queries. Two properties are described which determine the decidability of query processes. A query is given which has exponential lower bound. %A T. Imielinski %T Domain Abstraction and Limited Reasoning %I Rutgers University %R DCS-TR-207 %K O04 AI10 AI11 %X Approximate reasoning methods for first order logic %A R. M. Keller %T The Role of Explicit Contextual Knowledge in Learning Concepts to Improve Performance %I Rutgers University %R ML-TR-7 %K AI03 AI01 %$ 15.00 %X Difficulties in using concept learning methods to improve an existing systems performance. %A W. Ludwell Harrison %T Compiling Lisp for Evaluation on a Tightly Coupled Multiprocessor %R CSRD Report No. 565 %I Center for Supercomputing Research and Development, University of Illinois %D MAR 1986 %K T01 H03 %X 281 pages %A Santosh Abraham %A J. Patel %T Parallel Garbage Collection on a Virtual Memory System %I Center for Supercomputing Research and Development, University of Illinois %R 620 %D AUG 1987 %K T01 H03 %X to appear in 1987 International Conference on Parallel Processing %A W. Marek %A M. Truszyczynski %T Incompleteness of Information in Rule-Based Systems: The Role of Minimal Sets %R 87-87 %I Department of Computer Science, University of Kentucky %K AI01 AI16 %A W. Marek %T A Natural Semantics for Modal Logic Over Databases %R 88-87 %I Department of Computer Science, University of Kentucky %K AA09 AI10 %A Tom Altman %A Suresh Easwar %T Rotation-Invariant Enclodings for Linear-Time Shape Matching Algorithms %R 89-87 %I Department of Computer Science, University of Kentucky %K AI06 O06 %A W. Marek %A M. Truszyczynski %T Forcing Autoepistemic Statements %R 90-87 %I Department of Computer Science, University of Kentucky %K AI16 %A Robert Cartwright %T Types as Intervals %R TR84-5 %I Department of Computer Science, Rice University %D NOV 1984 %$ 2.50 %K AI16 AI15 %X To accommodate polymorphic data types and operations, several computer scientists - most notably MacQueen, Plotkin, and Sethi -- have proposed formalizing types as ideas. Although this approach is intuitively appealing, the resulting type system is both complex and restrictive because the type constructor that creates function types in [sic] not monotonic, and hence not computable. As a result, types cannot be treated as data values, precluding the formalization of type constructors and polymorphic program modules (where types are values) as higher order computable functions. Moreover, recursive definitions of new types do not necessarily have solutions. .sp sp This paper proposes a new formulation of types -- called intervals-- that subsumes the theory of types as ideals, yet avoids the pathologies caused by non-monotonic type constructors. In particular, the set of interval types contains the set of ideal types as a proper subset and all the primitive type operations on intervals are extensions of the corresponding operations on ideas. Nevertheless, all of the primitive interval type constructors including the function type constructor and type quantifiers are computable operations. Consequently, types are higher order data values that can be freely manipulated within programs. %A Robert Hood %T Efficient Applicative Operations on Recursive Data Structures %R TR 85-515 %I Department of Computer Science, Rice University %D FEB 1985 %K T01 %$ 1.20 %X Gives O(1) time and space functions in Pure Lisp for a given set of operations to manipulate recursive data structures such as LISP's S expressions including array-like selection. %A Hans Boehm %A Alan Demers %A James Donahue %T A Programmers' Introduction t0o Russel %R TR 85-16 %I Department of Computer Science, Rice University %D MAR 1985 %$ 1.95 %X Russell is a programming language based on the view that a data type is simply a collection of operations which can itself be manipulated. This permits compile-type checking with the flexibilities of languages supporting dynamic typing. %A William G. Golson %T A Complete Proof System for an Acceptance Refusal Model of CSP %R TR 85-19 %D APR 1985 %I Department of Computer Science, Rice University %K AA09 Concurrent Sequential Processes Hoare %$ 2.25 %A Paul Besl %A Ramesh Jain %T An Overview of Three-Dimensional Object Recognition %R RSD-TR-19-84 %I Robot Systems Division, University of Michigan %K AI06 %$ 4.50 %A Paul Besl %A Ramesh Jain %T Surface Characterization for Three-Dimensional Object Recognition in Depth Maps %R RSD-TR-20-84 %I Robot Systems Division, University of Michigan %K AI06 %$ 5.00 %A I. K. Sethi %A Ramesh Jain %T Finding Trajectories of Point in Monocular Image Sequence %R RSD-TR-3-85 %I Robot Systems Division, University of Michigan %K AI06 %$ 2.50 %X finding the same physical point in more than one dimension, formulated as an optimization problem for the case of several nonrigid objects in a scene. %A Richard A. Volz %A Tony C. Woo %A Jan D. Wolter %T Optimal Algorithms for Symmetry Detection in Two and Three Dimensions %I Robot System Division, University of Michigan %R RSD-TR-5-85 %K O06 %$ 2.50 %X Algorithms for finding rotational and involutional symmetries in point sets, polygons nad polyhedrons. Time is O(n) for polygons and O(nlogn) for two and three-dimensional point sets. Polyhedra with planar connected surface graphs can be done in O(n) time. %A Mubarak Shah %A Arun Sood %A Ramesh Jain %T Pulse and Staircase Models for Detecting Edges at Multiple Resolution %I Robot Systems Division, University of Michigan %R RSD-TR-7-85 %K AI06 %$ 2.50 %A P. S. Bhugra %A T. N. Mudge %T Comparisons Between Ada and Lisp %I Robot Systems Division, University of Michigan %R RSD-TR-9-85 %K AI06 %$ 2.00 %A T. F. Knoll %A R. C. Jain %T Recognizing Partially Visible Objects Using Feature Indexed Hypotheses %I Robot Systems Division, University of Michigan %R RSD-Tr-10-85 %K AI06 %$ 2.50 %A S. M. Hyanes %A Ramesh Jain %T Event Detection and Correspondence %I Robot Systems Division, University of Michigan %R RSD-Tr-12-85 %K AI06 %$ 2.00 %X Detection of changes in uniformly accelerated motion of objects from pictures of their movement %A Paul Besl %A Kurt Skifstad %A Ramesh Jain %T Objective Dimensionality Reduction Using Out-of-Class Covariance %I Robot Systems Division, University of Michigan %R RSD-TR-17-85 %K O06 AI06 O04 %$ 3.00 %X Non-hierarchical statistical decision algorithms spend a significant portion of their time entertaining incorrect hypotheses in multiple class, pattern recognition problems. Maximum-likelihood multivariatie-Gaussian (MLMVG) hypotheses testing is a common example of such a statistical pattern rognition technique. It is shown that the use of out of class covariance matrices can significantly reduce the run-time computations required to make MLMVG decisions. The Analysis directly leads to an objective dimensionality reduction (ODR) technique that indicate the preferred, intrinsic dimensionality omultiple class decision spaces given the training data. Run-time computatio/ns are reduced even further using these reduced dimension class decision spaces with dimensionality reduction technique to stress the essential concepts of out-of-class covariance. The theory has been applied to a nine(9) class, twenty-seven (27) feature, automatic visual solder joint inspection problem with excellent results; run-time computations are reduced by more than a factor of three while maintaining excellent design performance. %A Shih-Ping Liou %A Ramesh C. Jain %T Detecting Road Edges Using Hypothesized Vanishing Points %R RSD-TR-18-85 %I Robot Systems Division, University of Michigan %K AI06 AA19 %$ 2.50 %A Suk In Yoo %T A Methodology For Solving Problems in Artificial Intelligence %R RSD-TR-20-85 %I Robot Systems Division, University of Michigan %K AI03 A* heuristic function traveling salesman robot planning consistent labelling theorem proving %$ 11.50 %A Ramesh Jain %A Sandra L. Bartlett %A Nancy O'Brien %T Motion Stereo Using Ego-Motion Complex Logarithmic Mapping %I Robot Systems Division, University of Michigan %R RSD-TR-3-86 %K AI06 %$ 2.50 %X Obtaining and using stereo information from a moving camera %A Charles J. Conrad %A N. Harris McClamroch %T The Drilling Problem: A Stochastic Modeling and Control Example in Manufacturing %I Robot Systems Division, University of Michigan %R RSD-TR-4-86 %K AA26 %$ 2.50 %A Paul Besl %A Ramesh Jain %T Segmentation Through Symbolic Surface Descriptions %I Robot Systems Division, University of Michigan %R RSD-TR-5-86 %K AI06 %$ 3.00 %A Pual Joseph Besl %T Surfaces in Early Range Image Understanding %I Robot Systems Division, University of Michigan %R RSD-TR-10-86 %K AI06 %$ 18.00 %A Rajeev Agrawal %A Ramesh Jain %T An Overview of Tactile Sensing %I Robot Systems Division, University of Michigan %R RSD-TR-11-86 %K AI06 AI07 %$ 2.50 %A Jerry Lee Turney %T Recognition of Partially Occluded Parts %I Robot Systems Division, University of Michigan %R RSD-TR-16-86 %K AI06 AI07 AA26 %$ 7.00 %T Behavior of Edges in Scale Space %I Robot Systems Division, University of Michigan %R RSD-2-87 %K AI06 %A Daniel Pual Miranker %T TREAT: A New and Efficient Match Algorithm for AI Production Systems %I University of Texas at Austin, Department of Computer Sciences %R TR-87-03 %K AI01 H03 O06 %X The algorithm which was designed specifically for the DADO parallel machine in fact is more efficient on sequential machines as well. %A Allan Collins %A Ryszard Michalski %T The Logic of Plausible Reasoning: A Core Theory %I Department of Computer Science, University of Illinois at Urbana- Champaign %R NO. 951 %D FEB 1986 %A John A. Bentrup %A Gary J. Mehler %A Joel D. Riedesel %T INDUCE 4: A Program for Incrementally Learning Structural Descriptions from Examples %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 958 %D FEB 1987 %K AI04 %A Peter Haddawy %T A Variable Precision Logic Inference System Employing the Dempster-Shafer Uncertainty Calculus %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 959 %D DEC 1986 %K O04 Construction Project Cost Estimation %A R. S. Michalski %A A. B. Baskin %A C. Uhrik %A T. Channik %T The ADVISE.1 Meta-Expert System: The General Design and a Technical Description %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 962 %D JAN 1987 %K AI01 %A Kaihu Chen %T The Inductive Acquisition of Temporal Knowledge %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 964 %D DEC 1986 %K AI04 O03 %A Ryszard S. Michalski %T Two-Tiered Concept Meaning, Inferential Matching and Conceptual Cohesiveness %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 968 %D JUN 1986 %K AI04 %A Kenneth D. Forbus %T The Qualitative Process Engine %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1288 %D DEC 1986 %K AT15 qualitative physics %A Kenneth D. Forbus %T The Logic of Occurrence %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1300 %D DEC 1986 %K Zeno's paradox pruning %A Mitchell D. Lubas %T A Knowledge-Based Design aid for the Construction of Software Systems %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1304 %D NOV 1986 %K AA08 %A Larry Rendell %A Powell Benedict %A Howard Cho %T Concept Acquisition from Examples: Measurement of System Performance and Suggestions for Improved Design %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1315 %D JAN 1987 %K AI04 %A Dedre Gentner %T Evidence for A Structure-Mapping Theory of Analogy and Metaphor %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1316 %D DEC 1986 %K AI02 %A Larry Rendell %T Conceptual Knowledge Acquisition in Search %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1317 %D JAN 1987 %K AI03 AI04 %A Larry Rendell %A Raj Seshu %A david Tcheng %I Department of Computer Science, University of Illinois at Urbana- Champaign %T Robust Concept Learning Using Dynamically-Variable Bias %R 1318 %D MAR 1987 %K AI04 %A Larry Rendell %T Layered Concept Learning and Its Advantages %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1320 %D MAR 1987 %K AI04 %A L. V. Kale %T "Completeness" and "Full Parallelism" of Parallel Logic Programming Schemes %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1321 %D FEB 1987 %K H03 AI10 %A Larry Rendell %T Representations and Models for Concept Learning %I Department of Computer Science, University of Illinois at Urbana- Champaign %R 1324 %D MAR 1987 %K AI04 %T ANTITHESIS: A STUDY IN CLAUSE COMBINING AND DISCOURSE STRUCTURE %A William C. Mann %A Sandra A. Thompson %R ISI/RS-87-171 %D April 1987 %I USC/Information Sciences Institute %X approx. 30 pages .sp sp AI research in text generation needs a strong linguistically justified descriptive theory as a basis for creating methods by which programs can write multiparagraph texts. This paper sketches Rhetorical Structure Theory, which has been designed to support text generation, and then applies RST to describing a particular class of discourse constructs. .sp sp There is no consensus as to the status of clause combining relations relative to larger texts. This paper demonstrates a clause combining relation that is also found as part of larger text structures, and shows how this fact can be used to explain cases in which contrastive clause combining appears between clauses that are not in fact in contrast. The appropriate generalization is that the relations of clause combining and the relations of general text structure are the same. Use of this generalization should make AI text planning and text generation significantly easier. %T NOTES ON THE ORGANIZATION OF THE ENVIRONMENT OF A TEXT GENERATION GRAMMAR %A Christian Matthiessen %R ISI/RS-87-177 %D April 1987 %I USC/Information Sciences Institute %K AI02 %X approx. 52 pages .sp 1 sp 1 One of the tasks in designing a text generation system is to organize the environment of the grammatical component of the generation system in such a way that it supports the grammatical resources in generation. This report discusses the methods used for the Penman generation system to infer aspects of the organization of the knowledge base and other components of the environments of the Nigel grammar of the Penman system. It is shown how the design task can be broken down into a number of very explicit demands on the environment. In the main part of the report, the results of application of such an approach is sketched, with particular emphasis on the general organization of the knowledge base and the discourse model parts of the environment. %T Systemic Grammar and Functional Unification Grammar and Representational Issues In Systemic Functional Grammar %A Christian Matthiessen %A Robert Kasper %R ISI/RS-87-179 %D April 1987 %I USC/Information Sciences Institute %X approx. 55 pages .sp sp SYSTEMIC GRAMMAR AND FUNCTIONAL UNIFICATION GRAMMAR: Systemic Functional Grammar (SFG) and Functional Unification Grammar (FUG) are superficially very different approaches to grammatical knowledge, but they share an underlying comparability that runs very deep. FUG shares with systemic descriptions an emphasis on the functions of linguistic objects, and an explicit representation of feature choices. This paper explores how a systemic grammar can be represented in FUG notation, as a step toward creating a grammatical analysis program for English. Because FUG has been developed as a computational tool, expressing a systemic grammar in FUG notation allows new computational techniques to be applied to it. Among other benefits, this program will make it possible to study how much the grammatical functions of sentences are recoverable from them. It will also provide a method to test the amount of ambiguity implicit in a systemic description, a topic which has so far been inaccessible. This use of FUG as an alternate representation for SFG may have some additional benefits for both frameworks. It provides some solutions to problems in systemic notation which are described by Matthiessen (in this volume). Several extensions to the FUG framework are also suggested by this study. .sp sp REPRESENTATIONAL ISSUES IN SYSTEMIC FUNCTIONAL GRAMMAR: Nigel is a large diverse computational grammar for text generation. Its framework is an implementation of Systemic Functional Theory of grammar and it constitutes a context in which the representation of systemic theory can be explored and studied. .sp sp This paper surveys the representational devices used in the Nigel grammar and the representational issues that they raise in relation to systemic theory. These issues are diagnosed in the light of the metafunctional differentiation of systemic theory.