Implementation of a Constraint Machine for Prism - A Parallel Problem Solver

Abstract

This thesis describes the implementation of a constraint machine for a parallel inference system, PRISM. PRISM is a logic programming system designed to run on a new parallel computer called ZMOB. PRISM consists of three different kinds of machine, problem solving, intensional database and extensional database machines. Each will run on separate processors on the ZMOB, and there will be many of each type, all cooperating to solve a problem. The constraint machine is a fourth class of machine for PRISM. It will use a database of integrity constraints, supplied by the user, to help the problem solvers. It will do so by pruning branches from the problem solvers goal tree whenever a goal node violates an integrity constraint. This will prevent the problem solver from exploring some paths that will ultimately fail. The constraint machine uses a subsumption algorithm to determine if a goal node violates an integrity constraint. It is hoped that the constraint machine will improve the performance of the PRISM system.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1984
Accession Number
ADA147844

Entities

People

  • William P. Bradley

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Databases
  • Debugging
  • Language
  • Maryland
  • New York
  • Schools
  • Students
  • United States
  • Universities

Readers

  • Artificial Intelligence
  • Computational Linguistics
  • Parallel and Distributed Computing.

Technology Areas

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