On Purely Exponential Logic Queries

Abstract

This paper, provides a syntactic condition under which these Purely exponential queries can be rewritten as linear queries. As an application of this result, the authors give a new proof for Guessarian's theorem on converting binary chained exponential queries to linear queries. Moreover, an infinite chain of progressively weaker template dependencies is constructed via expansion of the logic program for transitive closure of a relation R. This natural chain yields another proof for the result of R, Fagin, et al. Keywords: Logic programs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1988
Accession Number
ADA201259

Entities

People

  • Kazem Taghva
  • Tian-zheng Wu

Organizations

  • University of Nevada, Las Vegas

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Classification
  • Computer Science
  • Computers
  • Databases
  • Electrical Engineering
  • Engineering
  • Information Processing
  • Language
  • Mathematics
  • Military Research
  • New Mexico
  • Security
  • Sequences
  • Stationary
  • Template Patterns
  • Urban Areas

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Computational Linguistics