Correct Parallel Status Assignments for the Reason Maintenance System

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

A Survey of Three Applications of Parallelism in AI

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

Relaxation energies and excited state structures of poly(para-phenylene)

We investigate the relaxation energies and excited state geometries of the light emitting polymer, poly(para-phenylene). We solve the Pariser-Parr-Pople-Peierls model using the density matrix renormalization group method. We find that the lattice relaxation of the dipole-active $1^1B_{1u}^-$ state is quite different from that of the $1^3B_{1u}^+$ state and the dipole-inactive $2^1A_g^+$ state. In particular, the $1^1B_{1u}^-$ state is rather weakly coupled to the lattice and has a rather small relaxation energy ca. 0.1 eV. In contrast, the $1^3B_{1u}^+$ and $2^1A_g^+$ states are strongly coupled with relaxation energies of ca. 0.5 and ca. 1.0 eV, respectively. By analogy to linear polyenes, we argue that this difference can be understood by the different kind of solitons present in the $1^1B_{1u}^-$, $1^3B_{1u}^+$ and $2^1A_g^+$ states. The difference in relaxation energies of the $1^1B_{1u}^-$ and $1^3B_{1u}^+$ states accounts for approximately one-third of the exchange gap in light-emitting polymers.Comment: Submitted to Physical Review

Formal Verification of Pure Production Systems Programs

Reliability, defined as the guarantee that a program satisfies its specifications, is an important aspect of many applications for which rule-based expert systems are suited. Executing rule-based programs on a series of test cases. To show a program is reliable, it is desirable to construct formal specifications for the program and to prove that it obeys those specifications. This paper presents an assertional approach to the verification of a class of rule-based programs characterized by the absence of conflict resolution. The proof logic needed for verification is already in use by researchers in concurrent programming. The approach involves expressing the program in a language called Swarm, and its specifications as assertions over the Swarm program. Among models that employ rules-based notation, Swarm is the first to have an axiomatic proof logic. A brief review of Swarm and its proof logic is given, along with an illustration of the formal verification method used on a simple rule-based program

Formal Derivation of Rule-Based Program

This paper describes a formal approach to developing concurrent rule-based programs. Our program derivation strategy starts with a formal specification of the problem. Specification refinement is used to generate an initial version of the program. Program refinement is then applied to produce a highly concurrent and efficient version of the same program. Techniques for the deriving concurrent programs through either specification or program refinement have been described in previous literature. The main contribution of this paper consists of extending the applicability of these techniques to a broad class of rule-based programs. The derivation process is supported by a powerful proof logic, a logic that recently has been extended to cover rule-based programs. The presentation centers around a rigorous and systematic derivation of a concurrent rule-based solution to a classic problem

Belief Maintenance Systems: Initial Prototype Specification

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

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

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

The Total System Design (TSD) Framework: An Approach to the Development of Distributed Systems Design Methodologies

A methodological framework is an abstraction over a class of design methodologies. The framework characteristics the problem solving approach shared by the methodologies belonging to that class: it identifies the nature of their common design concerns and the fundamental logical interdependencies between these concerns. The paper proposes a particular framework called the Total System Design (TSD) Framework. It represents a specification for a class of design methodologies which view computer-based systems as potentially distributed hardware/software aggregates. As such, the TSD Framework consolidates under a unified perspective two traditionally separate concerns: software design and hardware design. Furthermore, it establishes the role played by hardware/software trade-offs in system design. A strategy for deriving methodologies from the TSD Framework is outlined and illustrated