Anytime Declarativism

Abstract

The objectives of this grant is to formalize the notion of anytime inference. This work consisted of an extension to Ginsberg's work on multivalued logics, since this earlier work allows arbitrarily finely grained responses to declarative queries. They will also develop a procedure that responds to a declarative query in an anytime fashion, in that it returns the correct answer in the large runtime limit but only approximate answers in shorter times. Both uniform and nonuniform convergence will be addressed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 1992
Accession Number
ADA258698

Entities

People

  • Matthew L. Ginsberg
  • Nils J. Nilsson

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • California
  • Classification
  • Commerce
  • Computer Science
  • Computers
  • Convergence
  • Environment
  • Monitoring
  • Nonuniform
  • Security
  • Students
  • Universities

Readers

  • Calculus or Mathematical Analysis
  • Computational Linguistics
  • Systems Analysis and Design

Technology Areas

  • AI & ML
  • AI & ML - Information Retrieval
  • AI & ML - Machine Learning Algorithms