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):

Ganzinger, Harald
McAllester, David

dblp
dblp

Not MPG Author(s):

McAllester, David

Editor(s):

Goré, Rajeev
Leitsch, Alexander
Nipkow, Tobias

dblp
dblp
dblp

Not MPII Editor(s):

Goré, Rajeev
Leitsch, Alexander
Nipkow, Tobias

BibTeX cite key*:

GanzingerMcAllester-01-ijcar

Title, Booktitle

Title*:

A new meta-complexity theorem for bottom-up logic programs


_01IJCAR-2.pdf (163.52 KB)

Booktitle*:

Automated reasoning : First International Joint Conference, IJCAR 2001

Event, URLs

URL of the conference:

http://www.dii.unisi.it/~ijcar/

URL for downloading the paper:


Event Address*:

Siena, Italy

Language:

English

Event Date*
(no longer used):

-- June 18-22, 2001

Organization:


Event Start Date:

18 June 2001

Event End Date:

22 June 2001

Publisher

Name*:

Springer

URL:

http://www.springer.de/

Address*:

Berlin, Germany

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Artificial Intelligence

Volume:

2083

Number:


Month:


Pages:

514-528

Year*:

2001

VG Wort Pages:


ISBN/ISSN:

3-540-42254-4

Sequence Number:


DOI:




Note, Abstract, ©


(LaTeX) Abstract:

Nontrivial
meta-complexity theorems, proved once for a programming language
as a whole, facilitate the presentation and analysis
of particular algorithms. This paper gives a new
meta-complexity theorem
for bottom-up logic programs
that is both more general and more accurate
than previous such theorems.
The new theorem applies to algorithms
not handled by previous meta-complexity theorems,
greatly facilitating their analysis.



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, VG Wort



BibTeX Entry:

@INPROCEEDINGS{GanzingerMcAllester-01-ijcar,
AUTHOR = {Ganzinger, Harald and McAllester, David},
EDITOR = {Gor{\'e}, Rajeev and Leitsch, Alexander and Nipkow, Tobias},
TITLE = {A new meta-complexity theorem for bottom-up logic programs},
BOOKTITLE = {Automated reasoning : First International Joint Conference, IJCAR 2001},
PUBLISHER = {Springer},
YEAR = {2001},
VOLUME = {2083},
PAGES = {514--528},
SERIES = {Lecture Notes in Artificial Intelligence},
ADDRESS = {Siena, Italy},
ISBN = {3-540-42254-4},
}


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)
Christine Kiesel
Created
08/27/2001 04:32:04 PM
Revisions
20.
19.
18.
17.
16.
Editor(s)
Christine Kiesel
Christine Kiesel
Christine Kiesel
Harald Ganzinger
Harald Ganzinger
Edit Dates
01.09.2003 17:22:40
01.09.2003 14:43:11
28.07.2003 17:24:45
16.05.2003 10:45:58
14.05.2003 18:44:06
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
_01IJCAR-2.pdf