English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Logical Algorithms

Ganzinger, H., & McAllester, D. (2002). Logical Algorithms. In Logic Programming. 18th International Conference, ICLP 2002 (pp. 209-223). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ganzinger, Harald1, Author           
McAllester, David, Author
Stuckey, Peter J., Editor
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: It is widely accepted that many algorithms can be concisely and clearly expressed as logical inference rules. However, logic programming has been inappropriate for the study of the running time of algorithms because there has not been a clear and precise model of the run time of a logic program. We present a logic programming model of computation appropriate for the study of the run time of a wide variety of algorithms.

Details

show
hide
Language(s): eng - English
 Dates: 2003-09-012002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 202140
Other: Local-ID: C1256104005ECAFC-579C0AB32F1BD048C1256C410068CB89-GanzingerMcAllester-02-iclp
 Degree: -

Event

show
hide
Title: ICLP 2002
Place of Event: Copenhagen, Denmark
Start-/End Date: 2002-07-29 - 2002-08-01

Legal Case

show

Project information

show

Source 1

show
hide
Title: Logic Programming. 18th International Conference, ICLP 2002
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 209 - 223 Identifier: ISBN: 3-540-43930-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 2401 Sequence Number: - Start / End Page: - Identifier: -