NASA NTRS · 19910000620
Solving Constraint-Satisfaction Problems In Prolog Language
Abstract
Technique 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.
Keep this discovery
Explore connections, maps & timelines
Nachtsheim, Philip R.. 1991-11-01. Solving Constraint-Satisfaction Problems In Prolog Language. https://ntrs.nasa.gov/citations/19910000620
Cite the original work for its findings. Save a collection to share your selection of sources.