Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Width Versus Size in Resolution Proofs
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 3959/2006
Book
Theory and Applications of Models of Computation
DOI
10.1007/11750321
Copyright
2006
ISBN
978-3-540-34021-8
Category
Plenary Lectures
DOI
10.1007/11750321_6
Pages
79-88
Subject Collection
Computer Science
SpringerLink Date
Friday, May 05, 2006
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (355.7 KB)
Free Preview
Plenary Lectures
Width Versus Size in Resolution Proofs
Alasdair Urquhart
1
(1)
Departments of Philosophy and Computer Science, University of Toronto, Toronto, Ontario M5S 1A1, Canada
Abstract
The complexity of resolution refutations of contradictory sets of clauses in propositional logic has been investigated deeply over the last forty years, beginning with the groundbreaking paper of Tseitin [16], based on a talk given in a Leningrad seminar of 1966.
A general theme that emerged gradually in the course of the intensive investigations of the last few decades has been that of basing
size
lower bounds on lower bounds on the
width
of refutations. Roughly speaking, it turns out that in many cases, the minimum size of a refutation is exponential in the minimum width.
Alasdair
Urquhart
Email:
urquhart@cs.toronto.edu
Fulltext Preview (Small,
Large
)
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.111 • Server: mpweb16
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)