Location
Toggle navigation
HOME
INSTITUTE
Mission
Address
Executive Board
Scientific Members of MPG
Scientific Advisory Board
Board of Trustees
NEWS
Latest
Press Releases
Awards
Spotlights
Campus Event Calendar
25th Anniversary
30th Anniversary
Employment
DEPARTMENTS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Grapics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Automation of Logic
Network and Cloud Systems
Multimodal Language Processing
PUBLICATIONS
Algorithms & Complexity
Computer Vision and Machine Learning
Internet Architecture
Computer Graphics
Databases and Information Systems
Visual Computing and Artificial Intelligence
Research Group Computational Biology
Automation of Logic
Network and Cloud Systems
Research Reports
Scientific Advisory Board
Curatorship Board
25th anniversary
IMPRS-CS
PEOPLE
SOFTWARE
SERVICES
Joint Central Services
Joint Administration
- Library
- International Office
Joint Scientific IT and Technical Services
- Building and Technical Support
Research Coordination
Representative for Equal Opportunities
- Equal Opportunities
Representative for Severely Disabled Persons
Representative for Safety
Ombudsperson for
Good Scientific Practice
and Doctoral Research
Company Physician
CS@MPG
CS@SAAR
Saarland Informatics Campus
Computer Science Department,
Saarland University
Max Planck Institute for
Software Systems (MPI-SWS)
German Center for
Artificial Intelligence (DFKI)
Center for Security, Privacy
and Accountability (CISPA)
VIA - Saarbrücken Center for
Visual Computing, Interaction
and Artificial Intelligence
Graduate School for
Computer Science
Cluster of Excellence (MMCI)
Max Planck Center for Visual
Computing and Communication
Kaiserslautern-Saarbrücken
Computer Science Cluster
IT Incubator
Publications
Home
Intranet
Server
halma.mpi-inf.mpg.de
Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Vorobyov, Sergei
dblp
Editor(s):
McRobbie, M. A.
Slaney, J. K.
dblp
dblp
BibTeX cite key*:
Vorobyov96CADE96
Title, Booktitle
Title*:
An improved lower bound for the elementary theories of trees
Booktitle*:
Proceedings of the 13th International Conference on Automated Deduction (CADE-13)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
New Brunswick, USA
Language:
English
Event Date*
(no longer used):
July 30 - August 3, 1996
Organization:
AT&T, Bell Labs, Lucent, IEEE, CADE inc
Event Start Date:
21 May 2024
Event End Date:
21 May 2024
Publisher
Name*:
Springer
URL:
Address*:
Berlin, Germany
Type:
Full paper
Vol, No, Year, pp.
Series:
Lecture Notes in Artificial Intelligence
Volume:
1104
Number:
Month:
Pages:
275-287
Year*:
1996
VG Wort Pages:
ISBN/ISSN:
3-540-61-511-3
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
The first-order theories of finite and rational, constructor and
feature trees possess complete axiomatizations and are decidable by
quantifier elimination [Malcev 61, Kunen 87, Maher 88,
Comon-Lescanne 89, Hodges 93, Backofen-Smolka 92, Smolka-Treinen 92,
Backofen-Treinen94, Backofen95].
By using the uniform inseparability lower bounds techniques due to
[Compton-Henson 90], based on representing
large binary relations by means of short formulas manipulating with
high trees, we prove that all the above theories, as well as all
their subtheories, are NON-ELEMENTARY in the sense of
Kalmar, i.e., cannot be decided within time bounded by a $k$-story
exponential function for any fixed $k$.
Moreover, for some constant $d>0$ these decision problems require
nondeterministic time exceeding $\exp_\infty(dn)$
Keywords:
Complexity, decision procedures, theorem proving
HyperLinks / References / URLs:
http://www.mpi-sb.mpg.de/~sv/publications/reports/2ILB
.{dvi,ps}.Z
Download
Access Level:
Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat
BibTeX Entry:
@INPROCEEDINGS
{
Vorobyov96CADE96
,
AUTHOR = {Vorobyov, Sergei},
EDITOR = {McRobbie, M. A. and Slaney, J. K.},
TITLE = {An improved lower bound for the elementary theories of trees},
BOOKTITLE = {Proceedings of the 13th International Conference on Automated Deduction (CADE-13)},
PUBLISHER = {Springer},
YEAR = {1996},
TYPE = {Full paper},
ORGANIZATION = {AT&T, Bell Labs, Lucent, IEEE, CADE inc},
VOLUME = {1104},
PAGES = {275--287},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {New Brunswick, USA},
ISBN = {3-540-61-511-3},
}
Entry last modified by Uwe Brahm, 03/12/2010
Edit History (please click the blue arrow to see the details)
Edit History (please click the blue arrow to see the details)
Editor(s)
Sergei Vorobyov
Created
03/11/1997 12:33:38 PM
Revisions
6.
5.
4.
3.
2.
Editor(s)
Uwe Brahm
Uwe Brahm
Uwe Brahm
Uwe Brahm
Uwe Brahm
Edit Dates
27.03.97 22:19:46
24.03.97 21:34:14
17.03.97 18:17:03
17.03.97 18:15:02
11/03/97 14:45:06