Advertisement

Resolution

  • Stasys Jukna
Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 27)

Abstract

Propositional proof systems operate with boolean formulas, the simplest of which are clauses, that is, ORs of literals, where each literal is either a variable \({x}_{i}\) or its negation \( \Gamma{x}_{i}\).A truth-assignment is an assignment of constants 0 and 1 to all the variables. Such an assignment satisfies (falsifies) a clause if it evaluates at least one (respectively, none) of its literals to 1.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations