• Login
    Search 
    •   Athenaeum Home
    • Institute for Artificial Intelligence
    • Search
    •   Athenaeum Home
    • Institute for Artificial Intelligence
    • Search
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Search

    Show Advanced FiltersHide Advanced Filters

    Filters

    Use filters to refine the search results.

    Now showing items 1-6 of 6

    • Sort Options:
    • Relevance
    • Title Asc
    • Title Desc
    • Issue Date Asc
    • Issue Date Desc
    • Results Per Page:
    • 5
    • 10
    • 20
    • 40
    • 60
    • 80
    • 100
    Thumbnail

    Efficient Prolog: A practical guide 

    Covington, Michael A. (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 ...
    Thumbnail

    Problems in applying discourse representation theory 

    Smith, William H. (University of Georgia, 1989)
    Thumbnail

    An implementation of discourse representation theory 

    Covington, Michael A.; Schmitz, Nora (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 ...
    Thumbnail

    From English to Prolog via discourse representation theory ACMC research report 01-0024 

    Covington, Michael A.; Nute, Donald; Schmitz, Nora; Goodman, David (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 ...
    Thumbnail

    A numerical equation solver in Prolog 

    Covington, Michael A. (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, ...
    Thumbnail

    An extension of Prolog for unification-based grammar 

    Covington, Michael A. (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 ...

    About Athenaeum | Contact Us | Send Feedback
     

     

    Browse

    All of AthenaeumCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CommunityBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Discover

    AuthorCovington, Michael A. (5)Schmitz, Nora (2)Goodman, David (1)Nute, Donald (1)Smith, William H. (1)Date Issued1989 (4)1988 (2)Has File(s)Yes (6)

    About Athenaeum | Contact Us | Send Feedback