Automatic Deduction Research Articles

The Automatic Deduction of Classificatory Systems from Linguistic Theories

Classifying linguistic objects is a widespread and important linguistic task, but hand deducing a classificatory system from a general linguistic theory can consume much effort and introduce pernicious errors. We present an abstract prototype device that effectively deduces an accurate classificatory system from a finite linguistic theory.

Distributed simulation with locality

We describe MOSS, a small language of mobile distributed objects and system-wide references, uncommitted to any distributed simulation protocol, but which can be executed as a distributed conservative simulation with automatic deduction of lookahead. We show how the MOSS programmer can control the dynamic distribution and locality of simulation objects by simple means which provide natural modelling functions. Preliminary results show how programmed locality can reduce communication costs in simulation.

Cardinalities in depth: a formal approach to partial validation of conceptual schema

This paper presents an innovative approach to partially validate E/R specifications. It is based on the automatic deduction of cardinalities for transitive relationship. The major result of this work is a set of deduction rules relying on mathematical function composition. These deduced cardinalities can be effectively used by the designer to validate E/R specifications. He/she can check the accuracy of the deductions made towards the reality. In some cases, automatic deduction is not possible. Then, a careful study of the relationships is proposed. This can lead to reconsider what the relationship really is and how it should be represented using E/R concepts. Major changes in the E/R diagram can be achieved this way and thereby improve significantly the E/R specifications.

AN EXPERT SYSTEM FOR CEMENT KILNS ANALYSIS AN EXPERT SYSTEM FOR CEMENT KILNS ANALYSIS USING A GENERAL FRAMEWORK FOR A PROCESS FLOWSHEET DESCRIPTION

Abstract This paper describes the prototype of an expert system for the technical analysis of cement kilns. Technical analyses are complex tasks performed by an expert to diagnose malfunctions, to evaluate the effects of recent modifications on the plant, or simply to strike a detailed balance of normal plant operation. The expert system is composed of three modules. The first module deals with flowsheet description through the SPI interface. SPI is a general package which can be used in applications to graphically describe a flowsheet and to automatically generate an internal object-based representation of the flowsheet from its graphical description. Moreover, procedures for automatic deductions can be implemented within SPI, in order to help the user provide the application with relevant data in an economic way and to ensure flowsheet consistency. The goal of the second module is to plan the measurements campaign according to the plant structure and the purpose of the analysis. The third module perform...

Automatic deduction of temporal information

In many computer-based applications, temporal information has to be stored, retrieved, and related to other temporal information. Several time models have been proposed to manage temporal knowledge in the fields of conceptual modeling, database systems, and artificial intelligence. In this paper we present TSOS, a system for reasoning about time that can be integrated as a time expert in environments designed for broader problem-solving domains. The main intended goal of TSOS is to allow a user to infer further information on the temporal data stored in the database through a set of deduction rules handling various aspects of time. For this purpose, TSOS provides the capability of answering queries about the temporal specifications it has in its temporal database. Distinctive time-modeling features of TSOS are the introduction of temporal modalitites , i.e., the possibility of specifying if a piece of information is always true within a time interval, or if it is only sometimes true, and the capability of answering about the possibility and the necessity of the validity of some information at a given time, the association of temporal knowledge both to instances of data and to types of data , and the development of a time calculus for reasoning on temporal data. Another relevant feature of TSOS is the capability to reason about temporal data specified at different time granularities.

Symmetric Neural Networks and Propositional Logic Satisfiability

Connectionist networks with symmetric weights (like Hopfield networks and Boltzmann Machines) use gradient descent to find a minimum for quadratic energy functions. We show equivalence between the problem of satisfiability in propositional calculus and the problem of minimizing those energy functions. The equivalence is in the sense that for any satisfiable well-formed formula (WFF) we can find a quadratic function that describes it, such that the set of solutions that minimizes the function is equal to the set of truth assignments that satisfy the WFF. We also show that in the same sense every quadratic energy function describes some satisfiable WFF. Algorithms are given to transform any propositional WFF into an energy function that describes it and vice versa. High-order models that use sigma-pi units are shown to be equivalent to the standard quadratic models with additional hidden units. An algorithm to convert high-order networks to low-order ones is used to implement a satisfiability problem-solver on a connectionist network. The results give better understanding of the role of hidden units and of the limitations and capabilities of symmetric connectionist models. The techniques developed for the satisfiability problem may be applied to a wide range of other problems, such as associative memories, finding maximal consistent subsets, automatic deduction, and even nonmonotonic reasoning.

A selected artificial intelligence bibliography for operations researchers

We have compiled a selected, classified, and annotated Artificial Intelligence bibliography specifically addressed to an operations research audience. The bibliography includes approximately 450 references from the areas of search (including heuristics and games), automatic deduction (including theorem proving, logic programming, and logical aspects of databases), planning, learning, and knowledge-based systems (with numerous specific applications to management, engineering, science, medicine, and other fields). We have also added a general references section, as well as a special section on Artificial Intelligence/Operations Research interfaces.

Interior Portraits: Women, Physiology and the Male artist

One of the most contentious and diElcult areas for feminist Art History is the representation of woman in high art forms, that is, in oil paintings exhibited within the public arena as opposed to advertisements and other popular art forms accessible to a mass audience. The nineteenth century has been a particular focus of attention. A number of reasons may be offered to account for this. Academic and pseudo-academic appraisal of the Victorian age has led, as Lyn Nead pointed out in an important article, to the 'phallocentric notion that representations by men of the female nude can function as the standard for exploring and defining Victorian sexuality'. Nead is especially critical of the work of Ronald Pearsall for the way in which it offers up to the reader a sequence of images unproblematically designated as erotic and purporting to tell us facts about the sexuality of the artists who produced them and hence, by automatic deduction, of the age in which they lived (Nead, 1983:227-36). The often prurient exposure of the 'other Victorians'l has encouraged the explanation of paintings as reflections of individual experiences and sexualities. Thus it has been too easy to present the period in terms of a polarity between virgin and whore with the representation of the prostitute on one side and the image of the 'respectable' woman on the other. Both are presented as reflecting meanings that are produced somewhere else, and the ideological interdependency of the models is unexplored. Equally unhelpful is the simple equation which posits a repressed male artist (Lord Leighton and Alma Tadema are popular targets) producing high-class pornography for a monolithic and hypocritical audience. Repression undoubtedly does play its part in the production of images of women in the nineteenth century and there were, undoubtedly, profound levels of hypocrisy at work but an argument that is predicated upon a universalist view of the artist (male) and of his sexuality will not help to establish the way in which these things function in cultural production of which images are an important part. The nineteenth century has also attracted attention because it is seen historically as the period in which women's struggle to acquire

Extraction of drainage networks by using the consistent labeling technique

Automatic deduction of the drainage network direction from Landsat imagery is a problem in remote sensing. The problem can be formulated in the abstract as a consistent labeling problem which is given a set of units (stream segments), possible labels (flow directions), and constraints on the way adjacent stream segments must be labeled. The goal is to find a mapping from their units to the labels that satisfies the constraints. Consistent labeling problems can be solved by tree search algorithms. In this paper, the stream labeling problem is formulated as a consistent labeling problem. The extraction of stream and valley segments from the Landsat images is discussed, and constraints on segments which meet at junctions are given. The tree search algorithm, employing a method called forward checking, is given and is used to determine the flow direction of all the stream segments in a way that is globally consistent with the junction constraints.

The linked conjunct method for automatic deduction and related search techniques

The linked conjunct method for automatic deduction and related search techniques

Dated: A Language to Describe Plans and Strategies in Automatic Deduction Systems

DATED is a simple but powerful tool for the construction of automatic deduction systems. The kernel of the system is a high level language and its translator. The language provides the deduction system designer with statements to define collections and classes of axioms in a declarative wav.lt also allows the use of PLANS and STRATEGIES to control the application of deduction rules and the filtering of results. Plans and strategies are also defined in a declarative wav. He briefly describe in this paper the main characteristics of the language (structure, statements, obiects) and their use with a specific example. Unlike other languages used in Artificial Intelligence Applications (Prolog, Planner), DATED allows the user to easily define and control the demonstration strategy.

J. A. Robinson. Automatic deduction with hyper-resolution. International journal of computer mathematics, vol. 1 no. 3 (1965), pp. 227–234.

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Death of the American dream house

The private house in America is the focal point of the myth/dream/reality of the good life for its middle classes as well as the aspirants to those anointed ranks. The automobile has lost much of its glamour: the boat, the trailer, the vacation to Europe are separately and together becoming powerful symbols, but their use-and excursions involving their use-begins with the house. To current blue-collar workers, moreover, the private house is what the 01d postal savings system or employe r automatic wage deductions for the purchase of Liberty Bonds or Savings Bonds or War Bonds were to previous generations-a form of relatively painless savings. For all but the more affluent in our society, a house is not only a home, it is typically a major repository of capital investment and stored equity. As any imaginative architect will testify, houses are purchased to be sold, not to be lived in. Their ultimate sale represents the edge which makes Social Security and Old Age pensions endurable. Possession of a house makes a man a full citizen of the work group. In this last generation, workingmen of America have moved from being renters to owners. The ramifications of this past shift are far from fully explored, but more important to understand now are the present facts and future realities of the housing stock for American workers. Who builds it? For whom? How? Why? And where?

John Alan Robinson. On automatic deduction. Rice University studies, vol. 50 no. 1 (1964), pp. 69–89.

John Alan Robinson. On automatic deduction. Rice University studies, vol. 50 no. 1 (1964), pp. 69–89.

Theorem-Proving for Computers: Some Results on Resolution and Renaming

It is shown that J. A. Robinson's P1—deduction is a special case of a large class of types of deduction by resolution, an optimum choice from which should be possible for any particular theorem to be proved. Some further results, based on the operation of renaming literals by means of their negations, are obtained and suggest an alternative approach to automatic deduction.