Cyber & formal methods publications
-
More Notes From The Unification Underground: A Second Compilation Of Papers On Unification-Based Grammar Formalisms
We study a new corpus of patient-clinician interactions recorded when patients are admitted to a hospital for suicide risk and again when they are released.
-
A Simple and Efficient Implementation Of Higher-Order Functions In Lisp
A relatively simple method for handling higher-order functions (funargs) in LISP is described. It is also shown how this scheme allows extension of the LISP language to include partial application…
-
On The Mathematical Properties Of Linguistic Theories
Metatheoretical findings regarding the decidability, generative capacity, and recognition complexity of several syntactic theories are surveyed. These include context-free, transformational, lexical-functional, generalized phrase structure, tree adjunct, and stratificational grammars.
-
Team Users Guide
This user’s guide is designed to assist new TEAM users to learn about the concepts and tasks involved in retrieving data and in preparing a demonstration for a new application…
-
Possible-World Semantics For Autoepistemic Logic
This note presents an alternative, possible-world semantics for autoepistemic logic that enables us to construct finite models for autoepistemic theories, as well as to demonstrate the existence of sound and…
-
Notes From The Unification Underground: A Compilation Of Papers On Unification-Based Grammar Formalisms
The current formalism being simultaneously designed, implemented and used by the group, PATR-II, is based on unification of directed-graph structures. Unification is thus a theme both of our research, and…
-
A Prolog Technology Theorem Prover
An extension of Prolog, based on the model elimination theorem-proving procedure, would permit production of a logically complete Prolog technology theorem prover capable of performing inference operations at a rate…
-
A Formal Theory Of Knowledge and Action
Most work on planning and problem solving within the field of artificial intelligence assumes that the agent has complete knowledge of all relevant aspects of the problem domain and problem…
-
Direct Parsing Of Id/Lp Grammars
We develop a parsing algorithm, based on the algorithm of Earley, for parsing ID/LP grammars directly, circumventing the initial expansion phase. We also discuss some aspects of the time complexity…
-
An Abstract Prolog Instruction Set
This report describes an abstract Prolog instruction set suitable for software, firmware, or hardware implementation. The instruction set is abstract in that certain details of its encoding and implementation are…
-
An Overlapped Prolog Processor
The report compares the organization to both general-purpose, microcoded machines and reduced-instruction-set machines. Hand timings indicate that a peak performance rate of 450 K LIPS (logical inferences per second) is…
-
Telegram: A Grammar Formalism For Language Planning
The TELEGRAM system described in this paper solves this problem by annotating a unification grammar with assertions about how grammatical choices are used to achieve various goals, and by enabling…