Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:








Author, Editor

Author(s):

Veanes, Margus

dblp



Editor(s):

Pratt, Vaughan

dblp



BibTeX cite key*:

Veanes98

Title, Booktitle

Title*:

The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification

Booktitle*:

Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98)

Event, URLs

URL of the conference:

http://www.bell-labs.com/topic/conferences/lics/

URL for downloading the paper:


Event Address*:

Indianapolis, Indiana

Language:

English

Event Date*
(no longer used):

June 21-24, 1998

Organization:

IEEE Computer Society Technical Committee on Mathematical Foundations of Computing

Event Start Date:

8 July 2003

Event End Date:

12 July 2003

Publisher

Name*:

IEEE

URL:


Address*:

Los Alamitos, USA

Type:


Vol, No, Year, pp.

Series:


Volume:


Number:


Month:


Pages:

264-275

Year*:

1998

VG Wort Pages:


ISBN/ISSN:

0-8186-8506-9/1043-6871

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Simultaneous rigid $E$-unification, or SREU for short, is a fundamental
problem that arises in global methods
of automated theorem proving in classical logic with equality.
In order to do proof search in intuitionistic logic with equality one
has to handle SREU as well. Furthermore,
restricted forms of SREU are strongly related to word equations
and finite tree automata.
It was recently shown that second-order unification has a very natural
reduction to simultaneous rigid $E$-unification, which constituted
probably the most transparent undecidability proof of SREU.
Here we show that there is also a natural encoding of
SREU in second-order unification. It follows
that the problems are logspace equivalent.
So second-order unification plays the same fundamental role as SREU in
automated reasoning in logic with equality.
We exploit this connection and use
finite tree automata techniques to
present a very elementary undecidability proof of second-order unification,
by reduction from the halting problem for Turing machines.
It follows from that proof that second-order unification is undecidable
for all nonmonadic second-order term languages having
at least two second-order variables with sufficiently high arities.

Keywords:

Second-Order Unification, Rigid E-Unification



Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Programming Logics Group

Audience:

Expert

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat



BibTeX Entry:

@INPROCEEDINGS{Veanes98,
AUTHOR = {Veanes, Margus},
EDITOR = {Pratt, Vaughan},
TITLE = {The Relation Between Second-Order Unification and Simultaneous Rigid {E}-Unification},
BOOKTITLE = {Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98)},
PUBLISHER = {IEEE},
YEAR = {1998},
ORGANIZATION = {IEEE Computer Society Technical Committee on Mathematical Foundations of Computing},
PAGES = {264--275},
ADDRESS = {Indianapolis, Indiana},
ISBN = {0-8186-8506-9/1043-6871},
}


Entry last modified by Christine Kiesel, 03/12/2010
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Margus Veanes
Created
09/02/1998 11:15:25 AM
Revisions
7.
6.
5.
4.
3.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Christine Kiesel
Edit Dates
08.07.2003 15:30:26
14.09.2001 03:26:49 PM
14.09.2001 03:26:25 PM
28.08.2001 16:32:29
29.03.99 19:26:27
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section