NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Solving Constraint-Satisfaction Problems In Prolog LanguageTechnique for solution of constraint-satisfaction problems uses definite-clause grammars of Prolog computer language. Exploits fact that grammar-rule notation viewed as "state-change notation". Facilitates development of dynamic representation performing informed as well as blind searches. Applicable to design, scheduling, and planning problems.
Document ID
19910000620
Acquisition Source
Legacy CDMS
Document Type
Other - NASA Tech Brief
Authors
Nachtsheim, Philip R. (NASA Ames Research Center, Moffett Field, CA.)
Date Acquired
August 14, 2013
Publication Date
November 1, 1991
Publication Information
Publication: NASA Tech Briefs
Volume: 15
Issue: 11
ISSN: 0145-319X
Subject Category
Mathematics And Information Sciences
Report/Patent Number
ARC-12460
Accession Number
91B10620
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.

Related Records

IDRelationTitleN89-13974/TBSee AlsoA Technique For Solving Constraint Satisfaction Problems Using Prolog's Definite Clause Grammars"
No Preview Available