FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

Volume 3821 of the series Lecture Notes in Computer Science pp 60-78

Inference Systems for Logical Algorithms

  • Natarajan ShankarAffiliated withComputer Science Laboratory, SRI International

* Final gross prices may vary according to local VAT.

Get Access


Logical algorithms are defined in terms of individual computation steps that are based on logical inferences. We present a uniform framework for formalizing logical algorithms based on inference systems. We present inference systems for algorithms such as resolution, the Davis–Putnam–Logemann–Loveland procedure, equivalence and congruence closure, and satisfiability modulo theories. The paper is intended as an introduction to the use of inference systems for studying logical algorithms.