An historical overview of computational complexity is presented. Emphasis is on the
fundamental issues of defining the intrinsic computational complexity of a problem and …

Algorithms and Theory of Computation Handbook, Second Edition: Special Topics and
Techniques provides an up-to-date compendium of fundamental computer science topics …

This is the second volume of a two volume collection on Structural Complexity. This volume
assumes as a prerequisite knowledge about the topics treated in Volume I, but the present …

Publisher Summary This chapter discusses the concepts needed for defining the complexity
classes. A complexity class is a set of problems of related resource-based complexity. A …

When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

Temporal logic. Logical formalisms for reasoning about time and the timing of events appear
in several fields: physics, philosophy, linguistics, etc. Not surprisingly, they also appear in …

This account of propositional logic concentrates on the algorithmic translation of important
methods, especially of decision procedures for (subclasses of) propositional logic. Important …

The view that machines cannot give rise to surprises is due, I believe, to a fallacy to which
philosophers and mathematicians are particularly subject. This is the assumption that as …

This paper presents an extension of Disjunctive Datalog (DATALOG/sup V,/spl sim//) by
integrity constraints. These are of two types: strong, that is, classical integrity constraints and …

In this paper we give a short introduction to logic programming approach to knowledge
representation and reasoning. The intention is to help the reader to develop a 'feel'for the …