Logic Programming

Volume 2401 of the series Lecture Notes in Computer Science pp 209-223


Logical Algorithms

  • Harald GanzingerAffiliated withMPI Informatik
  • , David McAllesterAffiliated withAT&T Labs-Research

* Final gross prices may vary according to local VAT.

Get Access


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.