The Complexity of Valued Constraint Satisfaction Problems

Authors:

ISBN: 978-3-642-33973-8 (Print) 978-3-642-33974-5 (Online)

Table of contents (10 chapters)

  1. Front Matter

    Pages I-XVII

  2. Part I

    1. Front Matter

      Pages 1-1

    2. No Access

      Chapter

      Pages 3-27

      Background

  3. Expressive Power

    1. Front Matter

      Pages 29-29

    2. No Access

      Chapter

      Pages 31-47

      Expressibility of Valued Constraints

    3. No Access

      Chapter

      Pages 49-78

      Expressibility of Fixed-Arity Languages

    4. No Access

      Chapter

      Pages 79-94

      Expressibility of Submodular Languages

    5. No Access

      Chapter

      Pages 95-114

      Non-expressibility of Submodular Languages

  4. Tractability

    1. Front Matter

      Pages 115-115

    2. No Access

      Chapter

      Pages 117-124

      Tractable Languages

    3. No Access

      Chapter

      Pages 125-129

      Conservative Languages

    4. No Access

      Chapter

      Pages 131-135

      The Power of Linear Programming

    5. No Access

      Chapter

      Pages 137-149

      Hybrid Tractability

    6. No Access

      Chapter

      Pages 151-152

      Summary and Open Problems

  5. Back Matter

    Pages 153-170