Cantitate/Preț
Produs

Over-Constrained Systems: Lecture Notes in Computer Science, cartea 1106

Editat de Michael Jampel, Eugene Freuder, Michael Maher
en Limba Engleză Paperback – 24 iul 1996
This volume presents a collection of refereed papers reflecting the state of the art in the area of over-constrained systems.
Besides 11 revised full papers, selected from the 24 submissions to the OCS workshop held in conjunction with the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Marseilles in September 1995, the book includes three comprehensive background papers of central importance for the workshop papers and the whole field. Also included is an introduction by one of the volume editors together with a bibliography listing 243 entries. All in all this is a very useful reference book relevant for all researchers and practitioners interested in hierarchical, partial, and over-constrained systems.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33388 lei

Preț vechi: 41734 lei
-20% Nou

Puncte Express: 501

Preț estimativ în valută:
6390 6592$ 5408£

Carte tipărită la comandă

Livrare economică 05-19 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540614791
ISBN-10: 3540614796
Pagini: 328
Ilustrații: X, 314 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:1996
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

A brief overview of over-constrained systems.- Constraint hierarchies.- Partial constraint satisfaction.- Semiring-based CSPs and valued CSPs: Basic properties and comparison.- Defeasible constraint solving.- Transforming ordered constraint hierarchies into ordinary constraint systems.- A compositional theory of constraint hierarchies (Operational semantics).- Heuristic methods for over-constrained constraint satisfaction problems.- Cascaded directed arc consistency and no-good learning for the maximal constraint satisfaction problem.- Partial arc consistency.- Dynamic constraint satisfaction with conflict management in design.- Specifying over-constrained problems in default logic.- Implementing constraint relaxation over finite domains using assumption-based truth maintenance systems.- Experiences in solving constraint relaxation networks with Boltzmann Machines.- Solving over-constrained CSP using weighted OBDDs.