IEEE Transactions on Computers

Issue 8 • Aug. 1976

Filter Results

Displaying Results 1 - 16 of 16
  • IEEE Transactions on Computers - Table of contents

    Publication Year: 1976, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (351 KB)
    Freely Available from IEEE
  • IEEE Computer Society

    Publication Year: 1976, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (218 KB)
    Freely Available from IEEE
  • Introduction Tutorial on Resolution

    Publication Year: 1976, Page(s):769 - 772
    Cited by:  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1848 KB)

    Automated theorem proving involves the programming of computers to perform logical (mathematical) deduction. This should not be confused with numerical calculation, in which operations that need to be performed can be exactly specified ahead of time as, for example, in Gaussian elimination. Rather, theorem provers search for proofs of statements given axioms describing the basic assumptions such a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Problems and Experiments for and with Automated Theorem-Proving Programs

    Publication Year: 1976, Page(s):773 - 782
    Cited by:  Papers (24)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3084 KB)

    The two objectives of this paper are 1) to give a large and varied problem set, complete clause sets for use in testing automated theorem-proving programs and 2) the presentation of a number of experiments with an existing program under a variety of conditions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Resolution, Refinements, and Search Strategies: A Comparative Study

    Publication Year: 1976, Page(s):782 - 801
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7112 KB)

    This paper describes a comparative study of six binary inference systems and two search strategies employed in resolution-based problem solving systems. A total of 152 problems, most of which were taken from the recent literature, were employed. Each of these problems was attempted under a standard set of conditions using each inference system and each search strategy, for a total of twelve attemp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Refutations by Matings

    Publication Year: 1976, Page(s):801 - 807
    Cited by:  Papers (19)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3793 KB)

    Occurrences of literals in the initial clauses of a refutation by resolution (with each clause-occurrence used only once) are mated iff their descendants are resolved with each other. This leads to an abstract notion of a mating as a relation between: occurrences of literals in a set of clause-occurrences. The existence of many refutations with the same mating leads to wasteful redundancy in the s... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Problem-Oriented Search Procedure for Theorem Proving

    Publication Year: 1976, Page(s):807 - 815
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4142 KB)

    In, this paper we argue that if search procedures are to use problem-specific information to direct a search, then they must have complete control over the deductive process. This includes the freedom to select any pair of clauses to interact as well as the freedom to select the literals upon which to attempt the interaction. We give examples to indicate the nature of inference rules which are inc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic Resolution for Horn Sets

    Publication Year: 1976, Page(s):816 - 822
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1753 KB)

    A new resolution strategy for Horn sets of clauses, each clause of which contains no more-than one positive literal, is presented which requires that in each resolution either one ancestor be a false positive unit or that one ancestor and the resolvent both be false. This strategy emphasizes "relevant" positive units while controlling the explosive nonunit resolution. Some properties of interpreta... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Search Technique for Clause Interconnectivity Graphs

    Publication Year: 1976, Page(s):823 - 835
    Cited by:  Papers (24)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3649 KB)

    This paper presents a new representation and technique for proving theorems automatically that is both computationally more effective than resolution and permits a clear and concise formal description. A problem in automatic theorem proving can be specified by a set of clauses, containing literals, that represents a set of axioms and the negation of a theorem to be proved. The set of clauses can b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Evaluation of an Implementation of Qualified Hyperresolution

    Publication Year: 1976, Page(s):835 - 843
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3986 KB)

    A new inference rule for resolution based theorem proving, termed qualified hyperresolution, is presented from a practical point of view. The method of qualification is intended to deal with clause sets involving not-everywhere-defined functions. Two examples illustrating the effects of the method are discussed in detail. The potential practical value of the method is indicated by substantial impr... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Use of Higher Order Logic in Program Verification

    Publication Year: 1976, Page(s):844 - 851
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2752 KB)

    This paper focuses on the interface between program verification and mechanical theorem proving. It is often much easier to express what a program does in higher order logic than in first-order logic. However, in general, higher order theorem proving is difficult to mechanize. Hence we have isolated some special classes of higher order formulas and will show how they can be processed efficiently b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Methods for Automated Theorem Proving in Nonclassical Logics

    Publication Year: 1976, Page(s):852 - 862
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2484 KB)

    In this paper we outline two basic methods for automated theorem proving in nonclassical logics, including modal, many-valued, relevance, and intuitionistic logics. We discuss advantages and disadvantages of each method and give several illustrative examples. We outline a procedure for attacking more complex problems using a combination of the two basic methods. Results of experimental application... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Announcing the IEEE Computer Society's Standing Subscription Plan [advertisement]

    Publication Year: 1976, Page(s): 862
    Request permission for commercial reuse | PDF file iconPDF (217 KB)
    Freely Available from IEEE
  • if your computer engineering library doesn't subscribe to all 3 it's not complete.

    Publication Year: 1976, Page(s): 862
    Request permission for commercial reuse | PDF file iconPDF (1320 KB)
    Freely Available from IEEE
  • IEEE Computer Society Publications

    Publication Year: 1976, Page(s): 862
    Request permission for commercial reuse | PDF file iconPDF (139 KB)
    Freely Available from IEEE
  • Computers... by the millions, for the millions

    Publication Year: 1976, Page(s): 862
    Request permission for commercial reuse | PDF file iconPDF (838 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org