OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Constraint-Based Reasoning
Bookmark Share

Text

Constraint-Based Reasoning

Freuder, Eugene C. - Personal Name; Mackworth, Alan K. - Personal Name;

"A Bradford book."Reprinted from Artificial intelligence, volume 58, numbers 1-3, 1992.Constraint-based reasoning is an important area of automated reasoning in artificial intelligence, with many applications. These include configuration and design problems, planning and scheduling, temporal and spatial reasoning, defeasible and causal reasoning, machine vision and language understanding, qualitative and diagnostic reasoning, and expert systems. Constraint-Based Reasoning presents current work in the field at several levels: theory, algorithms, languages, applications, and hardware.Constraint-based reasoning has connections to a wide variety of fields, including formal logic, graph theory, relational databases, combinatorial algorithms, operations research, neural networks, truth maintenance, and logic programming. The ideal of describing a problem domain in natural, declarative terms and then letting general deductive mechanisms synthesize individual solutions has to some extent been realized, and even embodied, in programming languages.Contents :- Introduction, E. C. Freuder, A. K. Mackworth.- The Logic of Constraint Satisfaction, A. K. Mackworth.- Partial Constraint Satisfaction, E. C. Freuder, R. J. Wallace.- Constraint Reasoning Based on Interval Arithmetic: The Tolerance Propagation Approach, E. Hyvonen.- Constraint Satisfaction Using Constraint Logic Programming, P. Van Hentenryck, H. Simonis, M. Dincbas.- Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems, S. Minton, M. D. Johnston, A. B. Philips, and P. Laird.- Arc Consistency: Parallelism and Domain Dependence, P. R. Cooper, M. J. Swain.- Structure Identification in Relational Data, R. Dechter, J. Pearl.- Learning to Improve Constraint-Based Scheduling, M. Zweben, E. Davis, B. Daun, E. Drascher, M. Deale, M. Eskey.- Reasoning about Qualitative Temporal Information, P. van Beek.- A Geometric Constraint Engine, G. A. Kramer.- A Theory of Conflict Resolution in Planning, Q. Yang.A Bradford Book.OCLC-licensed vendor bibliographic record.


Availability

No copy data

Detail Information
Series Title
-
Call Number
-
Publisher
Cambridge, Mass. : : MIT Press Direct., 1994
Collation
1 online resource (403 pages) :illustrations
Language
English
ISBN/ISSN
9780262288446
Classification
NONE
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
-
Subject(s)
Reasoning.
Constraints (Artificial intelligence)
Specific Detail Info
-
Statement of Responsibility
Eugene C. Freuder and Alan K. Mackworth
Other Information
Cataloger
imron
Source
-
Validator
-
Digital Object Identifier (DOI)
https://doi.org/10.7551/mitpress/2122.001.0001
Journal Volume
-
Journal Issue
-
Subtitle
-
Parallel Title
-
Other version/related

No other version available

File Attachment
  • Constraint-Based Reasoning
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?