menu
{ "item_title" : "Constraint Resolution Theories", "item_author" : [" Denis Berthier "], "item_description" : "Constraint Resolution Theories introduces a pure logic perspective of the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the simplest solution. Based on constructive logic, the resolution paradigm involves resolution rules, i.e. logical formulin the condition-action form, where the condition pattern implies the elimination of a candidate (a possible value for a CSP variable). Defining a resolution theory as a set of resolution rules, it introduces several families of such theories. Each of them carries its own notion of simplicity, defines a rating of CSP instances and satisfies two main theorems: the confluence property (guaranteeing that the associated rating has good computational properties) and a correspondence with a form of structured search procedure without guessing (Trial-and-Error). Throughout the book, Sudoku is used for illustrative purposes.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/1/44/786/888/1447868889_b.jpg", "price_data" : { "retail_price" : "25.12", "online_price" : "25.12", "our_price" : "25.12", "club_price" : "25.12", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Constraint Resolution Theories|Denis Berthier

Constraint Resolution Theories

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

"Constraint Resolution Theories" introduces a pure logic perspective of the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Based on constructive logic, the resolution paradigm involves resolution rules, i.e. logical formul in the condition-action form, where the condition pattern implies the elimination of a candidate (a possible value for a CSP variable). Defining a resolution theory as a set of resolution rules, it introduces several families of such theories. Each of them carries its own notion of simplicity, defines a rating of CSP instances and satisfies two main theorems: the confluence property (guaranteeing that the associated rating has good computational properties) and a correspondence with a form of structured search procedure without guessing (Trial-and-Error). Throughout the book, Sudoku is used for illustrative purposes.

This item is Non-Returnable

Details

  • ISBN-13: 9781447868880
  • ISBN-10: 1447868889
  • Publisher: Lulu Press
  • Publish Date: September 2011
  • Dimensions: 9.21 x 6.14 x 0.65 inches
  • Shipping Weight: 0.97 pounds
  • Page Count: 312

Related Categories

You May Also Like...

    1

BAM Customer Reviews