Bookbot
Das Buch ist derzeit nicht auf Lager

Constraint Resolution Theories

Parameter

Seitenzahl
312 Seiten
Lesezeit
11 Stunden

Mehr zum Buch

Focusing on the finite Constraint Satisfaction Problem (CSP), this work presents a pure logic approach to identifying the simplest solutions. It introduces resolution theories based on constructive logic, utilizing resolution rules to eliminate candidate values for CSP variables. Various families of these theories are defined, each with a unique simplicity measure and a rating system for CSP instances. The book ensures good computational properties through the confluence property and aligns with a structured search method, using Sudoku as a key illustrative example.

Buchkauf

Constraint Resolution Theories, Denis Berthier

Sprache
Erscheinungsdatum
2011
product-detail.submit-box.info.binding
(Paperback)
Wir benachrichtigen dich per E-Mail.

Lieferung

  •  

Zahlungsmethoden

Feedback senden