Rule compilation from constraint-based problem solving

  • Suresh Subramanian
  • , Eugene C. Freuder

Research output: Chapter in Book/Report/Conference proceedingsConference proceedingpeer-review

Abstract

A constraint-based system for automating the acquisition of problem-solving knowledge is described. The approach is novel in attempting to compile rules from the observation of constraint-based, relaxation-based problem solving. The system has three main components: a constraint-based problem solver, a rule-compiler, and a rule-based problem solver. A relation consistency algorithm is the backbone of the constraint-based problem solver. One advantage of this method is that customized expert systems can be built by manipulating the problems used for learning. Experiments were performed to evaluate a prototype learning system and some extensions.

Original languageEnglish
Title of host publicationProc 2 Int IEEE Conf Tools Artif Intell
PublisherPubl by IEEE
Pages38-47
Number of pages10
ISBN (Print)0818620846
Publication statusPublished - 1990
Externally publishedYes
EventProceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence - Herndon, VA, USA
Duration: 6 Nov 19909 Nov 1990

Publication series

NameProc 2 Int IEEE Conf Tools Artif Intell

Conference

ConferenceProceedings of the 2nd International IEEE Conference on Tools for Artificial Intelligence
CityHerndon, VA, USA
Period6/11/909/11/90

Fingerprint

Dive into the research topics of 'Rule compilation from constraint-based problem solving'. Together they form a unique fingerprint.

Cite this