18 research outputs found

    A Survey of Three Applications of Parallelism in AI

    Get PDF
    Once the BEMAS [13] system was completed and recorded in Common Lisp, research efforts were channeled toward three primary areas. This report will present a briefly review of some research in these areas, which are: parallelizing truth maintenance systems, parallelizing production systems, and parallel search. The area of parallel search has been studied by many over the past years and we will only present current research that has been accomplished. This review represents the beginning research into the development of a parallel inference model

    Correct Parallel Status Assignments for the Reason Maintenance System

    Get PDF
    This paper represents a beginning development of a parallel truth maintenance system to interact with a parallel inference engine. We present a solution which performs status assignments in parallel to belief nodes in the Reason Maintenance System (RMS) presented by [3],[4]. We examine a previously described algorithms by [7] which fails to correctly detect termination of the status assignments. Under Petrie\u27s algorithm, termination may go undetected an in certain circumstances (namely the existence of an unsatisfiable circularity) a false detection may occur. We present an algorithm that corrects these problems

    Belief Maintenance Systems: Initial Prototype Specification

    Get PDF
    A fundamental need in future information systems is an effective method of accurately representing and monitoring dynamic, real-world situations inside a computer. Information is represented using an Extended Open World Assumption (EOWA), in which the data are explicitly true or false. Reasoning within the EOWA is done through the use of a dynamic dependency net which only represents those beliefs and justifications that are both currently valid and in current use. In this paper, we present definitions and uses of the EOWA and dynamic dependency net in our current research of developing a database with which we can use deductive reasoning with limited resources. A prototype has been implemented for determining the existing problems of creating such a belief management system for operation in real-world applications

    BEMAS: User\u27s Manual, 2nd Edition

    Get PDF
    This paper is a user\u27s manual for BEMAS, a BE lief MA intenance System. BEMAS is a menu driven system which provides an easy to use interface between a user and a knowledge base. Given a set of data, and a set of rules, BEMAS will help the user to identify an object by analyzing the properties of that object. Data can be added and deleted at any time, either directly or by deleting beliefs on which the data is dependent. BEMAS maintains the relations and dependencies between data using a dynamic dependency net. BEMAS also has the capability to make inferences using incomplete information while still maintaining knowledge base integrity

    BEMAS: A Belief Maintenance System Prototype User\u27s Manual

    Get PDF
    This paper is a user\u27s manual for BEMAS, a Belief Maintenance System. BEMAS is a menu driven system which provides an easy to use interface between a user and a knowledge base. Given a set of data, and a set of rules, BEMAS will help the user to identify an object by analyzing the properties of that object. Data can be added and deleted at any time, either directly or by deleting beliefs on which the data is dependent. BEMAS maintains the relations and dependencies between data using a dynamic dependency net. BEMAS also has the capability to make inferences using incomplete information while still maintaining knowledge base integrity

    Towards a Fully Parallel Reason Maintenance System

    Get PDF
    A truth maintenance system (TMS) is an AI system used to monitor consistency of information in a knowledge base. A TMS may be necessary when non-monotonic reasoning is used since incorrect assumptions can lead to contradictory conclusions. The Reason Maintenance System (RMS), a specific TMS first described by Doyle [5],[6], is used along with an inference engine (IE), or problem solver, to maintain a consistent set of beliefs and inferences. We have developed a parallel version of the RMS for correctly assigning IN or OUT states to each believe node [7]. This algorithm uses diffusing computation [4] to assign the status to a node. In this paper we will further parallelize the RMS by superimposing a locking mechanism on the RMS to have simultaneous status assignment computations performed. Also, we will address how contradiction handling can be executed in parallel and the effect on the RMS when a parallel contradiction handler is incorporated
    corecore