Last edited by Grokree
Saturday, August 8, 2020 | History

3 edition of On simultaneous rigid E-unification found in the catalog.

On simultaneous rigid E-unification

Margus Veanes

On simultaneous rigid E-unification

by Margus Veanes

  • 152 Want to read
  • 13 Currently reading

Published by Uppsala University, Computing Science Dept. in Uppsala, Sweden .
Written in English

    Subjects:
  • Automatic theorem proving.

  • Edition Notes

    StatementMargus Veanes.
    SeriesUppsala theses in computing science,, 29
    Classifications
    LC ClassificationsQA76.9.A96 V43 1997
    The Physical Object
    Paginationii, 122 p.;
    Number of Pages122
    ID Numbers
    Open LibraryOL66980M
    ISBN 109150612174
    LC Control Number99165303


Share this book
You might also like
Sir Chistopher Hatton School.

Sir Chistopher Hatton School.

The West and the Soviet Union

The West and the Soviet Union

European Communities legislation

European Communities legislation

Rhythmic movement and its effect on the music achievement of fourth-grade children

Rhythmic movement and its effect on the music achievement of fourth-grade children

The Iceman

The Iceman

Metropolitan Transportation Authority, Real Estate Department leasing activities

Metropolitan Transportation Authority, Real Estate Department leasing activities

international distribution of raw materials.

international distribution of raw materials.

Handlist of scientific instrument-makers trade catalogues 1600-1914

Handlist of scientific instrument-makers trade catalogues 1600-1914

Speedicut manual of screw thread tools.

Speedicut manual of screw thread tools.

The Complete book of wargames

The Complete book of wargames

Educating the gifted and talented in New York State

Educating the gifted and talented in New York State

On simultaneous rigid E-unification by Margus Veanes Download PDF EPUB FB2

Automated theorem proving methods in classical logic with equality that are based on the Herbrand theorem, reduce to a problem called Simultaneous Rigid E-Unification, or SREU for short, Recent developments show that SREU has also close connections with intuitionistic logic with equality, second-order unification, some combinatorial problems and finite tree by: 8.

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): Automated theorem proving methods in classical logic with equality that are based on the Herbrand theorem, reduce to a problem called Simultaneous Rigid E-Unification, or SREU for short. Recent developments show that SREU has also close connections with intuitionistic logic with.

The Decidability of Simultaneous Rigid E-Unification with One Variable. We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable.

This result implies that the A*EA* fragment of intuitionistic logic with equality is by: Simultaneous rigid E -unification was introduced in by Gallier, Raatz and Snyder. It is used in the area of automated reasoning with equality in extension procedures, like the tableau method or the connection method.

Many articles in this area assumed the existence of an algorithm for the simultaneous rigid E -unification by: Simultaneous rigid E-unification has been introduced in the area of theorem proving with equality. It is used in extension procedures, like the tableau method or the connection method.

We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable.

This result implies that the ∀*∃∀* fragment of intuitionistic logic with equality is decidable. Together with a.

Simultaneous Rigid E-Unification is not so Simple. We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable.

This result implies that. Part of the Lecture Notes in Computer Science book series (LNCS, volume ) We show that simultaneous rigid E-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one by: Part of the Lecture Notes in Computer Science book series (LNCS, volume ) Abstract We study the monadic case of a decision problem know as simultaneous rigid E by:.