Amazon cover image
Image from Amazon.com
Image from Google Jackets

A Perspective of Constraint-Based Reasoning [electronic resource] : An Introductory Tutorial / edited by Hans Werner Guesgen, Joachim Hertzberg.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence ; 597Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1992Description: IX, 127 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540471936
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 006.3 23
LOC classification:
  • Q334-342
  • TJ210.2-211.495
Online resources:
Contents:
The office world -- Constraint concepts -- Constraint relaxation -- Backtracking approaches -- From simple filtering to tagging -- Appoaches to filtering in parallel -- Optimization approaches -- Instead of a conclusion.
In: Springer eBooksSummary: Much of AI research is about problem-solving strategies, and several techniques have been crystalized. One such technique is constraint satisfaction or reasoning based on relations. Constraint-based reasoning is used to solve a wide field of problems, and recently constraint techniques have been incorporated into logic programming languages, yielding a whole new field of research and application: constraint logic programming. Constraint satisfaction techniques have become part of almost all introductory books on AI. This monograph is about constraint satisfaction. It differs from others in that it presents all approaches under a common, generalizing view: dynamic constraints. This new way of viewing constraints provides new insights about the different approaches, and forms a very practical basis for teaching constraint-based reasoning. A uniform view of the constraint world is also a good basis for constraint research. This text is not intended to be a self-contained textbook on constraint-based reasoning, but rather a coherent text on an interesting view of the field.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK6000

The office world -- Constraint concepts -- Constraint relaxation -- Backtracking approaches -- From simple filtering to tagging -- Appoaches to filtering in parallel -- Optimization approaches -- Instead of a conclusion.

Much of AI research is about problem-solving strategies, and several techniques have been crystalized. One such technique is constraint satisfaction or reasoning based on relations. Constraint-based reasoning is used to solve a wide field of problems, and recently constraint techniques have been incorporated into logic programming languages, yielding a whole new field of research and application: constraint logic programming. Constraint satisfaction techniques have become part of almost all introductory books on AI. This monograph is about constraint satisfaction. It differs from others in that it presents all approaches under a common, generalizing view: dynamic constraints. This new way of viewing constraints provides new insights about the different approaches, and forms a very practical basis for teaching constraint-based reasoning. A uniform view of the constraint world is also a good basis for constraint research. This text is not intended to be a self-contained textbook on constraint-based reasoning, but rather a coherent text on an interesting view of the field.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India