Search
Now showing items 1-6 of 6
Efficient Prolog: A practical guide
(University of Georgia, 1989-08-16)
Properly used, Prolog is as fast as any language with comparable
power. This paper presents guidelines for using Prolog efficiently.
Some of these guidelines rely on implementation- dependent
features such as indexing ...
Problems in applying discourse representation theory
(University of Georgia, 1989)
An implementation of discourse representation theory
(University of Georgia, 1988-04)
This paper documents a computer program that constructs discourse
representation structures (DRSes) from ordinary English input. A
source listing of the program is included. This program is a much extended
version of ...
From English to Prolog via discourse representation theory ACMC research report 01-0024
(University of Georgia, 1988-04)
This is a preliminary report on a set of techniques for translating the discourse
representation structures (DRSes) of Kamp (1981) into semantically
equivalent clauses in a slightly extended form of Prolog. Together with ...
A numerical equation solver in Prolog
(University of Georgia, 1989-03)
The Prolog inference engine can be extended to solve for unknowns
in arithmetic equations such as X−1=1/X or X=cos(X), whether or
not the equations have analytic solutions. This is done by standard
numerical methods, ...
An extension of Prolog for unification-based grammar
(University of Georgia, 1989-01)
A simple extension to Prolog facilitates implementation of unification-based grammars (UBGs) by adding a new notational device, the feature structure, whose behavior emulates graph unification. For example, a:b..c:d denotes ...