Constructive Negotiation in Logic Programs

Abstract

Logic programming is declarative, but its programs can be executed relatively efficiently. This balance is a precarious one: languages with a more imperative nature are much faster in execution, but programming is more difficult; if the declarative expressiveness of the language is extended, its execution can become so slow that it is unusable. The languages typified by 'pure' PROLOG strike this balance on the side of efficiency, by fixing on SLD resolution as the execution algorithm. The Horn-clause subset of first-order logic for which SLD resolution is adequate is limited in the naturalness of its expressiveness, and the most notable omission is that negative information cannot be expressed. (jes)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1988
Accession Number
ADA215318

Entities

People

  • Richard Hamlet

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • Classification
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Efficiency
  • Engineering
  • Language
  • Security
  • Theses
  • Words (Language)

Fields of Study

  • Computer science
  • Engineering

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Computational Linguistics
  • Parallel and Distributed Computing.